33 thoughts on “8.3.3 Insertion Sort | Sorting Algorithms | C++ Placement Course |

  1. if you find difficult to understand about insertion sort from this video , go and check 'codewithharry' insertion sort video then come here ,now you will able to understand the theory and the code that she taught in this video …

  2. 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 💛

  3. 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?????

  4. I have a doubt in the brain teaser, A3 can also be 2nd fastest horse, it's possible both A2 A3 gave better competition to A1 than B1, that mean 2nd fastest horse will be among A2,A3,B1-7th match and then the two losers of this match compete for 3rd position along with B2,B3 and C1, and that would be 8th match. Please correct me if I am wrong.

  5. 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…

  6. Maim in brain teaser HOW CAN YOU PREDICT THAT HORSE A2 is SLOWER THAN HORSE B1??
    For example, Let have the condition Of their completion times(in seconds):
    A1 – 10 ; A2 – 12 ; A3 – 14 sec

    for B
    B1 – 15 sec; B2 – 17 sec ; B3 – 19 sec

    Then you must choose top 3 from A1, A2, A3

    not by directly saying toppers of every heat.

    (Same example of this problem in practical terms is JEE MAIN percentiles of different heats, if you want top 3 toppers you can't say that do fight with toppers of all individual batch)

Leave a Reply

Your email address will not be published. Required fields are marked *