Відео

but always stack memory comes at top. and also static/global segment divided into initialized and unintilazied data

Legendary!

Man of magic. 10yrs old. Still we re watching

100 percent better than majority of paid courses

Amazing amazing amazing 😍

thanks a lot!

10 years ago he passed away

Watching after 10 years

at 7:45, shouldnt j be from i+1 to n? otherwise we keep missing the last element of the array and dont compare it to anything

I watched from the first video in this playlist upto here in one watch..This playlist made me relise and gave a realaly good uunderstanding also cleared lotta doubts on a project i did using dynamic memory allocation.Thanks a lot

legendary

At 16:38, I think at level 1 it is n/2 (not n) because we are using only n/2 space, we didn't even entered the right recursion tree. Same goes for the next level, n/4, then n/8 and so on. So, the total space would be n/2+n/4+n/8+.....+1 (or may use infinity for simplification), and not n+n/2+n/4+....+1. But, anyway, it would be in O(n). Correct me if I'm wrong.

Anyone 2024

2024❤

why n-2 times while sqrt(n-1) times???

tbf, this is amazing tutorial. great job

Helped me in 2024🙏🌞

Best DSA

This is a godsend thank you

álgorithm, not algórithm anyway, thanks for the video, man you are great! <3

Whose voice is this Animesh or Harsha?

Life is full of circles!! Few years ago in 2020, I was watching your video to get my first job in college placement and now here i am again!!

helping people 10 years later :).

One of the greatest videos on youtube. Cheers.

Who is watching this video in 2024 ❤

I somehow found your video in my first year of college (2020) and today i have graduated (2024), still when i have to revise algorithms i watch your tutorials. I know you are no more in this world, but your contribution to community will always be remembered sir.

This is what i need as comp engineering student. Many tutorial there are just not enough to fill my curoisity. But this make me more understood about c and memory management. Thanks

A student of computer science here. This is one of the best recursion videos I've seen on yt. You give the simplest and very very clean explanations. I love your channel, it's one of the best I came across. You helped me understand so many things very clearly. Thank you <3! And please keep making videos :)))

thanks man it really helped me.

even if I am Learning it in C , it is more clearer than others anything resources ,

thank you

thank you, you will be missed

It's always good to come back to basics once in a while. Really loved the explanations.

Minor correction: main as is, must return a value of type int

I dont how the lecture was passed away but may your soul rest in peace sir 🙏

Awesome video

Thank you for clearly explaining O(1) and O(n) with example. Easy to understand. Your videos ❤❤❤❤ Love learning. God bless you!

Iam now getting 🙏😮‍💨

holy shit what a golden video! THANKS

This is it for this lesson .Thanks for watching❤❤❤❤.love you❤❤

This is the most effective explanation I've found on UA-cam

I hava nerver met a class like this one. It is really easy to understnd and kind for beginner.

You are better than a professor Thanks for your great teaching❤❤

thank you

The best educational channel.

Amazing clarity and detail in the explanation.

All-time top, I am re-visiting after 6 years still no one can simplify to this level. hats off to the trainer

11 years old video still worth it

Who is still seeing these videos in 2024

def insertion(arr): left=0 right=1 element=arr[right] while right>len(arr): while left>=0 and arr[left]>arr[right]: arr[left+1]=arr[left] left-=1 arr[left+1]=arr[right] right+=1 left=right-1 return arr