Counting Sort Sorting Algorithm (Working with Diagram) | Part - 1 | Sorting Algorithms - DSA

[@iaml.4290]

Another perfect explanation, glad you take the time to properly explain things, especially for people that dont find some algorithms very obvious.

[@madhuryadav2424]

among all the sorting algorithms i enjoyed this one the most

[@MKSundaram]

You are doing a great service to the society. God bless you :-)

[@SimpleSnippets]

Thanks bro, please do share the videos & our channel with your friends too. Thats the biggest help and support you can give back to this channel! 😇

[@SurajSinghMIS]

Thanks a lot sir...I am waiting for this only..Keep uploading sir...Try to cover all the data structure and algorithms concept soon..I Really loves the way you teach...keep sharing the knowledge.!!!

[@SimpleSnippets]

Yes Suraj, many more tutorials on DS are coming soon. Thank you for the positive feedback and the motivational response buddy. This really keeps me motivated to make more tutorials. Please do share the videos with yours friends too 😇

[@lunghunglin5729]

Once again, thank you for your teaching! It helps me a lot. Keep on the hard work!

[@sitaraliang3293]

This literally save me, thanks a lot. I really appreciate you sir, you are the best forever!!!!!!

[@greatab2977]

Very good explanation

[@SimpleSnippets]

Thanks and welcome

[@OllytheOzzy]

Thanks for the video

[@muzammalhussain4887]

i think there is no need of second count array. just make a loop through first count array and place elements from starting. if there is 0 in the count array it means no element of that index exist so these is no inner loop for that index. i think it is more simple than that

[@SurajSinghMIS]

#include using namespace std; int main() { int a=10; cout

[@masumali8356]

You are the best.... masum

[@Raj10185]

Thank you so much :) The video is superB;)

[@dhee01]

Thanks bro

[@SimpleSnippets]

No problem. It would mean a lot if you could please share our channel and videos with your friends too ✌

[@30secondsEmotions]

can we also use post increment in place of pre increment.... at step 5.1

[@tabishmadni6284]

Sir request you to please make a video on "quicksort on singly linked list" as using the same analogy in this video I am facing a problem. Thanks

[@sese0006]

can you give an order(series) to your datastructure and algorithm in c++ tutorial?

[@MKSundaram]

What difference it would make if we use post-increment instead of pre-increment?

[@turjobennington1677]

why is there so many sorting algorithms, when to use which one

[@md.yasinarafathpiyal2217]

what do u use to write on the screen ? can you please tell us

[@jhanvisingh2530]

Sir if we want to implement it using file handling, then how it would be ? please help .!!

[@deekshithapendela1760]

Nice explanation...but why we have to add elements in count array?

[@gayatrigupta9560]

I have a question, What if there are two same elements in the array, how will the code work then?

[@OSudarshnaThakur]

What if their is value 200 at index 0 instead of value 1

[@puneetsharma8662]

Bro explanation is awesome😀..but what if inputs also have negative values??

[@ChoudharyRamesh]

I Have an doubt why we are not implementing counting sort like this ,please show me path.thanks in advance . #include #include using namespace std; void Counting_Sort(vector & ref ,int range) { int i,j; // make temp vector for store number of occurrence and initially set all occurrence to zero vector temp(range+1,0); // increase occurrence of each number respective to index for(j=0;j

[@piyushtakale4648]

I agree

[@piyushtakale4648]

this range variable totally depends on the max element in input array... why is output array required we can directly make changes in original array... other than that. and i dont understand what is that addition of count[i] += count[i-1] requires you can just run a for loop after counter in that for loop traverse the whole range array and just put the 'i'th element in original/output array count[i] times and then done......no addition required don't make it that much complicated thanks

[@rosequartz2290]

17:00

[@6112arjun]

29:02 WTF. Still processing it

[@6112arjun]

Jokes apart , a quality lesson always, thank you tanmay sir

[@gamsterilyass2952]

💝

[@tsepomkwebu5577]

Bro you are "HIM"

[@arishkhan6786]

tanmy are you from south india ?

[@SimpleSnippets]

No Arish, I am from Mumbai. What about you ?

[@arishkhan6786]

@@SimpleSnippets tanmy i am from lahore

[@abusafiaayman6941]

please add english subtitle

[@zavio3199]

amen to this brother