TemperTemper

Counting Sort

Sort an array of non-negative integers using counting sort for linear time performance.

Code

Algorithms
count = Array.new(arr.max + 1, 0)
arr.each { |x| count[x] += 1 }
result = []
count.each_with_index { |c, i| c.times { result << i } }
result

Parameters

Array of integers

Server

More Ruby Snippets

Bubble Sort

Sort an array using the bubble sort algorithm by repeatedly swapping adjacent elements.

Heap Sort

Sort an array using the heap sort algorithm with O(n log n) time complexity.

Insertion Sort

Sort an array using the insertion sort algorithm by building a sorted portion one element at a time.

Merge Sort

Sort an array using the merge sort algorithm with O(n log n) time complexity.

Quicksort

Sort an array using the quicksort algorithm with average O(n log n) time complexity.

Selection Sort

Sort an array using the selection sort algorithm by repeatedly finding the minimum element.