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.

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

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．