Introduction - If you have any usage issues, please Google them yourself
divide-and-rule method can be used to achieve an entirely different sort of way, this sort called Quick Sort (quick sort). In this method, n elements are divided into three (group) : Left of l e f t and the right of g h i r t and middle m i d e d l. The middle contains only one element. Left of the elements are smaller than or equal to the middle element of the right elements are greater than or equal to the middle element. So l e r t and f g h i t element of independent sort, and not on l e r t and f g h i t ranking results merger. M i d e d l of elements called Fulcrum (p i v o t). Figure 1 4-9 is given a quick sort of pseudo-code
Packet : 107215820递归算法快速排序.rar filelist
快速排序\Project1.dpr
快速排序\Project1.dof
快速排序\Project1.cfg
快速排序\Project1.res
快速排序\Unit1.dcu
快速排序\Project1.exe
快速排序\Unit1.~pas
快速排序\Unit1.~dfm
快速排序\Unit1.~ddp
快速排序\Unit1.pas
快速排序\Unit1.dfm
快速排序\Unit1.ddp
快速排序