概率论与数理统计 (Spring 2024)/Average-case analysis of QuickSort: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

8 April 2024

  • curprev 08:4108:41, 8 April 2024‎ Etone talk contribs‎ 11,838 bytes +11,838‎ Created page with "[http://en.wikipedia.org/wiki/Quicksort '''快速排序'''（'''Quicksort'''）]是由Tony Hoare发现的排序算法。该算法的伪代码描述如下（为方便起见，假设数组元素互不相同——更一般情况的分析易推广得到）： '''''QSort'''''(A): 输入A[1...n]是存有n个不同数字的数组 if n>1 then '''pivot''' = A[1]; 将A中<pivot的元素存于数组L，将A中>pivot的元素存于数组R; \\保持内部元素之..."
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=概率论与数理统计_(Spring_2024)/Average-case_analysis_of_QuickSort"