sort algorithm


Also found in: Dictionary, Thesaurus.
Related to sort algorithm: Bubble sort algorithm

sort algorithm

[′sȯrt ¦al·gə‚rith·əm]
(computer science)
The methods followed in arranging a set of data items into a sequence according to precise rules.

sort algorithm

A formula used to reorder data into a new sequence. Like all complicated problems, there are many solutions that can achieve the same results, and one sort algorithm can re-sequence data faster than another. In the early 1960s, when magnetic tape was "the" storage medium, the sale of a computer system may have hinged on the sort algorithm, since without direct access capability on disk, every transaction had to be sorted into the sequence of the master files in order to update them. Today, sorting is not quite as conspicuous a process as it used to be; however, reports are still presented in sequential order, and myriad indexes to hard disk data must be maintained in a sequential order.

In-Memory Sorting
Today's considerably larger memories enable many sorts to be performed entirely in memory. However, if there is insufficient memory, a sort program may be able to store data that is partially sorted temporarily on disk and merge that data later into the final sequence. See bubble sort, insertion sort, merge sort, quick sort, selection sort, pigeonhole sort and counting sort.
References in periodicals archive ?
In this case, like the previous sort methods, direct insertion sort algorithm has a maximum polynomial time O ([n.
The Direct insertion sort algorithm obtained in java an average run-time / array of 218.
The Bubble Sort algorithm proved to be the most inefficient, obtaining in java an average run-time / array of 1329.
Of the three programming languages, Java was the most efficient, obtaining for the BubbleSort algorithm an average run-time / array with up to two times lower in comparison with C ++ and up to four times lower in comparison with C#, for the Direct Insertion Sort algorithm an average run-time / array with up to four times lower in comparison with C ++ and up to eight times lower in comparison with C#, for the Quicksort algorithm an average run-time / array with approximately 1.
One of the most important advantages of the radix sort algorithm is the fact that it is easy to parallelize, based on the reduction of the counting sort used at each pass to a parallel prefix or sum operation (Satish et al.
The sort algorithm can be divided into unique phases as outlined below.
The magnitude of these changes will determine the difficulty of estimating the effects; certain differences will require invoking the sort algorithm for a test run, while others will simply need a few minor calculations.
In Step3, the radix sort algorithm processes 8 elements per thread for the GTX 280 GPU, 16 for the GTX 480 GPU and 32 for the GTX 680 GPU, as we have called the GPU optimized parallel prefix sum function [13].
The solutions for optimizing the radix sort algorithmic function using the Compute Unified Device Architecture prove their efficiency when the function runs on GPUs from different generations and thus the function is useful and applicable in different scenarios and situations, in a variety of data processing applications that require the parallel radix sort algorithm.
Sort the array 15, 5, 12, 10, 20, 23, 18, 13, 3, 6, 7, and 19 by using the insertion sort algorithm.
Sort the array of the third question by using the heap sort algorithm.
Once adequately funded, LaborHub's founders designed and implemented a whole new, and quite unique internal information system based on set of human-friendly search and sort algorithms that makes matching moving families to appropriately-skilled movers an extremely simplified process - infinitely easier than the founders' earlier approaches.