tree selection sort

Updated About encyclopedia.com content Print Article Share Article
views updated

tree selection sort A refinement of straight selection sort that makes use of the information gained in the first step to save on the subsequent number of comparisons required. It was proposed in 1956 by E. H. Friend and modified by K. E. Iverson in 1962. See also heapsort.