Definition: Select the kth smallest element of an array and partition the array around it. Partition around the value of the kth 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.
Vladimir Zabrodsky, MODIFIND, Elektronika, No. 6, pages 33-34, 1992
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 31 January 2011.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Paul E. Black, "MODIFIND", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 31 January 2011. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/modifind.html