Count sort

About the algorithm:

Counts number of occurences of each number, saves it, prints the occurences by going thorugh the count array

Categories:  Sort   Efficient   Inefficient  

---

Best case: Ω(n + k) where k is the range of values

---

Worst case: O(n + k) where k is the range of values

---

Try the algorithm:

• Load csv file
• Input your own array (syntax: comma sepparated values, e.g. 1, 2, 3, 4, 5)
• Generate random array (syntax: start, end, number of entries, e.g. -5, 5, 7)

Submit