Bucket Sort

[@DebasisUntouchable]

The example is very simplistic, and partly explains the algorithm.

[@idiot7leon]

Thanks. Really cute handwriting~

[@acmahoathan]

Your handwriting is so beautiful

[@bradleyaboua4128]

I was just thinking that! She ought to do calligraphy!

[@ZhouHaibo]

Fancy explain. It is O(n + k) actually form my understanding, because the while loop is triggered only when B[i] has values, thus k is roughly equal to input sequence's length. But if the max value of input array is very big, then phase 2 will has a long run as N = max + 1.

[@noorhassanwazir8133]

Nice teaching madam ..and lovely handwriting...

[@moayyadarz2965]

Hello Lalitha Hopefully you are well I am wondering why do not you complete this series of video it is really amazing

[@vishalramoju5432]

there is a while loop inside a for loop, why is the time complexity still O(N) ??

[@DebasisUntouchable]

this is a very simplistic representation of bucket sort, on your question regarding while loop, its not about having a loop inside another loop, its about what you do inside that loop. think for an example the "for" loop instead of looping the bucket, it ranged the total numbers you have, (there won't be a need for another loop inside), so it would have been O(N) right?

[@dhirenchugh2507]

What if the range is from 1 to 1000

[@margueritedepompadour7031]

Then you make 1000 buckets

[@VineetAggarwal2699]

Very helpful video, thanks.

[@masoodkhodabaks7509]

At 3:44, you write [3,a], it should be [3,b]

[@masoodkhodabaks7509]

nvm

[@vishukohli1109]

awesom explanation...thnq soo much

[@rosameliacarioni1022]

Thanks a lot :)

[@AbhinavKumar-qn1dt]

Nice.👍

[@kiranmallikarjun8618]

superb

[@goyalritik]

Nice Voice