Description: Quick sort algorithm is based on the sub-rule strategy to another sorting algorithm. The basic idea is that the word group for the importation of a [p: r], according to the following three steps to sort: (1) Decomposition: to a [p] as the base element would be a [p: r] is divided into 3 paragraphs a [p: q-1], a [q] and a [q+ 1: r], makes a [p: q-1] of any element less than or equal to a [q], a [q+ 1: r] , any element greater than or equal to a [q]. Subscript q in the demarcation process to determine (2) Recursive Solution: recursive call through the quick sort algorithm, respectively, of a [p: q-1] and a [q+ 1: r] sort (3) the merger: the a [p: q-1] and a [q+ 1: r] has lined up sequence of circumstances, do not need to perform any computation, a [p: r] has lined up an average sequence algorithm complexity O (nlogn)
File list (Check if you may need any files):
Download