Counting Sort

preview_player
Показать описание
This video explains the counting sort algorithm used to get an array's elements sorted. This algorithm works best for a large number of inputs having a small range of data. We can sort an array in increasing, decreasing, non-decreasing and non-increasing orders. This video is from an interview dose live session. The counting sort algorithm depends on the input's nature and has the best-case and worst-case time complexity of O(N) and O(N+Range).
If the range of data, that is difference between minimum and maximum, is low then the time complexity is linear O(N) with the same space complexity.

======================================PLEASE DONATE=============================
==============================================================================

=======================================================================
USEFUL LINKS:
Рекомендации по теме
Комментарии
Автор

what if we have numbers more than 1 digits

shashankgujarathi
Автор

Sir as asked before please make a list of programs for complete beginner so that we will be good to join your course.

Lucifer-xtun
Автор

U didn't get what is range.. if any body can expect the difference between range r and n

RahulKumar-zrgu