Insertion Sort visualized with examples and code | Study Algorithms

[@Sk8erBhai]

Dude. Excellent example.

[@CanvasAndCompass]

bro u doing very well .... pls don't stop..... i am recommended ur videos to all my jr. and fellow batchmates

[@nikoo28]

Thank you for your support. I try to publish a new video every Friday. Stay Tuned!! :D

[@zeus4963]

You are simply the best to learn from bro!. Thnaks a lot

[@nikoo28]

So nice of you

[@abhijeetkumar1042]

Very nice tutorial with everlasting example.

[@shwetasdhake7986]

You are a True Legend Nikhil 💯

[@sarveshahuja2385]

Bro these videos are amazing!!!! Thank you so much for providing such wonderfully explained concepts , starting with the significance and the visual intuition behind it b4 proceeding to the actual code :)

[@katikalyani9107]

Great explanation 🙏🏽

[@rachitahajela]

Great video. Liked the way you did dry run with the code. 👍🏼

[@yar_shikhar_29]

I understand 👍 Thank you 👍

[@sujitha2339]

Hi..Thanks for the video. Could you please add an explanation for linked list insertion sort with code?

[@TicTokDance]

Bit confused, actually you compare from the beginning and insert the card and shift all the element towards the right. Please confirm

[@sarvpriya5534]

I have a query when key=3 then a[j+1]=a[j]..how is it resulting this array - > 2,5,3,9,7,4,11,13 ..should not it be 2,5,9,9,7,4,11,13 ? video - 8.31

[@arkodasgupta0412]

yup it should be like you said

[@hey-simba]

From Nepal.

[@krishnavishwakarma8637]

I love you videos and explanation but just want to correct here: your algorithm does not swap elements instead it is shifting larger elements towards right and making room for smaller element(key) to fit at correct place. Just wanted to clarify for new students.

[@bhavyadoshi3816]

KINDLY PROVIDE WITH SUBTITLES ....