Description: the implementation for quick sort in the course of alogrithm.The essence of quick sort lies in the implementation of the function partition.The code contains two imlementation methods for partion——the normal one and the randomised one.By compatation, the speed of the randomised one has a better expectation.
To Search:
File list (Check if you may need any files):
quick_sort
..........\Debug
..........\.....\main.obj
..........\.....\quick.obj
..........\.....\quick_sort.exe
..........\.....\quick_sort.ilk
..........\.....\quick_sort.pch
..........\.....\quick_sort.pdb
..........\.....\vc60.idb
..........\.....\vc60.pdb
..........\main.cpp
..........\quick.cpp
..........\quick.h
..........\quick_sort.dsp
..........\quick_sort.plg
Download