💡 Words with a Similar Meaning to "Selection sort"
Found via reverse dictionary — words that share a conceptual meaning.
| Word | Definition |
|---|---|
| subsortnoun | The sorting of a subset of already sorted elements. |
| mergesortnoun | (computing) A divide and conquer sorting algorithm that operates by dividing the items to be sorted into many small lists and gradually merging them together. |
| bucket sortnoun | (computing theory) A sorting algorithm that partitions an array into a number of buckets (groups of elements) which are then individually sorted, either recursively or using some other algorithm. |
| introspective sortnoun | (computing) A sorting algorithm that begins with quicksort and switches to heapsort when the recursion depth exceeds a level based on (the logarithm of) the number of elements being sorted. |
| cycle sortnoun | (computing theory) A sorting algorithm based on the idea that the permutation to be sorted can be factored into cycles that can be rotated individually to give a sorted result. |
| bucketsortnoun | Alternative form of bucket sort. [(computing theory) A sorting algorithm that partitions an array into a number of buckets (groups of elements) which are then individually sorted, either recursively or using some other algorithm.] |
| binary searchnoun | (computing theory) A search for a value within a sorted array by repeatedly comparing the target value with the middle element; if they are unequal, the half in which the target cannot lie is eliminated and the comparison is repeated on the remaining half. |
| topological sortnoun | (graph theory, computer science) An ordering of the vertices of a directed graph such that if an edge goes from vertex u to vertex v then u precedes v in the ordering. |
| cubesortnoun | (computing theory) A parallel sorting algorithm that builds a self-balancing multidimensional array from the keys to be sorted. |
| smoothsortnoun | (computing theory) A sorting algorithm based on heapsort but using the Leonardo numbers, tending to perform better than heapsort in cases where the items to be sorted are already partially sorted. |
| counting sortnoun | (computing) A sorting algorithm that counts how many times each integer key appears in an array and then reorders the array based on those counts. |
| radix sortnoun | (computing) Any of various sorting algorithms in which items are processed according to the value of each digit or character in turn |
| pivotnoun | (figuratively, by extension) Something or someone having a paramount significance in a certain situation. |
| subsequencenoun | (mathematics) A sequence that is contained within a larger one. |
| sortitionnoun | Selection by drawing lots. |
| total ordernoun | (set theory, order theory) A partial order, ≤, (a binary relation that is reflexive, antisymmetric, and transitive) on some set S, such that any two elements of S are comparable (for any x, y ∈ S, either x ≤ y or y ≤ x). |
| selectionnoun | The process or act of selecting. |
| many-sorted logicnoun | (logic) A logic that directly supports classification of entities into disjunct sorts. |
| difference setnoun | (combinatorics) A subset of a group such that any element of the group can be expressed as the difference (or the quotient) of two elements in such subset. |
| sortnoun | A general type. |
Translate “Selection sort” into Another Language
Pick a language — the word will be pre-filled in the translator.