Sort an Array in O(n) |Counting Sort in java| LeetCode 912 | Fastest Sorting | Must do DSA MAANG

Counting Sort is a non-comparison-based sorting algorithm that works well when there is limited range of input values. It is particularly efficient when the range of input values is small compared to the number of elements to be sorted. The basic idea behind Counting Sort is to count the frequency of each distinct element in the input array and use that information to place the elements in their correct sorted positions.

Time Complexity: O(N+M), where N and M are the size of inputArray[] and countArray[] respectively.
Worst-case: O(N+M).
Average-case: O(N+M).
Best-case: O(N+M).
Auxiliary Space: O(N+M), where N and M are the space taken by outputArray[] and countArray[] respectively.

Advantage of Counting Sort:

Counting sort generally performs faster than all comparison-based sorting algorithms, such as merge sort and quicksort, if the range of input is of the order of the number of input.
Counting sort is easy to code
Counting sort is a stable algorithm.

Disadvantage of Counting Sort:
Counting sort doesn’t work on decimal values.
Counting sort is inefficient if the range of values to be sorted is very large.
Counting sort is not an In-place sorting algorithm, It uses extra space for sorting the array elements.

DSA Algorithms :-
Design HLD:-

#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview #interviewtips
#interviewpreparation #interview_ds_algo #hinglish

[shashikantverma]

Bro's explanation 🔥🔥 you nailed it man

[VinayListenMe]

Awesome way, i am very clear with Counting sort now, thanks !!