Space and time analysis of Insertion Sorting-1 | Analyzing an algorithm |Data Structure & Algorithms

#Gatecs #Analyzing an algorithm #DataStructures #Correctness #Appliedroots #Gatecse

[techpriya]

where is the explanation of line 5, 6 and 7.And I am in doubt that comment line also executes?

[laraibadeel]

That is well explained thank you for sharing🌟

[ENTJ]

well, actually the first line is executed n-1 times(for smaller n) and n times for the huge amounts of n(when the complexity analysis matter) due to the big O property in mathematics. I am writing this because you did not cover why it executes n times well.

[SarSame-bg]

3:40 Comments DO NOT get converted to the machine language.. so those DO NOT get executed by the CPU.

[Rawoonahcool]

I like you, you helped me understand. Thank you so much.

[sreepras]

Thank you for the highly informational lectures! In this algorithm, can you please throw some light what portion is stored/computed in cache? Just curious to know how cache and RAM differ as in usage.

[Ankit-mqem]

Hii Verma sir I request you to please make a video how to prepare for gate 2022 after analysing the condition of gate 21 paper?? What are the things to be changed while preparation so that we can tackle msq also in effective manner etc

[umutkayatuz]

The comment in the code has a cost of 0 cause it is not being used

[_ombeeka]

PLEASE TELL WHY DONT WE CONSIDE THE INDEX FROM 1 IF THE FIRST ELEM IS a[0]

[Theshyvlogger]

I'm confused. Why n-1 number of times?

[JakeCollinz]

Everthing that you have taught is wrong over here