MODIFIND

(algorithm)

Definition: An algorithm to select the k^th smallest element of an array and partition the array around it. It partitions around the value of the k^th element until one boundary passes element k. If either boundary does not pass element k, that boundary is moved and it partitions again.

See also select and partition, Find, Select.

Note: This does fewer swaps than Find.

Author: PEB

Implementation

More information

Vladimir Zabrodsky, MODIFIND, Elektronika, No. 6, pages 33-34, 1992

If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.

Entry modified 14 December 2005.
HTML page formatted Mon Sep 11 09:46:05 2006.

Cite this as:
Paul E. Black, "MODIFIND", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 14 December 2005. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/modifind.html