How are you not caught in an infinite loop? The recursive call is too early, the compiler should not be able to get past the beginning of the method due to constantly restarting itself. 😵💫
@ישיכהן-ב8ו9 күн бұрын
Pls upload more videos❤
@buraktekin579411 күн бұрын
You got balls man!
@ayanamirei20711 күн бұрын
Very helpful! Thank you. I don't see a need for the added j variable though. the algo runs the same if you just replace j with i.
@weza012 күн бұрын
so i watched over 5 videos on this algo and this video is truly one of the best
@savewater284012 күн бұрын
At 9:50, in line 15, adding an equality to the if condition ensures that the the sorting algorithm is stable too...
@marypaul962713 күн бұрын
Thanks, i had to subscribe
@shayanroohbakhsh932114 күн бұрын
wonderful explanation
@Pav71115 күн бұрын
if it doesn't run for you, you need to add return arr def insertion_s(items): for i in range(1, len(items)): m = i while items[m - 1] > items[m] and m > 0: items[m - 1], items[m] = items[m], items[m - 1] m -= 1 return items
@LoL-ox8li17 күн бұрын
The explanation is very good and simple to understand. But is there no Bellman Ford?
@MauriceHenning18 күн бұрын
Brother, you have done God's work lol... I've looked at tons of videos and studied many illustrations. You explained this in 8 minutes.
@InezInez-ih5zs19 күн бұрын
THANK YOUUU SOO MUCH OMG
@lostswordsman_zoro97919 күн бұрын
I LOVE YOU.....THANKS ALOT!!!
@hasanxissa019 күн бұрын
top 1
@melissaparker409120 күн бұрын
When you finally understand! 🤣
@wavecheeez124626 күн бұрын
all was good before the first while)) video not better then others... dis
@AhmedIbrahim-fi2so28 күн бұрын
its a horrible algo
@pekufatima3149Ай бұрын
most precise and explained video ever
@networking1014Ай бұрын
Best explanation I have come across. Thank you
@shoryamiglani4417Ай бұрын
I switched from viewing on yahoo to viewing on youtube so I could like the video
@zzgladiatorzz252Ай бұрын
I know I'm seeing this video a bit late but... I wanted to ask if this same code will be acceptable in exams like Cambridge Computer Science (9618)
@jaithakur31Ай бұрын
Very confusing
@hunterboss4907Ай бұрын
Thank you very much, I was struggling with this topic, but now it is all clear to me.
@yaraevilАй бұрын
5:34 u didn’t update the E🥲
@sia9071Ай бұрын
Yeh cuz 7+3 is 10 and e is rn 8 which is shorter
@HabibFxАй бұрын
great
@wilsonsaffoldАй бұрын
This was a very easy to understand visual representation and explanation, Thank you.
@sheids753Ай бұрын
Thank you so much for this!
@LizyAdАй бұрын
Very fantastic explanation. Thank you so much!!>
@utopia391Ай бұрын
tysm it helped me alot
@SourabhGurav-s4oАй бұрын
Thanks Felix. The explanation was slow and intuitive. Understood every bit of what you explained.
@osyswag111Ай бұрын
6:53 Why did no one notice this 😂
@mrlazypantsАй бұрын
THANK YOU!
@Anjalikumari-cl7zxАй бұрын
please made more videos on other topic also please
@mabline2267Ай бұрын
Thank you so much for your explanation. Understood it very well 😊
@yuytbeАй бұрын
excellent video 好好好好好好好好好好好好
@Abhi-fq4wcАй бұрын
Please make complete dsa playlist in python
@OsydeousMusicАй бұрын
I had to comment. This is so easy to understand that I watched the whole 8 mins, not pausing once
@bhanuvarma1239Ай бұрын
sir you didn't return anything in the code...
@shravani.aАй бұрын
Your teaching method is so calm, it helps slow down my panic-stricken heart every time I start to code. Thanks!
@someone9493Ай бұрын
Superb explanation, thank you so much!
@wajahathussain3093Ай бұрын
thankful
@AndrewKim-v3bАй бұрын
Hey Felix, this is the most concise and clearest explanation I've seen, packed in less than 10 minutes. Bravo to your work!
@adityalawande1771Ай бұрын
Thanks man!
@FinDuffy-yl6qjАй бұрын
You should probably assume if someones learning this algorithm they already know basic python syntax