Efficient Selection Algorithm for Nondistinct Elements: 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.

24 December 2023

  • curprev 15:0915:09, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 2,183 bytes −821‎ No edit summary undo
  • curprev 04:5104:51, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 3,004 bytes +3,004‎ Created page with "Title: Efficient Selection Algorithm for Nondistinct Elements Abstract: This research article presents an improved version of the selection algorithm known as Select, originally proposed by Floyd and Rivest in 1975. The algorithm is used to find the kth smallest element in a set of n elements, with nondistinct elements. The main contribution of this research is the analysis of the algorithm, showing that it requires at most n + min {k, n - k} + O(n^2/3 ln 1/3 n) compari..."
Retrieved from "https://simplesci.org/wiki/Efficient_Selection_Algorithm_for_Nondistinct_Elements"