Thank you, pal!
You are invited to my clubhouse!
One advantage of Binary Search Algorithm:
Compared to Linear search it is much faster because linear search starts its searching right from the first value but binary searches for something by splitting the array in two again and again and again.
One disadvantage of Binary Search Algorithm:
Have to be sorted, unlike linear search that doesn't have to be.
A.Information on social networking sites can give most or all digits of a person’s social security number.
Answer:
answer:
#include <iostream>
#include<list>
using namespace std;
bool Greater(int x) { return x>3; } int main() { list<int>l; /*Declare the list of integers*/ l.push_back(5); l.push_back(6); /*Insert 5 and 6 at the end of list*/ l.push_front(1); l.push_front(2); /*Insert 1 and 2 in front of the list*/ list<int>::iterator it = l.begin(); advance(it, 2); l.insert(it, 4); /*Insert 4 at position 3*/ for(list<int>::iterator i = l.begin();i != l.end();i++) cout<< *i << " "; /*Display the list*/ cout<<endl; l.erase(it); /*Delete the element 4 inserted at position 3*/ for(list<int>::iterator i = l.begin();i != l.end();i++) cout<< *i << " "; /*Display the list*/ cout<<endl;
l.remove_if(Greater); for(list<int>::iterator i = l.begin();i != l.end();i++) cout<< *i << " ";
/*Display the list*/
cout<<endl; return 0;
}
