Big O Notation, Time Complexity | DSA

Telusko Courses:
Spring and Microservices Live Course : bit.ly/springmslive
Coupon: TELUSKO25 (25% Discount)
Industry-Ready Java Spring Microservices Developer Live : bit.ly/JavaMS2
Complete Java Developer Course : bit.ly/Comp-Java-Dev-2
Coupon: TELUSKO20 (20% Discount)
For More Queries WhatsApp or Call on : [phone]
website : courses.telusko.com/
Instagram : / navinreddyofficial
Linkedin : / navinreddy20
TELUSKO Android App : bit.ly/TeluskoApp
Discord : / discord
More Learning :
Java :- bit.ly/3x6rr0N
Python :- bit.ly/3GRc7JX
Django :- bit.ly/3MmoJK6
JavaScript :- bit.ly/3tiAlHo
Node JS :- bit.ly/3GT4liq
Rest Api :-bit.ly/3MjhZwt
Servlet :- bit.ly/3Q7eA7k
Spring Framework :- bit.ly/3xi7buh
Design Patterns in Java :- bit.ly/3MocXiq
Docker :- bit.ly/3xjWzLA
Blockchain Tutorial :- bit.ly/3NSbOkc
Corda Tutorial:- bit.ly/3thbUKa
Hyperledger Fabric :- bit.ly/38RZCRB
NoSQL Tutorial :- bit.ly/3aJpRuc
Mysql Tutorial :- bit.ly/3thpr4L
Data Structures using Java :- bit.ly/3MuJa7S
Git Tutorial :- bit.ly/3NXyCPu
Donation:
PayPal Id : navinreddy20
www.instamojo.com/@NavinReddy

[@malvernmabvira1562]

Can't be more grateful for this video🙏. Never seen a teacher like this.

[@philjoseph3252]

You are the single greatest python teacher in the world, even Charles Severance can't teach as well as you. I watched so many videos on Big O but this is literally the first time I ever understood it

[@asalkargauri2445]

thankyou so much sir i cant even express how you helped me by uploding this video i request you please complete dsa series thankyou somuch i owe you!!!!keep doing

[@ajinzrathod]

Keep up the good work! Please keep the DSA series on ongoing and also explain Time and Space Complexity in each of them. Your work is just AWESOME

[@kapiljain7596]

Please post more videos like this. I understood the concept of big 0 very clearly

[@AdarshaCoder]

I was waiting for this video... please keep uploading..

[@gowthamreddysomala]

Meeru Great Teacher Sir..

[@VivekSarmaKommanamanchi]

excellent video sir , we want more videos like these

[@sankyaaaaa__]

I want to say thank you for starting this dsa series....i was waiting for you to start dsa..the way you explain gets fit into the mind...

[@rmpdasilva]

Really nice explanation!

[@abdallahahmed6022]

Sir you're the best. Thank you sooo much for your kind support!

[@programmerdesire]

Amazing explanation ❤❤

[@bharathtricks]

Thanks you so much sir it's very helpful ❤❤

[@praveenmail2him]

Brilliant explanation!

[@RajeshYadav-fz3ds]

Big thanks to Navin Annaya ❤ maja aayega

[@sourishgupta3340]

More videos on algorithms and dynamic programming please, and help us to make better projects

[@ghosal_mainak]

Hi Naveen
If you can cover Dynamic Programming..it would be great help

[@sanjaykushwah8271]

Thank you for the video; I learned a lot. However, based on your explanation in the video, I believe the O(n) graph should be positioned in the middle, not below.

[@sarasalhi8]

thank you so much navin

[@chuabenjamin]

Sir you are a hero

[@GopiGopi-tl4vt]

Helpfull 🏅

[@decimusmeridious4444]

thank you for existing

[@bharathtricks]

Super sir❤❤❤❤

[@touheedurrehman]

Thank you sir❤

[@prashlovessamosa]

Good evening sir.

[@iamdivyaprakash]

Good morning sir ! Are you going cover all DSA topics here ?

[@OMKAR-lj8ci]

excellent

[@runnysarfo4869]

can we use a binary search without sorting the array

[@sohampaul1]

I have query in Binary search. As you said "if Target is less than the Mid value, then after Mid values of the array have no importance [8:37]". Why we count Mid value here for next loop ? We already know, Mid value is greater than Target value. It should be "if Target is less than the Mid value, then from Mid values of the array have no importance".

[@radhakrishnabelievers]

yes, u said correct, if the target is less the we move towards mid-1 will be the end point ,and if the target is greater then we move mid +1 will be the start point.

[@rockstarkavya7431]

In binary search the numbers are always in ascending order

[@rajivsharma7742]

Quite helpful 😇😇😇😇😇😇😇😇😇😇😇😇

[@bahurudeen7]

Great Explanation sir❤🎉

[@mahidhar6247]

nice

[@mayuridhokane5493]

👍

[@abdeldjalillouhichi1749]

♥♥

[@zr0724]

sir thank you , please don,t ever skip this series or i will sucide 😩

[@user-of8kt9no9s]

sir even ChatGpt is recommending your channel

[@rajeshpakkala]

Please start paid course or give full list of dsa sir

[@gopichanti1977]

In the following pseudocode, let A be an array of n positive integers, x be a positive integer
number, start be an index, p be a list of integers, and result be a list of lists.
a) Explain what the Mystery function does.
b) Find an upper bound for its time complexity (T). Hint: You need to write T(n,x) as a
recurrence relation and solve it by expanding it.
function func(A, x):
A.sort()
result = []
Mystery(A, x, 0, [], result)
return result
function Mystery(A, x, start, p, result):
if x == 0:
result.append(p)
return
if x < 0:
return
for i from start to n - 1:
Mystery(A, x - A[i], i + 1, p + [A[i]], result)
anyone please help me with this ?

[@codegreat8201]

Second Comment

[@AdarshaCoder]

Now i feel like why this video ended so fast 🥲