Sorting in O(n)
I always thought minimum time sorting takes is o(nlogn). but I come to across 1 algo. that is know as count sort. which solve problem in O(n). This algo is used when few conditions meet.
condition is “range of number in list is small. so that it can ...
starter-learning-with-action.hashnode.dev2 min read