常用排序算法实现

Assignment name sort insert sort heap sort quick sort bubble sort counting sort bucket sort Author luckydog BeginTime 2011 08 22 09 25 35 weekdy ModifyTime Email guojianqi2005 include include using namespace std insert sort template void Insert sort vectori 0 j vec j 1 key heap sort template void Max heapify vector int r 2 i 1 int largest 0 if l vec i 1 largest l else largest i if r vec largest 1 largest r if largest i swap vec i 1 vec largest 1 Max heapify vec largest heap size template void Build max heap vectori 1 i Max heapify vec i vec size template void Heap Sort vector int heap size vec size for int i vec size i 1 i swap vec i 1 vec 0 heap size Max heapify vec 1 heap size quick sort template int partion vector Type key vec second for int j first j second j if vec j key swap vec i vec j swap vec i 1 vec second return i 1 template void quick sort vector quick sort vec first part 1 quick sort vec part 1 second bubble sort template void bubble Sort vector for int i 0 i vec size i exchangefalg false for int j 0 j vec j 1 swap vec j vec j 1 exchangefalg true if exchangefalg return Function counting sort void Counting sort vector for int i 0 i veca size i vecc veca i for int i 1 i 0 i vecb vecc veca i 1 veca i Function bucket sort 0 1 int main int ia 4 1 3 2 16 9 10 14 8 7 int ia 2 5 3 0 2 3 0 3 vector vec ia ia sizeof ia sizeof int vector vecb vec size for int i 0 i vec size i cout vec i cout endl Insert sort vec Heap Sort vec quick sort vec 0 vec size 1 bubble