sorting algorithm


Also found in: Dictionary, Encyclopedia, Wikipedia.
Related to sorting algorithm: Bubble sort
Graphic Thesaurus  🔍
Display ON
Animation ON
Legend
Synonym
Antonym
Related
  • noun

Words related to sorting algorithm

an algorithm for sorting a list

References in periodicals archive ?
In contrast, for insertion sorting algorithms (also the subject of a vivid literature), only one study exhibits links with pattern avoiding permutations.
Keywords: sorting algorithm, complexity, QuickSort, BubbleSort, InsertSort
We remark that Neumann and Sulzgruber (2013) define analogous sorting algorithms, by replacing [?
The teacher sets up the algorithms to configure the server, then selects a sorting algorithm and sets the number of the students.
Then the proposed lone diagonal sorting algorithm is applied to the images which are separated from frames.
This paper concentrates on further improvements of digital circuits, which implement recursive sorting algorithms.
One particular interest was to research how well the optimization techniques, applied to data sorting algorithms written in CUDA, scale to the latest generation of general-purpose graphic processors units (GPGPU), like the Fermi architecture implemented in the GTX580 and the previous architecture implemented in GTX285.
Using Fourier features, certain objects commonly found in recycle sorting could be easily detected, reducing development time and increasing the accuracy of the sorting algorithm.
It was observed that the sorting algorithm gave the closest approximation to the required distribution.
an advertiser providing program code based on the sorting algorithm might also provide program code in general; and Disjoint is the lowest level, since it shows that no item could satisfy the request: it is considered to be a failed match.
The process of parallelizing a sequential sorting algorithm entails the distribution of the elements in the available processors, which implies dealing with topics such as where input and output sequences are stored, or how comparisons are made.
This project could also allow for quick information sharing in a sorting algorithm.
When we consider comparisons, this is, of course, the lower bound of average number of comparisons for every sorting algorithm.
In this section we validate the efficiency of the model-derived sorting algorithm on the MasPar, the GCel, and the Paragon.