quicksort

原创于 2011-06-02 14:49:00 发布 · 2.4k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#pivot #function

本文详细介绍了快速排序算法的具体实现过程，包括分区操作和递归排序两个主要步骤。文章提供了伪代码形式的算法描述，并解释了如何选择枢轴元素及进行数组划分。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

function
 partition(array, left, right, pivotIndex)
     pivotValue := array[pivotIndex]
     swap array[pivotIndex] and array[right]  // Move pivot to end

     storeIndex := left
     for
 i  from 
 left to
 right - 1 // left ≤ i < right

         if
 array[i] < pivotValue
             swap array[i] and array[storeIndex]
             storeIndex := storeIndex + 1
     swap array[storeIndex] and array[right]  // Move pivot to its final place

     return
 storeIndex

function
 quicksort(array, left, right)
     if
 right > left  // subarray of 0 or 1 elements already sorted

         select a pivotIndex in the range left ≤ pivotIndex ≤ right  // see Choice of pivot
 for possible choices

         pivotNewIndex := partition(array, left, right, pivotIndex)  // element at pivotNewIndex is now at its final position

         quicksort(array, left, pivotNewIndex - 1)  // recursively sort elements on the left of pivotNewIndex

         quicksort(array, pivotNewIndex + 1, right)  // recursively sort elements on the right of pivotNewIndex