Definitions from Wiktionary (selection sort)
▸ noun: (computing theory) A sorting algorithm that divides the input list into two sublists — items already sorted, and items not yet sorted — and gradually transfers elements from one list to the other.
▸ Words similar to selection sort
▸ Usage examples for selection sort
▸ Idioms related to selection sort
▸ Wikipedia articles (New!)
▸ Words that often appear near selection sort
▸ Rhymes of selection sort
▸ Invented words related to selection sort
▸ noun: (computing theory) A sorting algorithm that divides the input list into two sublists — items already sorted, and items not yet sorted — and gradually transfers elements from one list to the other.
Similar:
subsort,
mergesort,
bucket sort,
introspective sort,
cycle sort,
bucketsort,
binary search,
topological sort,
cubesort,
smoothsort,
more...
Opposite:
▸ Words similar to selection sort
▸ Usage examples for selection sort
▸ Idioms related to selection sort
▸ Wikipedia articles (New!)
▸ Words that often appear near selection sort
▸ Rhymes of selection sort
▸ Invented words related to selection sort