Description: Quicksort is developed by the East Ni Huoer a sorting algorithm. In the average case, sort n items to Ο (n log n) comparisons. In the worst case requires Ο (n2) comparisons, but this situation is not common. In fact, often significantly higher than the other quick sort Ο (n log n) algorithm is faster because its internal loop (inner loop) may be in most architectures it be implemented very efficiently.
To Search:
File list (Check if you may need any files):
quickSort\bin\Debug\quickSort.exe
.........\main.cpp
.........\obj\Debug\main.o
.........\quickSort.cbp
.........\quickSort.depend
.........\quickSort.layout
.........\bin\Debug
.........\obj\Debug
.........\bin
.........\obj
quickSort
Download