Time complexity of Insertion Sort | In depth Analysis - Best case, Worst case and Average case

[@cstalksbylee4434]

Hi all,
If you have any doubt or query, feel free to write a comment ✍️ to clarify it.

[@nouralakhras1432]

how did you know the time complexity of the average case?

[@kcz-q4]

Really good video. Thank you! I could shorten 45 minutes of lecture.

[@mahmoudtaheri7229]

GREAT! IT WAS REALLY HELPFULL FOR ME. THAKS ALOTTTTTTTTTTTTTTTTTTTTTTTTTTTTTT

[@tamizhagaengineering5595]

Very very amazing 👏explanation...

[@rupeshogale4384]

very nice explanation and make a difficult concept simple to Understand thanks I subscribed to you and I hope you will upload nice content thanks

[@BisratBekele-k1q]

I didn't get the part where u used n/2 for the worst case could you explain it please

[@gabrielmegiatoreloferreira5860]

Nice video, thanks.

[@rutikbodkeacademy1247]

Good explanation 👍👍👍

[@Math_kru_earng]

in worst case ; why we don't count no. of insertions?

[@seshapugeetha7475]

Upload time complexity analysis for all sorting techniques

[@Mahmoud-li2xn]

Really useful, thanks

[@tutkudoruk]

why do not you count swaps?

[@AnilYadav-zv1co]

ua-cam.com/video/peLS-S23TvE/v-deo.html

[@laharik6719]

Tq very easy explanation

[@AnilYadav-zv1co]

Complexity depends on only comparisions...why not movements??

[@dhrubarajroy_0865]

thank you maam love it

[@farzanaislamtarin42]

In the worst case: how does this N(N-1)/2 come from? I mean how do 1+ 2+ 3+ 4 become N in the next line? and why do we need to divide by it 2?

[@cstalksbylee4434]

@Farzana Islam Tarin. N(N+1)/2 is Formula for sum of first n natural number. But here 1+2+3+4 is sum of first N-1 elements. So substitute N-1 in that formula to get N(N-1)/2.

[@AIwithZahid]

Please upload more videos on loops and recursion time complexity, you are rock.

[@Owen7768]

really help thank you !

[@alextran6886]

Thanks

[@diribihailu9266]

nice

[@08_sycm-ii_yash_bhoi92]

Watching this because tomorrow I have my presentation 🤧🙃

[@sajithjayarathna45]

👍😍