Algorithms and its Operations

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main() // for binary search
{
    vector<int> v;
    v.push_back(1);
    v.push_back(3);
    v.push_back(6);
    v.push_back(7);
    cout<<"finding 6 -> "<<binary_search(v.begin(),v.end(),6)<<endl;
    cout<<"finding 5 -> "<<binary_search(v.begin(),v.end(),5)<<endl;
    
    cout<<"lower bound -> "<<lower_bound(v.begin(),v.end(),6)-v.begin()<<endl;
    cout<<"upper bound -> "<<upper_bound(v.begin(),v.end(),6)-v.begin()<<endl;
    
    int a=3, b=5; // to find min and max
    cout<<"max -> "<<max(a,b)<<endl;
    cout<<"min -> "<<min(a,b)<<endl;
    
    swap(a,b);
    cout<<"a -> "<<a<<endl;
    cout<<"b -> "<<b<<endl;
    
    string s="abcde";
    reverse(s.begin(), s.end());
    cout<<"string -> "<<s<<endl;
    
    rotate(v.begin(), v.begin()+1, v.end());
    cout<<"after rotate"<<endl;
    for(int i:v)
    {
        cout<<i<<" ";
    }
    
    sort(v.begin(), v.end());
    cout<<"after sortin"<<endl;
    for(int i:v)
    {
        cout<<i<<" ";
    }
    return 0;
}