Description: Radix sort
Element assignment radix sort (radix sort) are assigned ordering (distribution sort), also known as bucket Law (bucket sort) or bin sort, as the name suggests, it is part of the information through the key will be sorted to some of the barrel in order to achieve the sort of role, radix sort belongs to the sort of stability, its time complexity is O (nlog (r) m), where r is taken to the base, and m is the heap number, at some point, radix sort efficiency than other sort of stability.
Quick Sort
Fast Sorted by C. A. R. Hoare proposed in 1962. Its basic idea is: a trip by ordering the data to be sorted into separate two parts, one part of all of the data than the other portion of all data should be small, then the data in this way for the two parts separately fast sort, the entire sorting process can be recursively in order to achieve the whole data into an ordered sequence.
Heap sort
Heap sort (Heapsort) refers to a sorting algorithm uses stacked tree (h
To Search:
File list (Check if you may need any files):
排序 求幂
.........\基数排序.cpp
.........\堆排序.cpp
.........\快速排序.cpp
.........\求幂.cpp
Download