Quickselect: 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.

21 April 2024

8 August 2023

2 August 2023

  • curprev 12:2312:23, 2 August 2023Helpful talk contribs 350 bytes +350 Created page with "Quickselect is an algorithm that gets the n-th smallest (or largest) item from an unordered list. It's named for its relation to quicksort - and in fact works much like it, and has the same time complexity, but only recurses into half as many decisions, which is ''in specific cases'' can be a lot faster than "just sort everything an pick by index""