Asymptotic Analysis (Solved Problem 3)

Data Structures: Solved Question on Asymptotic Analysis
Topics discussed:
1) Calculation of Time Complexity of a program with nested for loops.

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

#DataStructuresByNeso #DataStructures #AsymptoticAnalysis #BigONotation

[saniyamansuri]

Plz continue these series @neso academy . This is just too helpful.

[abdulbaseermahmood]

Can you also upload videos for space complexity? I highly appreciate your content. It is amazing.

[mrunalshende]

thank you for giving this presentation

[rashmitharashmitha]

Simple...short...crisp...nice explanation sir...thank you..so much

[gulfamraza]

Your content is Premium! Glad you are giving it for free.

[brayandesilva]

Your videos are super easy to learn and useful thank u so much

[touseef_akhtar]

I found it a bit confusing, please guide

The inner for loop is incrementing by 4 in every iteration but you choose to go with O(n) time complexity for it.
But if it were incrementing by just 2 in every iteration, you would have gone with O(log(n)) as you have done in previous examples.

So, what I feel wrong about this is j+=4 is faster than j+=2, but we are reflecting it slow in terms of O-notation.

[gabrielj.]

No homework problem in this video =(
Thank you for making this content!

[AryanKumar-ccku]

🔥🔥 maza aaya ...pr theta, omega asymptotic analysis nhi padhye aap

[VishalYadav-ssqv]

Excellent teacher you're sir ji 🙏🙏❤️

[prashantkumar]

Thank u so much sir..
Your lectures are very helpful for gate exam

[meghanirala]

Thank you sir for uploading these videos and teaching in such a easy way.

[_prasenjitmondal]

Sir increase frequency asap.Thank you for providing us such content

[ayushshukla]

thankyou sir i was searching for gate c tutorial..i got it here..thankyou v much

[pushkarajyeolekar]

Sir please make tutorial videos on c++

[vickyn]

Since, the first for loop has no braces so only the next line it can hold can you explain what exactly will be the time complexity here. According to c++ and c

[narendergoud]

how can we decide that we have two consider the upper bound and lower bound for particular iteration

[MuraliKrishnaPendyala]

Sir, What if get k = n-1 then would the time complexity be O(2n) 'cause least upper bound should be greater than what we have which is n.

[ohhhokkk]

Isn’t printf(“hello”）also executed n squared times?

[monikatiwari]

Can you plzz cover whole syllabus of algorithms for gate preperation plzz sir