Fastest way to search and sort vectors

Question

I\'m doing a project in which i need to insert data into vectors sort it and search it ...

i need fastest possible algorithms for sort and search ... i\'ve been sea

Answer 1

if your elements are of integer you should use bucket sort algorithm which run at O(N) time instead of O(nlogn) average case as with qsort [http://en.wikipedia.org/wiki/Bucket_sort]