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

[@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 🙇‍♂👏

[@ritu5368]

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

[@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?

[@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

[@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!

[@aryansharma-wf8sn]

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

[@jeffkirchoff14]

@Om Prakash Yadav that's Ryt bhai

[@Harshp062]

@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

[@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

[@saketbarnawal2150]

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

[@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.

[@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.

[@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...

[@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

[@yourbestie4138]

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

[@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

[@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

[@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😂😂

[@PritamKumar-mr5dv]

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

[@vamsikrishnadamisetti208]

ArrayIndexOutOfBound not null

[@pranav_1056]

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.

[@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));

[@smrtghosh5072]

Semi colon kon dega

[@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?

[@LifewRoshu]

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

[@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🔥

[@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

[@shambhavikhare9850]

thankyou for this series♥️

[@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

[@shreyaschavhan5522]

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

[@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

[@finyog]

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

[@ayushdebnath3343]

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

[@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.

[@AryanGupta-ti4dc]

Why we did j-- ? I didn't understand

[@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

[@dhruvrawat2561]

8:44 , but is it necessary that we consider b2 to be the third fastest horse well c2, d2 and e2 can be the third fastest, it is just that we havent raced them yet , i m just saying that we have just landed ona conclusion that a1 is the fastest horse then the other horses in the same queue will also surely be the second and third fastest.

[@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?

[@smarakdey3739]

That was a great brain teaser. Loved it.

[@JyotisArt]

Nice 👍

[@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

[@sammygamer5733]

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

[@amankushwaha8180]

what is this can you explain

[@varshithar3781]

For the brain teaser, Assume speeds of 1st set of horses be40,50,60,70,80 and for 2nd set be 10,20,25,16,21. Then the fastest horse from 1st set would be 80 but from 2nd set would be 25. some horses in set 1 are faster than those of fastest set 2 horse. then there must be more races to be conducted right?

[@allenbenny5981]

i also thought the same way vro

[@Aditya-sy2ui]

We need 12 races

[@tashvikbhagat4081]

irl, there speeds do not have a vast difference

[@PrasadSai-ty6dz]

then 2nd set would be eliminated in the 6th race which is btw winners of each group

[@balkaran8458]

after j-- , j ki value j=0 ho jaygi to phir humne a[j+1] pr current value daal dijabki wo value j=0 pr aane chaiye the j+1 pr to alrady value chali gyi yaha smjh ni aaya kiya hua hai koi btaa skta hai

[@rishabhsharma1919]

can someone explain it with dry run

[@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 😊

[@_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

[@ayushtiwari4895]

Why arr[j+1]= current Bcz it will put current in arr[1] only

[@cheedhuruvivekvardhan6923]

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

[@AbhishekKumar-td5zu]

Tqsm bhaiya ♥️♥️

[@shubhamXmandal]

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

[@AmanRaj-nn6xx]

The solution for the puzzle question looks like a mess. The way five groups were divided into A12345, B12345, ... , C12345 Let's just consider the speeds of the horses in group A as 2,4,6,8,10 km/hr and A1, A2, A3 as the winners. What if the speed of the horses of the B group is 20,30,40,50,60 or any higher numbers. The horses B1, B2, B3 are the winners here, but the horses of Group B like B4 and B5 have higher speed than even the fastest horses of group A but they'll end up being disqualified. There are other different observations too which suggest the solution was an over-simplified one. Do correct me if I'm wrong or I'm missing something.

[@prashantupadhyay3652]

correct mam.. i too thought about that only

[@shashankst8728]

Actually I feel we have to take the best possible case to find the lowest number of races.

[@amith2607]

Love from Karnataka 💕

[@harshitsaini9306]

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

[@ashishranjan8321]

Doubt--- we are given 25 horses and we have divided them m 5 groups including 5 horses each...... So what if the slowest horse in group A is fastest then horses of other groups??

[@Gurl975-b9o]

I still couldn’t get the last horse question as at 6th race we can get our 3 winners ,, runner ups

[@_KUHUSINGH]

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

[@nishanklalitjain8435]

Why we wrote j-- in the loop I didn't understand is there any one to help me???

[@nikunjbosamiya1051]

When i create a function for insertion and bubble sort with parameters n and arr and then call that particular function passing both requited arguments. It gives me below result for the given input. Input arr={5,4,3,2,1} Output={1,2,3,4,5,5} Why am i getting 5 tow times. Also when i don't make a function, the same code is giving me correct output i.e it is not repeating 5. Please help me on this.

[@Tanish_sahu]

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

[@kashyapbhalodiya2945]

Horse example A1>A2>A3, B1>B2>B3 and C1>C2>C3. And now A1>A2>B1 this type is possible? I am right or wrong.

[@oshawottschamber1937]

Thank you madam, you solved my doubt

[@suryansh-me]

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

[@blaisegonsalves4536]

why is cin>>arr[i] please explain as idk c++ i've only worked with c programs

[@raihanmdsiqbal9097]

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

[@arshpreetsingh5186]

void InsertionSort(int arr[], int size) { for (int i = 1; i < size; i++) { int current = arr[i]; int sorted = i - 1; for (int k = sorted; k >= 0; k--) { if (arr[k] > current) { arr[k+1] = arr[k]; arr[k] = current; } } } }

[@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

[@ayushranjan3014]

The horse question explanation is wrong. It is fairly possible that A2>B1. Or even A1 A2 and A3 are the only 3 fastest horse. A/q to me we will have to consider as 3 winner from all the 5. And thus proceed as such 1st: 25 horse 2nd: 15 horse 3rd: 9 horse 4th: 6horse and then ans in the 5th stage. Its algo will be while(no_of_horse!=3) { no_of_round=no_of_horse/5; count+=no_of_round; no_of_horse= (3*no_of_horse)/5; }

[@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.

[@diveshkumar1593]

You explained condition like when we swap those numbers and all , but you didn't told explain us about that loop you used, why we are using those conditions, why not ,

[@sawangupta-k9z]

i have doubt about the puzzle, what if a4 or a5 is faster then b2 or b3 similarly c4 or c5 is faster then d3 then how we find the fastest ?

[@ashishgaikwad1378]

are didi thoda dire code bataya karo kaha kana hota hai kiya bhaiya please thoda theere varla

[@manasgupta6647]

1:56 we perform shifting instead of swapping in insertion sort👍👍

[@dishantaggarwal6313]

Didi should we start doing practice array ques. on gfg, hackerrank , hackerearth???

[@kslalita6336]

Not now you may try beginner level bro to get feel...

[@parthbhayana6326]

why this code throws an error if we don't use "current" ? just using "arr[i]" instead of "current"

[@antor.morsalin]

using them as function is even better .

[@myth_02]

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

[@ajiteshgarg7557]

kuch jada hi tgdi animation h!!!!!! gajaaaab

[@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.

[@vortex370]

the condition return is wrong ... Because let j=-1 arr[-1] eventually give array index out of bound Beacuse we are checking j>=0 after arr[j]>current So the code is wrong

[@vaibhavbisht9649]

Shouldn't the condition for while loop be written like While(j >= 0 && arr[j] > current){ }

[@PujaSingh-tg3zr]

Thanks bhaiya...

[@indumatichakrabarti8414]

Your voice is so sweet ❤️❤️👍

[@chiranjeev331]

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

[@AbhiMule404]

I love your backgrnd music ❤

[@AmanSingh-rz1rj]

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

[@vivekchaturvedi6677]

mam aapne jo array banaya h usme uska size run time me batayega , wo galat h sari compiler pe ni chalta wo ... correct it mam

[@akankshasingh5048]

isme apn ne temporary variable q nhi use kia value store krne k liye..jb hm value assign krnge uss position ka value loose nhi hoga previous position ka?????

[@Krishnaaa34]

😅 brain teaser ne toh brain ke ghode doda diye.

[@lalitshah7867]

Didi bahut achha hai

[@channelcuriosity5043]

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

[@trilokshivhare1665]

coding both fast hone ke karan hum kuch samaj nhi pa rhe h plzz coding speed ko kam kiya jaaayee

[@kazuha7098]

I tried solving quiz question using c++ but was not able to solve it, can anyone tell me how to code it when we are taking no of horses from the user.

[@HawkingMerchant]

yaar jadu ki tarah sidhe dimaag me ghus gya concept

[@vedantparatkar7266]

carry on

[@ankitpandey8967]

Maam you are awesome teacher 👍

[@alexhaless6786]

what if the horses of B are slower than All A horses??? my answer coming out as 11.

[@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.

[@anshchaudhary8051]

Nice didi

[@codinglover4501]

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

[@nikhiljha3168]

If I keep "arr[i]" in place of "current" then why, I am not getting the right output. please reply

[@rohitchilhorkar8114]

I am getting correct answer. Plz check your code once..

[@SiriusXMG]

me to i am not getting correct answer please explain

[@monu_7712]

Nikhil jha arr[j+1] will take place of a[i] in first iteration so we have to use another variable to store a[i] ..