Sir i have a question... Insertion sort ki array main os kay ilawa agr kesi order maim elements hain or un li lenght kam yn zyada hay to kia un ki time complexity bi.. O(n2) hi ho gi??
kindly answer me simple insertion man apny puting value of j in j+1 is putting value of j in the replace ment of i tha is man pechly walay sy kyu compare kr rhy 😷😴 ya tou j ki value ap start man 0 py rkho phr j in j+1 kro j+1 tou add hoga na phr 2 man may be apsy ghalti hui ya mujy samjh nh aya kindly mujy bta dein first comparison 9 or 8 ka j ki postion 0 py hi honi chahyey na apsy mistakenly 1 hua ya 1 hi ha tou thora explain krdein j into j+1 pechy waly index man kesy add hoga
Sir, no one explained in such a simple manner. Really appreciating . Thanks
bap re bap kya lecture hai o sirji bhaiyaji plss asehi josh se padahiye really really maza agaya yaar
Mey khatha itna din, now i am addicted to yur tutorial video...kick cat video, dodo, prime video..
Thanks its easiest explanation i found on internet for this topic
Yes it is true easiest explanation ever 😍
Great sir in frist video clear all my confusion... Love from Pakistan ❤️❤️❤️❤️
Thankyou so much sir apke is video se mai bahut achhe se samjh gya insertion sort ko thank you
Love u Sir G... Best teacher ever
U look alike Technical Sagar... Way of speaking and all
Sir apki voice actor ranveer singh jesi h same😂😂thanks for ur videos🙏
he made it so easy
Sir paper November mai hai.....tayaari kaise hogi??
Q ki aap ki videos samajh mai aa rhi hai. 🙂
Sr aap reply kyu nhi krte ho.....jb koi teacher hmare doubt ka reply krte hai to achaaa lgta hai... Or smj bhi aata h
Best ever explanation 🙏
by the way thank you so much sir for your vedeos uh teach really very well
thank bro really appreciable....
Thank u so much sir ab aii smj
You must receive more likes
ekdaam barabar *_*
Unexpectedly high energy
Sr ye to smj aa gya ki program kaise kaam kr rha h...... Lakin khud se program bnana kaise soche....
Sir i have a question... Insertion sort ki array main os kay ilawa agr kesi order maim elements hain or un li lenght kam yn zyada hay to kia un ki time complexity bi.. O(n2) hi ho gi??
Great Explanation
kindly answer me simple insertion man apny puting value of j in j+1 is putting value of j in the replace ment of i tha is man pechly walay sy kyu compare kr rhy 😷😴 ya tou j ki value ap start man 0 py rkho phr j in j+1 kro j+1 tou add hoga na phr 2 man may be apsy ghalti hui ya mujy samjh nh aya kindly mujy bta dein first comparison 9 or 8 ka j ki postion 0 py hi honi chahyey na apsy mistakenly 1 hua ya 1 hi ha tou thora explain krdein j into j+1 pechy waly index man kesy add hoga
you're good
Sir aapke videos nice hai,but pata nhi views Kyu nhi hai😶
well explaineddd
Sir best code ka code kesa hoga
Thankuu
nice bro
👌
Rohit sharma in parallel universe
Thanks sir
sir us vedeo me shayad uh were taking i instead of j??
Yes. He was saying i instead of j.
:)yaah! This one
Respect
Average case?
Selection sort complexity analysis Ka nai Diya sir Aapne....🥺🥺🥺🥺🥺🥺
Still I am playing in 1.5x mode
Me 2x
3 x mode bhi hai mere liye
Selection sort Ka v dikha dete
Sir you want to fight eminem ? please slow..
Bhai yeh toh jaruri nhi hai na ki jitna comparisons karenge utna hi movements bhi karenge.
Yeh kya padha diya aapne???
Worst case mie utny hi movement hoon gy jitny comparison hoon gy
Worst case hai vai
❤️❤️❤️