Sir thanku so much .your way of teaching awesome sir... Sir u r the key for all engineering students... I wish your channel will grow more and more.... Sir thanku once again.
Really sir , you explain all the topics very interesting and also very easily. Even though I don't know "Hindi" I can able to understand each and every word you say , that's crystal clear 😍 Till now , I haven't know how to calculate the Time complexity. But now, I understood only because of you sir I hope this playlist on algorithms should be continued sir :-)
Really liked the way you explained with the cards. Made it really easy to understand! Great Help! Thanks! You're better than most teachers! Keep it up! You've earned yourself a subscriber!
I can see that this code snippet is borrowed from the book called "BIBLE OF ALGORITHMS" ;Introduction TO algo by Thomas. You're literally perfect if you've read that.
you are the best teacher in the world sir agar ap hmara college ma hota fr to top krna tha pka or attendence b puri hoti sir ap punjab university ma apply kro pls
It always helps to write the output in the comments of your first traveral, then the program would run in the first go... public class InsertionSort { public static void main(String[] args) { int[] a = {77, 23, 54, 223, 101, 65, 283, 99, 300, 1}; for (int j = 1; j < a.length; j++) { int newElement = a[j]; //23 int i = j - 1; // 0 while (i >= 0 && newElement < a[i]) { a[i + 1] = a[i]; // {77, 77, ...} i = i - 1; // i = -1 } a[i+1] = newElement; // {23, 77, ...} } // printing the sorted array for (int i = 0; i < a.length; i++) { System.out.println(a[i]); } } }
Hi ..... Kindly ap apni videos me pory lecture ka aik preview dia krain last me ! Yeh initiative kaffi help full hoga students k lyeee q k ub obviously jo class me samjh nahi atta usy samjhny k lye log RUclips videos dekhty hain is lye ap kindly preview day dia krain k pori video me kb kia hua tha ! Thanks
Jab first comparison karenge toh j=key=20 or j=1( index of array) toh jab I=j-1 hoga toh I=0 hoga toh fir while vala loop jaise chalega I>0 kaise hua bhaiya yahan gadbad hai while loop main ye hona tha first condition main I>=0. Agar kuch galat bataya toh aap batao ki main kahan galat hun
Sir ek doubt h mera... Pls reply fast as much as possible.. J start hua 2 se fr a[j] ki value ko key m store krwa diya... a[ 2] array k hisab se to 60 hoga na..😢
Leagend watching it one day before exam 😅😅😅😅😅
I have exam in 4 hours
One day 😂I have my exam in two hours and I watching it right now
No bro idhr pokara na lag jai 1 month phela he start KR RHA ho
Yesss tomorrow is my CS exam😂
Super legend watching 1 hr before exam 😂😂
Sir app ko 2 sal se follow kar raha hon, is video ma pehle dafa dekha aap muskara rahe hain. khosh raho Sir❤
Best Teacher ever I have seen on RUclips 👌Appreciation from Pakistan 🇵🇰
Bhai tum log q padh rahe ho
😂🤣🤣
@@toxic5630 haa yaar batao 🤣 last me to bam he phodna h
@@toxic5630 yar ap logon k algorithms k concept may be clear hon but humanity k bara bilkul zero ho
@@mani_513sahi kaha tune Bhai...👍
This is Indian talent dude 😎🆒
Your pedagogy is unique and focused on gate aspirants..
Thank u sir!
kya hua bro gate thoda ya nahi
please reply .
Already memorised the algo for exam but now that you shown the real life example, it's crystal clear. Thank you sir
Great sir, Computer science has been easy to understand by you only thanks sir
Great lecture sir...All the concepts related to this sorting technique (working,example,complexity) in one video and well explained..Thank you sir
Sir thanku so much .your way of teaching awesome sir... Sir u r the key for all engineering students... I wish your channel will grow more and more.... Sir thanku once again.
Thank you from the bottom of my ♥
Sir, your teaching style is so attractive, thank-you. Huge respect from PAKISTAN
UAF
The way u teaching is osm and example is also great dude❤️
Really sir , you explain all the topics very interesting and also very easily.
Even though I don't know "Hindi" I can able to understand each and every word you say , that's crystal clear 😍
Till now , I haven't know how to calculate the Time complexity. But now, I understood only because of you sir
I hope this playlist on algorithms should be continued sir :-)
u are incredible ...one of best tutor on RUclips
Ultra legends watching in washroom on the day of exam
Good
Sir please vedios uplaod kijye aap RUclips pr design and analysis of algorthms pr.
Really liked the way you explained with the cards. Made it really easy to understand! Great Help! Thanks! You're better than most teachers! Keep it up! You've earned yourself a subscriber!
Happy to see you making progress. Nice setup.
I can see that this code snippet is borrowed from the book called "BIBLE OF ALGORITHMS" ;Introduction TO algo by Thomas. You're literally perfect if you've read that.
sir u are god for me , the way you explain each topic is way way better than others out there. love u a lot sir , keep making these videos . thank you
And Most Important Your Teaching style is Amazing
I watch Your videos and I Understand each and Everything about Topics
Wow anna after long time I am seeing you and I'm keep on waiting for your classes.🙂
you are the best teacher in the world sir agar ap hmara college ma hota fr to top krna tha pka or attendence b puri hoti sir ap punjab university ma apply kro pls
one of the best teacher for data structure .....
Arrey Sir Sir Sir, Jo Line boli na apne, "Engineering Student to reh hi nahi skte iske bina" - Ek Number 😄😄 , To Be Honest, your Classes are Fun
working from home sir, million million thankyous for this great explanation.
amazing and easy to understand
Such a good explanation💪🏻
Teaching methodology to apki bahut achi h no doubt... But background 👌🏻👌🏻👌🏻👌🏻
All subjects of CSE becomes very easy only because of you Sir . Superb explanation 👍👍
It always helps to write the output in the comments of your first traveral, then the program would run in the first go...
public class InsertionSort {
public static void main(String[] args) {
int[] a = {77, 23, 54, 223, 101, 65, 283, 99, 300, 1};
for (int j = 1; j < a.length; j++) {
int newElement = a[j]; //23
int i = j - 1; // 0
while (i >= 0 && newElement < a[i]) {
a[i + 1] = a[i]; // {77, 77, ...}
i = i - 1; // i = -1
}
a[i+1] = newElement; // {23, 77, ...}
}
// printing the sorted array
for (int i = 0; i < a.length; i++) {
System.out.println(a[i]);
}
}
}
Sirrrrr I really love your videos but bhttttt speeed me smjhaya ghooom gya sara kuch
Real life jitu vaiya ..Thankyou so much
The way of your teaching is of billions words.
studying for up lecturer ,thanks for amazing lecture sir
Amazing explanation.... And amazing teaching... Thanku..... I easily understood.....
i am so clear with insertion sort, thank you for this valuable video
Your Explanation way is better than others.
Awesome 😎 I found my all study subjects in this channel 🥰😘
much love and respect from pakistan apka way teaching boht acha hai easy hai bundle of thanks
One of my most favorite teacher
att kraa dinda h eh bndaa kya padhatee ho yrrr too goood
Thank u so much sir 😊
fantastic bhaiji :-)
Nice video.
Please use indexing for explanation.
Simply the most beneficial channel for me....
VERY SHORT AND INFORMATIVE LECTURES . I AM FEELING COMPUTER SCIENCE EASY BECAUSE OF YOUR LECTURES THANKS SIR
Ur example is just awesome. You are my god sir❤️❤️❤️❤️❤️❤️❤️
Keep going ... You will reach at the highest point
Thank you Sir, it was very helpful
Amazing sir this is my first video of your's 🥰🥰
Pp
Ppl
P0pl
L
L
Very short and efficient lectures . Thanks a lot sir
Sir You are a great teacher
Thank you very much sir, your videos are easy to understand and of great help.
This video is very helpful for me because inthis video all points are covered about insertion sort.
Thanks for this video😊
Amazing!
JAZAK ALLAH SIR
You're great sir!!...very well explained...thank youu so much:)
Legend was those who reading on exam day
Are*
As usual awesome class with you sir 😊
Really mja aa gya sir 👍👍
mentor of all mentors
Background ☘️💚
Great sir!
Hi .....
Kindly ap apni videos me pory lecture ka aik preview dia krain last me ! Yeh initiative kaffi help full hoga students k lyeee q k ub obviously jo class me samjh nahi atta usy samjhny k lye log RUclips videos dekhty hain is lye ap kindly preview day dia krain k pori video me kb kia hua tha ! Thanks
Thank you for the video
Sir code vale videos aur banaya karo.... achhe se samaj aata hai
thank you so much sir you helped us alot. Please never stop making videos. Your huge fan from Pakistan
Sir I am from a biology background but after watching this video i think I can learn c easily thank you ❤
easiest explanation ever😍😍😍😍😍😍😍😍😍
was never able to understand the complexity but you made is so easy sir...thankyou so much!
Great & Very Helpful Video,Thankyou sir.
Waooo nice sir thankyou
PERFECT, Thanks a lot sir
thank you so much sir
Your way of teaching is excellent and awesome ☺☺
🙏🏻🙏🏻
You are great sir your teaching style superub👌👌
Very nice sir
Great explanation 👌👌👈
Jab first comparison karenge toh j=key=20 or j=1( index of array) toh jab I=j-1 hoga toh I=0 hoga toh fir while vala loop jaise chalega I>0 kaise hua bhaiya yahan gadbad hai while loop main ye hona tha first condition main I>=0.
Agar kuch galat bataya toh aap batao ki main kahan galat hun
sir you are very helpful ,,i from pakistan
bohot badiya
Thanks sir
Great one!
Thanks so much sir
Thank you sir
WAy of teaching is too good 😍
thank you sir ,to help us for our future
Thanks alot,,,,,you made my concepts !!!
sir apko follow krty hovy 1sal hogy love frm pakistan
Very usefull vidoo sir
Tooo much great teaching too good
thank you so much sir .. love you hgya from pakistan
Amazing way for your teaching😍
sir I am very thankful to you for giving very informative video
Thank you so much 😊
🎉
Sir really u r a good teacher.
Sir ek doubt h mera... Pls reply fast as much as possible..
J start hua 2 se fr a[j] ki value ko key m store krwa diya... a[ 2] array k hisab se to 60 hoga na..😢
TNX❤️
Thanks....you explained it very well👍🏻
Outstanding Sir
Sir I really understand what you teach and I appreciate your efforts. I've a request can you please explain Loop invariant?
Amazing 👍👍