Guidelines for Asymptotic Analysis (Part 1)

Data Structures: Guidelines for Asymptotic Analysis (Part 1)
Topics discussed:
1) Calculation of Time Complexity when we have:
a) Loops
b) Nested loops
c) Consecutive statements

Music:
Axol x Alex Skrindo - You [NCS Release]

#DataStructuresByNeso #DataStructures #AsymptoticAnalysis #BigONotation

[vasilvasilev]

I have never witnessed better teaching, I literally have no questions about something badly explained, because there isn’t any such thing, after each video it is only the eagerness to learn even more.... astonishing

[sj]

sir aap guru ho humare itne shaandar videos bnaye hai ek ek cheej samaj aa jati shukriya sir ji

[indanadeevena]

Isn't that soooo....🤩😇
For your teaching...👏👏

[kunalsoni]

Wow!😊😊 This is very helpful video for us for understanding about time complexity

[ShubhamGupta-wqry]

eagerly waiting for more lectures on data structures

[AbhishekThakur-gzul]

Waiting for this video. 👍
You explanation is good from other..

[Archana-vh]

Ur literally awesome no words are sufficient

[anishmanna]

The problem has been solved incorrectly ; there is no any point of intersection, c value must be 1 + 1 + 3 = 5 and n = 1. In that case only we shall find a point of intersection between the graphs of f(n) and g(n)

[shourya]

Please compare some with unusual standard functions to get idea about how big O behaves with that

[adilnesar]

cant be taught better than this mark my words.

[malleshyadav]

Sir, please continue the course discrete mathematics 😟😟😟

[shreyasgosavi]

I have a doubt.. total time in case of for-loop should be n+1 as it also checks the condition for the false statement.

[KrishnaKrishna-vbjs]

Agr j++ ki jagh j=j+i hoto pir time complexity kya hogi

[sarcasticboy]

i fyou ahve n(n-1)>= 3 i dont think you can directly do n>= 3 or n-1>=3