In 8:36 • min_loc do returns min index ( but its the same value k and it is swapped with itself. So, we dont see any difference) • temp should also be declared In 18:42 • 12 7 5 17 9 7 12 5 17 9 5 7 12 17 9 5 7 12 17 9 5 7 9 12 17
Your are wrong Because we have to iterate one time lesser than the last index . The reason is that the last element will automatically comes in right position.
you should put your lectures in a playlist. They are scattered all over the place. In a playlist easy for students to follow and also you will have more views, It is easy for youtube search algorithm to find it.
Are...kehna kya chate ho sirji...U are confusing all the more....I think u must be prepared well next time....I thought IIT'ans are very clear on their basics!!!!I'm an Engineer by accident but teacher by passion...Least we can do is not confuse!!!
He explained very well , he told everything which is needed for sorting and different methods. I think you dont know English to par his level or just trying to complete whole lacture .
In 8:36
• min_loc do returns min index ( but its the same value k and it is swapped with itself. So, we dont see any difference)
• temp should also be declared
In 18:42
• 12 7 5 17 9
7 12 5 17 9
5 7 12 17 9
5 7 12 17 9
5 7 9 12 17
Sir insertion sorting samaj hi nahi aaya
list[j] > item.
8:12 should'nt k
true
yeah .... true for me ...
Your are wrong
Because we have to iterate one time lesser than the last index .
The reason is that the last element will automatically comes in right position.
#include
int sub_problem(int a[],int k,int size)
{
int j,pos=k;
for(j=k+1;j
you should put your lectures in a playlist. They are scattered all over the place. In a playlist easy for students to follow and also you will have more views, It is easy for youtube search algorithm to find it.
it's in a playlist dude
@@cenacr007 dude his comment is 1 year old and yours 5 months LOL
How r you
👌👌👌👌👌👌
Boooooooooom
for(i = 1; i 0 && a[j - 1] > a[j]; j--)
{
temp = a[j];
a[j] = a[j - 1];
a[j - 1] = temp;
}
}
at 18:30 min.
Sir why program will choose -17 first why not -5 ????
which one is the minimum -17 or -5?
Thaks
Are...kehna kya chate ho sirji...U are confusing all the more....I think u must be prepared well next time....I thought IIT'ans are very clear on their basics!!!!I'm an Engineer by accident but teacher by passion...Least we can do is not confuse!!!
IIT Needs to put sorting algorithm here so that PPS can be dealt in much simpler ways...Less number of sorry's 🤔
maybe i'm dumb but this is one of the worst lecture i've ever seen on sorting
Buddy refer good lecture on youtube then...
The thing is he is a IIT Professor, so I think we don't have that much level to get match their level😂
He explained very well , he told everything which is needed for sorting and different methods.
I think you dont know English to par his level or just trying to complete whole lacture .
Excellence sirg