MODIFIND

(algorithm)

Definition: Select the k^th smallest element of an array and partition the array around it. Partition around the value of the k^th element. If the partition boundary is not at k, repeat in the partition that includes k.

See also select and partition, Find, Select.

Note: This does fewer swaps than Find.

Author: PEB

More information

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

Go to the Dictionary of Algorithms and Data Structures home page.

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

Entry modified 31 January 2011.
HTML page formatted Fri Mar 25 16:20:34 2011.

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. 31 January 2011. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/modifind.html