selection sort

selection sort

[si′lek·shən ‚sȯrt]

(computer science)

A sorting routine that scans a list of items repeatedly and, on each pass, selects the item with the lowest value and places it in its final position.

McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.

selection sort

(1) A sorting technique that is typically used for sequencing small lists. It starts by comparing the entire list for the lowest item and moves it to the #1 position. It then compares the rest of the list for the next-lowest item and places it in the #2 position and so on until all items are in the required order. Selection sorts perform numerous comparisons, but fewer data movements than other methods. See sort algorithm.

(2) A search for specific data starting at the beginning of a file or list. It copies each matching item to a new file so that the selected items are in the same sequence as the original data.

Copyright © 1981-2025 by The Computer Language Company Inc. All Rights reserved. THIS DEFINITION IS FOR PERSONAL USE ONLY. All other reproduction is strictly prohibited without permission from the publisher.