Everything about Counting sort
Sorting algorithm
In computer science, counting sort is an algorithm for sorting a collection of objects according to keys that are small positive integers; that is, it is an integer sorting algorithm. It operates by counting the number of objects that possess distinct key values, and applying prefix sum on those counts to determine the positions of each key value in the output sequence. Its running time is linear in the number of items and the difference between the maximum key value and the minimum key value, so it is only suitable for direct use in situations where the variation in keys is not significantly greater than the number of items. It is often used as a subroutine in radix sort, another sorting algorithm, which can handle larger keys more efficiently. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Counting sortA 5-minute orientation
- Skim a recent paper: Efficient and Lightweight Automatic Wheat Counting Method with Observation-Centric SORT for Real-Time Unmanned Aerial Vehicle SurveillanceInfluential work since 2022
- Pick up a classic book: Favorite foodsThe most-reprinted book on the subject
- Read the landmark paper: Real Time Pear Fruit Detection and Counting Using YOLOv4 Models and Deep SORTCited 188 times
- Go sideways: Bucket sortA closely related topic
- Go sideways: Integer sortingA closely related topic
📖 Definitions
Noun A sorting algorithm that counts how many times each integer key appears in an array and then reorders the array based on those counts.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Real Time Pear Fruit Detection and Counting Using YOLOv4 Models and Deep SORT
Drone-Computer Communication Based Tomato Generative Organ Counting Model Using YOLO V5 and Deep-Sort
Multi-object tracking using Deep SORT and modified CenterNet in cotton seedling counting
Accelerating a Particle-in-Cell Simulation Using a Hybrid Counting Sort
Cascade-SORT: A robust fruit counting approach using multiple features cascade matching
Sonar Fish School Detection and Counting Method Based on Improved YOLOv8 and BoT-SORT
Automatic Apple Detection and Counting with AD-YOLO and MR-SORT
Digital Sort-Enabled Counting Allows Absolute Electrical Quantification of Target Nucleic Acid
🆕 Influential since 2022
Efficient and Lightweight Automatic Wheat Counting Method with Observation-Centric SORT for Real-Time Unmanned Aerial Vehicle Surveillance
YOLOv7-DCN-SORT: An algorithm for detecting and counting targets on Acetes fishing vessel operation
Research on Enhanced Dynamic Pig Counting Based on YOLOv8n and Deep SORT
Quick and Accurate Counting of Rapeseed Seedling with Improved YOLOv5s and Deep-Sort Method
An Improved YOLOv8 and OC-SORT Framework for Fish Counting
📚 Books worth reading
Favorite foodsDamien Logue · 2013
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Bucket sort Bucket sort, or bin sort, is a sorting algorithm that works by distributing the elements of an array into a number of buckets. Each bucket is then sorted…
- Integer sorting In computer science, integer sorting is the algorithmic problem of sorting a collection of data values by integer keys. Algorithms designed for integer…
- Radix sort In computer science, radix sort is a non-comparative sorting algorithm. It avoids comparison by creating and distributing elements into buckets according…
- Proxmap sort ProxmapSort, or Proxmap sort, is a sorting algorithm that works by partitioning an array of data items, or keys, into a number of "subarrays" (termed buckets…
- Maximum subarray problem In computer science, the maximum sum subarray problem, also known as the maximum segment sum problem, is the task of finding a contiguous subarray with…
- Sorting algorithm In computer science, a sorting algorithm is an algorithm that puts elements of a list into an order. The most frequently used orders are numerical order…
- Samplesort Samplesort is a sorting algorithm that is a divide and conquer algorithm often used in parallel processing systems. Conventional divide and conquer sorting…
- Spreadsort Spreadsort is a sorting algorithm invented by Steven J. Ross in 2002. It combines concepts from distribution-based sorts, such as radix sort and bucket…