8.3.3 Insertion Sort | Sorting Algorithms | C++ Placement Course |

Notes: Same as Lecture 8.3.1

[@prashantsingh6803]

Urvi goel! Best C++ teacher!😊🤩😊

[@luxocity9268]

True❤️

[@proteanguy3411]

No doubt ❤️

[@baxi9227]

there are other teachers too behing the hood. don't give all credits to one

[@proteanguy3411]

@@baxi9227 urvi and one boy I don't know who they both are teaching C/C++ so we are talking about them urvi is better than the boy interm of explanation

[@baxi9227]

@@proteanguy3411 can u explain me why? Let me guess. I think the reason is she is a girl. Is it?

[@sahilanand30]

Animation is always easy to understand You guys are doing great 🙇‍♂👏

[@rajancrazyvlogs6087]

time complexity should also be discussed

[@TechnicalAnkesh]

yes

[@pateljay4401]

Yes

[@vijayhiremath9618]

Similar to the selection sort

[@kaartikshukla6963]

O(n^2)

[@thorxgaming8061]

@@kaartikshukla6963 can u explain how?

[@saketbarnawal2150]

These course is so much helpful for me . I had learnt so much things from here. Thankyou so much for this course

[@ritu5368]

When any video come from bhaiya channel..Feeling is like 🔥🔥🔥🔥🔥🔥💥💥💥

[@gauravbhutani26]

Waiting for Web D... please bring it soon bhaiya,, Thankyou so much😍😍

[@shivanichawla00]

❤waiting❤

[@veerusingh1981]

Waiting too

[@rameshmalhotra9525]

kzbin.info/www/bejne/h4XEmnlug5ucabs

[@virajmurab7318]

this was a bit complicated but the code was pretty cleverly written!

[@mloneusk1539]

The code was so precise and to the point!

[@fallenleaves172]

I didn't understand some lines of this code..... but when I analysed it with an example.... I understand it's well written This would be difficult for beginners like me

[@aryansharma-wf8sn]

Bestest c++ course available on the internet by Aman bhaiya and urvi didi 🤩🤩😍😍🥰🥰

[@jeffkirchoff14]

@Om Prakash Yadav that's Ryt bhai

[@Patternninjacrypto]

@Om Prakash Yadav agar first time c++ explore kr rahe ya to sab kuch smoothly samajna ho jyada time dekar to codewithharry best hai. aur jab basics samaj gaye ho aur phir se sara remember krna ho to iss series se achchi koi series nai hai.

[@s.k.g5544]

@Om Prakash Yadav haa wo array bahut achha padhai h aur yaha mujhe bahut kuch samjh nahi aaya

[@smarakdey3739]

That was a great brain teaser. Loved it.

[@shambhavikhare9850]

thankyou for this series♥️

[@LifewRoshu]

Thank you so much AMAN BHAIYA and the whole team of APNA COLLEGE ❤️❤️✨✨

[@snehilsinha4689]

Samay Raina be like - "Ghoda is a respectable animal". 🤣🤣🤣🤣

[@chiranjeev331]

Aman bhaiya doing prank kzbin.infoIwTpJ8YRsUg ...

[@snehilsinha4689]

@KESHAV SINGHAL Yup I used to be a National Champion. But later had to quit Chess for studies :'(

[@akshatpandey8571]

@@snehilsinha4689 what why i am also a 1900 player still continuing

[@akshatpandey8571]

@KESHAV SINGHAL yup you?

[@snehilsinha4689]

@@akshatpandey8571 being a 1900 player, no one knows better than you ig how much practice and time it takes to be good at chess. There is one point where you have to choose between your studies and chess. You can't beat the strong players in a tournament without hours of practice each day. I cleared my 2nd IM norm and quit chess almost 3 years ago when I was around 2100 FIDE rated. Now due to lack of practice, I feel like even a 1500-1600 player might beat me :'). You can either be an IM or a GM at chess or an IM or GM at codeforces XD. I choose codeforces lol.

[@husler7424]

Most of/All videos missing most underrated factor: Time complexity and Space complexity

[@adityams1659]

I felt the code written was clever...It never occoured to me that I can use while loop...Thanks to while the code is simple....cheers!

[@ranjeet5806]

That's the difference between a passout and freshers like us. I had 3 for loops and 1 if statement only for sorting the array.

[@yashshingade1593]

indeed the code was clever but not because of while . we could have done the same thing using for . and in all prev cases we used for we couldve done them with while .

[@hargunsingh8365]

@@ranjeet5806 yes same here and also used 6 variables whereas she used only 5.

[@shivambhatnagar9473]

It is not clever. Same code or algorithm is given in the book Introduction to Algorithms by Thomas Cormen. They must have studied it from there.

[@rameshmalhotra9525]

kzbin.info/www/bejne/h4XEmnlug5ucabs

[@saparzadutta7316]

Thank you Bhaiya & our precious teachers🙇‍♀️!!

[@yourbestie4138]

who has noticed there is no adds in the lectures....😁😁...Thank u didi

[@shivammaurya3451]

Thank u aman bhaiya, mam ur explanation make coding very easy. It helps me to build confidence now after watching your all video since day 1 of coding it helps me a lot ur series is best ❤ 💕 💞

[@fuasteriskk]

yaar comment section me sabko samajh aara hai yeh topic ,mujhe nahi aara kya karuu

[@Kami_26]

@@fuasteriskk sahi keh rha he, is ne explain hi nhe kia kya ho rha he insertion sort me

[@ajaykiran6]

Thank you. are maine to bas 6th race tak ki sochi thi...aur soch raha tha ki waah kitna simple tha puzzle .. xD

[@035asadali8]

same

[@nayeemislam8118]

What a video it was! Whoever you are, thank you very much for such a Xoss tutorial!

[@akashtyagi9326]

She is Shardha kaphra from NSIT'22.

[@arslaan2001]

When I read the question of 25 horses at first, I made the algo: It'll take 5 races of 5 horses each, will record the timings of each horse crossing finish line and hence declare the winners according to the least time taken 😅

[@Shivamkumar-xu6hu]

Lol

[@tapeface2863]

by the way agar time taken pata kar sakte to [distance/time taken] se horses ki average speed pata nahi chal jati.aur vaha kaha hai (we cannot calculate their speeds)

[@gouripeddipawansreekar1752]

lol..same here bro

[@Ankushdas2001]

she forgot to mention you cant time the horses, this puzzle was asked by microsoft

[@jaymehta8022]

@@Ankushdas2001 Abhi firse video banaya hai iss pazal ka usme bola hai ki Google ka Puzzle Question hai😂😂

[@AmanSingh-rz1rj]

Aman bhaiya thnxx a lot for this giving video . Helpfull carry on

[@govindtomar6284]

I think the answer to the horse quiz should be 8. Because for the 2nd winner the race should be between A2, B1, C1, D1, E1. And then for 3rd winner, the race should be accordingly arranged taking one member from each group.

[@shobhabhatia1806]

Ya i m also thinking the same , but dont know if i m right or wrong

[@iedit1713]

yes, how come we know that C1 and other winner horses of respective horses actually slower than A2?

[@KushagraSikka]

bruh is A2 runner up in the row , and b1 is the runner up in the column,

[@quickclipsbysnoopy]

no you are wrong, because we can save who comes at what rank, we obviously know d1 and e1 are slower than 3 contestants. A1, B1, C1. So, they cannot be among rank 1,2,3. But, we don't where do a2 and b2 lie in this ranking

[@AbhinavPt]

the 7th race will be between the people who have only lost twice at most ,which will be A2, B1,A3,B2,C1. it won't be, anyone from D or E since, we already know that there are atleast three people faster than all the people in D and E, i.e. A1,B1,C1.

[@fatehpreetsingh1440]

Sir please start python and web dev also.BTW this cpp course is unbeatable💥💥

[@rameshmaske9919]

They will star after 1 or 2 months.

[@adityaupadhyay3]

ruko bhai sabar karo

[@fatehpreetsingh1440]

@@adityaupadhyay3 😅

[@rutuhirapara9370]

Aa gaya🔥

[@ayushdebnath3343]

The brain teasers since the last video are just awesome 😎😎😎

[@amith2607]

Love from Karnataka 💕

[@AdityaMishra-iq7zg]

who want a course of android development and animated course for java from our respected bhiya hit like to show that you want this course

[@AbhishekKumar-td5zu]

Tqsm bhaiya ♥️♥️

[@pranavchoudhary6491]

Bhaiya just a reminder( I know you definately remeber) Please upload the notes of 8.2 video They aren't uploaded yet 🙏🙏

[@sandeepkumarsingh4802]

8.3 video notes contains 8.2 video notes as well...check it once.

[@muhammadtaseer5017]

best video i have seen so far

[@jaypratap3888]

brain teaser was awesome. Best teacher di .tysm

[@channelcuriosity5043]

So much thanks to Aman bhaiya..........🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏

[@finyog]

Thanks for the video, valid index check in while loop can be done first and then the element comparison:)

[@SyedAbdulHaseeb1]

May be someone already pointed out, anyway I found out that while condition in insertion sort is not correct for every case, you have to check 'j' value first whether its >= 0, then check arr[j] > current

[@silverstar3417]

I think it doesn't matter because eventually that condition will be checked almost same time in the while

[@vamsikrishnadamisetti208]

I was wondering if someone would notice this,, Yes! If we are not placing 0 check on j before arr[j] its gonna be ArrayIndexOutOfBound Silver Star it matters I don't think .. explaining behavior of && is required!

[@jaiprakashjaiswal3240]

@@vamsikrishnadamisetti208 well explained

[@abhaytiwari6411]

Great Instructor 🙏🙏🙏🙏

[@shubhambhardwaj8894]

Awesome ❤

[@aishwarya1895]

Awesome explanation✌

[@cyyborgg]

Animations are really helpful.

[@shreyaschavhan5522]

Time Stamps - Insertion Sort - Concept - [0:10] Insertion Sort - code - [3:20] Brain Teaser - [5:25]

[@sakshithakur8465]

Content and time is great but we are a bit behind on the timeline bhaiya If you could increase the frequency students like me would be benefited a lottt.

[@oshawottschamber1937]

Thank you madam, you solved my doubt

[@NISHKARSHEDITZ]

Thanks for this video

[@GURU-lz1iw]

naah mereko lgta hai ki yeh waala puzzle galat hai... kyuki agr a5 jyada hua b1 se toh kya hoga???? humko yeh thodi pta hai ki a3, a4, a5 bada hai yaa chota hai b1 se... seems doubtful...

[@subhashiniyadav3477]

Thanks a lot bhaiya💛

[@sammygamer5733]

Use range based for loop For input and output of array😉

[@amankushwaha8180]

what is this can you explain

[@inspiredomkar1239]

function InsertionSort(nums){ for(let i = 1 ; i < nums.length ; i++){ let temp = nums[i] let j = i -1 while(j >= 0 && nums[j] > temp){ nums[j+1] = nums[j] j-- } nums[j+1] = temp }return nums } const nums = [5, 8, 3, 1, 9]; console.log(InsertionSort(nums));

[@dhruvcrio3545]

The "why' behind the things are not thought, like if we try to write the code ourselves we don't know whether do we use a j loop, and why do we go behind the current only, all this doubts building from first principles don't make sense. It's like there is just a code given and we are trying are best to break it down rather than making one ourselves. I LOVE THE SERIES. IT'S REALLY HELPFUL, BUT WOULD LOVE TO HAVE THIS CONSIDERATION IN IT.

[@aaryankakade328]

i found insertion sort ka code to be difficult ... it took me a while to completely understand the role and relation of 'i' and 'j' for how they were switching the positions of the elements ...

[@striker1917]

Can u explain plxzzz

[@striker1917]

Can u explain plxzzz

[@akashkaturishorts1163]

I need to use the debugger to understand this algorithm. But kudos.. It's simple and understandable.

[@gauravsharma3444]

This one is little difficult for me to imagine in mind , idn

[@rahul_ji21]

Bhai mughe to code samaj hi nhi ayaa😭

[@prajwalrahangdale5838]

@@rahul_ji21 we are same bro,😭...abhi code samajh gya kya

[@rahul_ji21]

@@prajwalrahangdale5838 😂ha bro samaj gaya 😆 lol

[@bikramdas103]

@@rahul_ji21 badiya h :d

[@codingriovo631]

what's idn?

[@Soft_Girl_99]

11 hours before exam

[@veerusingh1981]

Osm didi .u are just fab

[@adarshrana8243]

love your team biro.

[@ashutoshthite]

The brain teaser is sooo good !!😊

[@abhishekthakur2933]

did you code it?

[@Abhineet.rawat.]

you are awesome shrdhha mam

[@PujaSingh-tg3zr]

Thanks bhaiya...

[@harshitsaini9306]

you should teach with comments , it really helps in making notes and memorizing the algorithm

[@ashwinsingh5805]

Thanks a Lot bhaiya

[@JyotisArt]

Nice 👍

[@PritamKumar-mr5dv]

while(j>=0&&arr[j]>current ) this will improve null pointer exception

[@vamsikrishnadamisetti208]

ArrayIndexOutOfBound not null

[@salmaniproductions1104]

thank u so much didi😇

[@AbhiMule404]

I love your backgrnd music ❤

[@ankitpandey8967]

Maam you are awesome teacher 👍

[@mdsaifalam8542]

What is the intro music used??? Its great ❤️

[@v4victor89]

I think for the puzzle the current solution should be 9 races…as how can we say that only A2 is fast enough as B2 ….what if all horses in A group are faster than B1 …just what I thought…any thing I missed ….plz correct me…btw grt tutorial di

[@AmanDeep-cw5gg]

@Akshay R what if all fastest runners are in same group?

[@suryansh-me]

Bhaiya aap mahan ho you are not from this world 🙏🙏

[@kslalita6336]

Thanks...

[@utkarshsingh2598]

Mam please tell can we first sort the array and then add a number in it (it is possible or not for this kind of question)?

[@raihanmdsiqbal9097]

Bhaiya merge, quick, insertion, count, radix sort kab aayega. Thank you bhaiya and Didi awesome video. God bless you.

[@himanshuprem600]

thank you........

[@shubhammandal4974]

So in the brian teaser we are indirectly making fixture of the matches -Any P.E student here

[@adityapatil9215]

best content

[@vedantparatkar7266]

carry on

[@qasimnawaz7765]

it will take 6 races to find out the 3 fastest horses. In first 5 races, we'll get the 5 fastest among them and at the 6th race, we'll get the 1st fastest horse. And 2nd and 3rd fastest horses will automatically be those horses who got 2nd and 3rd position in the race respectively. If you guys think im wrong, lmk in the reply :)

[@sadicarnot1861]

exactly...i also think that

[@Tanish_sahu]

please provide the code of this puzzle its so difficult to write

[@nawaz_haider]

love from Bangladesh

[@classofapnis4982]

Bhaiya thank you

[@prashantsaini9374]

Bhaiya app jo notes de rhe ho Vo app pdf bnake daal doge ? Jb c++ ka course khatm ho jayega Phase 1 and phase 2 uss se kaafi help hogi 😊

[@patelrajkumarnareshkumar8156]

in a insertion sort we should use forloop instead of while it's easy to use.

[@savani3843]

I thought the same thing for bubble sort code

[@_code.hunter_]

6th race me hi 3 fastest horses aa gaye to 7th race ki need kyo he 6th me jo top 3 honge vahi to 3 fastest horses honge

[@_KUHUSINGH]

Why do we consider extra current variable to store arr[ 0 ]

[@lalitshah7867]

Didi bahut achha hai

[@anujpoudel]

So can we say that the Insertion sorting is dividing an array into two parts, 1. Sorted array 2. unsorted array and applying bubble sort from the first element of the unsorted array to the first element of the array and break bubble sort loop if swap not needed...PLEASE CORRECT ME IF I'M MISTAKEN. CAN WE SAY THIS INSERTION SORTING?? for (int i = 1; i < n; i++) { for (int j = i - 1; j >= 0; j--) { if (arr[j+1] < arr[j]) { int temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; } else { break; } } }

[@varshagoyal9574]

This is a absolutely a another way of sorting 👍👍 but I don't think. It should be called insertion sort because in it we r just comparing element with neighbour and swap

[@kushagradixit8219]

you can't swap elements in insertion sort

[@HawkingMerchant]

yaar jadu ki tarah sidhe dimaag me ghus gya concept

[@kiran9638]

💖💖💖

[@saitejalucky6428]

You all are teaching awesome ....but one question is that ... Do we have to start practicing the completed topics in hackerank or hackerearth or geeksforgeeks???plzzzzzzzzzz answer ......

[@nikhilverma360]

Yes! Do at least 1 question per day, no matter it is easy question or hard.

[@indumatichakrabarti8414]

Your voice is so sweet ❤️❤️👍

[@chiranjeev331]

Aman bhaiya doing prank kzbin.infoIwTpJ8YRsUg ........

[@cheedhuruvivekvardhan6923]

small correction j>=0 has to be written at before if doesn't it could give IndexOutOfBounds Exception.

[@ketanmorey1953]

Mam please make a video on quick sort and merge sort..

[@satvikisahu9449]

Thank u so much for these video for sorting... Coz I'm c++ student from last 3 years... & sorting always better difficult part for all my mates & me..... But u told so nicely I'll always gonna remember it 💕. Thank you 😍 keep growing 💚 all the best 💛

[@AmitKumar-ld3mz]

sachme ... aur easily explain kr skte hy ..

[@roastie2474]

@@AmitKumar-ld3mz Chup Bhutni ke

[@SCRONE_]

Bhai tu pichle 3 saal se bs c++ me hi atka hua tha 🤣🤣🤣🤣

[@codinglover4501]

Plz provide practice questions and solutions next day upload keya kro .

[@fundestroyer9281]

Literally this video was so unclear no explanation of the step why do we need to do this.

[@aamirrafi8137]

Ryt bro

[@__idyllist]

You got the logic. No matter of what it is!😎

[@Let-s_Entertain....]

​@@__idyllistright 👍

[@untold_vlogs_09]

Sahi bat he

[@pnkdtu27]

Bro it's not School that need logic for everything it's all about using your own logic and thinking abilities

[@manigoyal4872]

is current a reference variable cause if not while loop won't work as per the requirement

[@deviprasad_bal]

at 4:40 isn't there a chance of short-circuiting in that AND operator if 'j' becomes negative ?

[@shubhdangwal4190]

yeah there is...we can use that condition as a seperate if condition inside our loop and if that condition is true we can use continue statement so our loop doesnt breaks!

[@UnlockEngineering]

while compiling this insertion sort -- it seems like it doesn't work if two elements in a list have same value - am i right or it's just an error in code

[@anshchaudhary8051]

Nice didi

[@ujjawalmishra858]

Awesome Video, Thank You so much... Reminder:- Bhaiya when will 8.2 notes will be uploaded ??

[@simplegamer2711]

Bhaiya I drop after 12 th still I go to dtu btech lower branch. This is first time I am really dedicated to online courses .so please tell me if I have lower branch in dtu then can I crack good placement if I invest every day 2-3 hours to your course dedicatedly for four years.

[@ashishburnwal1578]

should also add time complexity analysis as well.

[@sourabhchoudhary7175]

We are just doing it by seeing the numbers but what we're actually doing should be discussed.. Like we are comparing the numbers from starting and if it's greater than and smaller than a number then it's placed in between them.

[@shivamaggarwal4887]

Yes the logic was not clear