Quick Sort: 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.

12 May 2023

  • curprev 05:4505:45, 12 May 2023‎ Admin talk contribs‎ 2,605 bytes −10‎ No edit summary undo
  • curprev 05:4405:44, 12 May 2023‎ Admin talk contribs‎ 2,615 bytes +2,615‎ Created page with "== Quick Sort == Quick Sort is an efficient sorting algorithm that works on the divide and conquer principle. It was developed by British computer scientist Tony Hoare in 1959 and published in 1961. The algorithm is well-suited for sorting large datasets, as it has an average-case time complexity of O(n log n), where n is the number of items being sorted. However, the worst-case time complexity is O(n^2), which occurs when the input array is already sorted or reverse so..."
Retrieved from "https://wiki.usaco.fun/index.php/Quick_Sort"