Skip to search formSkip to main contentSkip to account menu

Counting sort

Known as: Ultrasort, Set sort, Tally sort 
In computer science, counting sort is an algorithm for sorting a collection of objects according to keys that are small integers; that is, it is an… 
Wikipedia (opens in a new tab)

Related topics

Related topics

21 relations
AlgorithmAnatreeArray data structureBead sort

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
MSIGT: Most Significant Index Generation Technique for cloud environment
Cloud Computing is a computing paradigm for delivering computational power, storage and applications as services via Internet on… 
2015
2015
High throughput imaging of blood smears using white light diffraction phase microscopy
While automated blood cell counters have made great progress in detecting abnormalities in blood, the lack of specificity for a… 
2014
2014
Implementing and Analyzing an Efficient Version of Counting Sort (E-Counting Sort)
sort is a simple, stable and efficient sorting algorithm with linear running time, which is a fundamental building block for many… 
Review
2012
Review
2012
An Examination of Teachers' Ratings of Lesson Plans Using Digital Primary Sources
This mixed method study examined teachers’ ratings of 37 field-tested social studies lesson plans that incorporated digital… 
2010
2010
Faster Radix Sort via Virtual Memory and Write-Combining
Sorting algorithms are the deciding factor for the performance of common operations such as removal of duplicates or database… 
2007
2007
Fast Kernel Methods for SVM Sequence Classifiers
In this work we study string kernel methods for sequence analysis and focus on the problem of species-level identification based… 
2004
2004
Transmission of digital information with using of ultrasort radiopulses
1995
1995
CHAPTER 1 – Let's Get Small (and Fast): Introduction to Optimization
1985
1985
Safe states in banker like resource allocation problems
The paper deals with representations of the safe states set in the Banker's problem. Using a Petri Net model we derive formulas… 
1960
1960
Algorithm 23: MATH SORT
; if x = 0 then go to exitl ; i) if n < abs(x) then (:asel: begin rl :=-sin(x) ; r2 := 1'4 := C[0] := eos(x) ; r5 := S[0] := sin… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)