This array is also called a frequency array or count array.Ģ. For example, if your array contains 0 to 10 then create 11 buckets for storing the frequency of each number.

Since the values range from 0 to k, create k+1 buckets. You can follow the below steps to implement the counting sort algorithm in Java:ġ.

How to implement Counting Sorting in Java You can further check a comprehensive course like Data Structures and Algorithms: Deep Dive Using Java to learn more about it. There is a key difference between Bucket Sort and Counting sort, for example, Bucket sort uses a hash function to distribute values counting sort, on the other hand, creates a counter for each value hence it is called Counting Sort algorithm. This way, you get a sorted array.ītw, there is a large number of counting sort algorithm implementation codes on the Internet, including on university websites, that erroneously claim to be bucket sort. Now, you can print zero 5 times before printing 1 depending upon its count. Once every value is inserted into the bucket, you just go through the count array and print them up depending upon their frequency.įor example, if the input array contains 0 (zero) five times then at the zeroth index of the count array you would have 5. Then each time a value is encountered in the input collection, the appropriate counter is incremented.īecause the Counting sort algorithm creates a bucket for each value, an imposing restriction is that the maximum value in the input array is known beforehand. How does the counting sort algorithm works? Well, counting sort creates a bucket for each value and keeps a counter in each bucket. If you face this question in the future, you can mention Radix sort, Bucket sort, or Counting sort algorithms. It's quite common in Java interviews nowadays to ask, whether do you know any O(n) sorting algorithm or not. It is also one of the few linear sorting algorithms or O(n) sorting algorithms.

Hence counting sort is among the fastest sorting algorithms around, in theory. the values of the input array are assumed to be integers), non-comparison, and linear sorting algorithm. The Counting sort algorithm, like Radix sort and Bucket sort, is an integer-based algorithm (i.e.

Contoh algoritma pemrograman if