/*
 * vector_algorithm.cpp
 *
 *  Created on: Apr 8, 2019
 *      Author: johnsontimoj
 */
//////////////////////////
//
// code to demonstrate vector algorithms
//
///////////////////////////

#include <vector>
#include <algorithm>

#include <iostream>
using namespace std;

void load_vector(vector<int> & myvector);
void load_vector2(vector<int> & myvector);
void print_vector(const vector<int> & myvector);

int main(void){
	vector<int> v1(20);
	vector<int> v2;

	load_vector(v1);
	print_vector(v1);

	cout << v1.front() << "-" << v1.back() << endl;
	cout << "location of 33: " << find(v1.begin(), v1.end(), 33) - v1.begin() << endl;

    cout << "is 44 present? " << binary_search(v1.begin(), v1.end(), 44) << endl;
    sort(v1.begin(), v1.end());
    cout << "sorted ";
    print_vector(v1);
    cout << "is 44 present? " << binary_search(v1.begin(), v1.end(), 44) << endl;

    random_shuffle(v1.begin(), v1.end());
    cout << "random ";
    print_vector(v1);

    v1.insert(v1.begin()+5, 99);
    print_vector(v1);

    load_vector2(v2);
	cout << "vector2 ";
	print_vector(v2);

	reverse(v2.begin(), v2.end());
	cout << "reversed ";
	print_vector(v2);

	cout << *v2.begin() << "-" << *v2.end() << endl;

	return 0;
}

void load_vector(vector<int> & myvector){
	for(unsigned int i=0; i< myvector.size(); i++){
		myvector[i] = (i*i*i+1)%100;
	}
	return;
}
void load_vector2(vector<int> & myvector){
	for(unsigned int i=0; i < 20; i++){
		myvector.push_back((i*i*i*i)%100);
	}
	return;
}
void print_vector(const vector<int> & myvector){
    vector<int>::const_iterator itr;
    for(itr = myvector.begin(); itr != myvector.end(); itr++){
        cout << *itr << " ";
    }
    cout << endl;
    return;
}