sorting algorithm

(redirected from Sort algorithm)
Also found in: Dictionary, Encyclopedia.
Related to Sort algorithm: Bubble sort algorithm
Graphic Thesaurus  🔍
Display ON
Animation ON
  • noun

Words related to sorting algorithm

an algorithm for sorting a list

References in periodicals archive ?
Like Quicksort and Bubble Sort, Direct insertion sort is a comparison sort algorithm.
The described radix sort algorithm implements multiple parallel scan operations through efficient fine grain parallelism (Nickolls et al.
The sort algorithm is employed to develop a merged list of pickups and deliveries, thereby setting priorities for vehicle routing.
The elements that are being processed by the radix sort algorithm are usually called "keys" and they can exist independently or can be associated with other data.
The first group of two videos concerned the basic quicksort algorithm, the second group of two videos was related to two modified version of the quicksort algorithm, the third group contained only one video of the mergesort algorithm, and the last group of three videos concerned the heap sort algorithm.
For instance, we may apply a network from Merge Sort algorithm.
The standard merge sort algorithm works as follows: In the "run" formation phase, the N/B tracks are inputted into memory, in groups of one memoryload at a time; each memoryload is sorted into a "run," which is then output to consecutive positions on disk.
For the experiment in part B it apparently makes little difference which of the data structures is chosen for a heap sort algorithm.