Platform: Ubuntu 12.04/GCC 4.6.7
- Insert Sort
1#include <vector>2#include <algorithm>3#include <iostream>4 using namespacestd;5 6Template <typename t>7 voidInsertsort (vector<t>&VEC) {8 //vector<t>::iterator ite;9 for(Auto j=1; J<vec.size (); j + +)Ten { OneT key=Vec[j]; A inti=j-1; - while(i>=0&&vec[i]>key) - { thevec[i+1]=Vec[i]; -i--; - } -vec[i+1]=key; + } - } + ATemplate<typename t> at voidPrintvector (Constvector<t>&VEC) - { - for(Auto i=0; I<vec.size (); i++) -cout<<vec[i]<<" "; - -cout<<Endl; in } - to intMain () + { - the //void Insertsort (vector<int>& vec); * //void Printvector (const vector<int>& VEC); $ Panax Notoginsengvector<int>Vec; - for(intI=Ten;i< -; i++) the { + Vec.push_back (i); A } the Printvector (VEC); + Random_shuffle (Vec.begin (), Vec.end ()); - Printvector (VEC); $ Insertsort (VEC); $ Printvector (VEC); - - return 0; the}
View CodeOperation Result:
Introduction to Algorithms learning NOTE 1---Sorting algorithm (platform: GCC 4.6.7)