Can't be more grateful for this video🙏. Never seen a teacher like this.
@philjoseph325211 ай бұрын
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
@TweetpreneurАй бұрын
Fantastic video, I am learning DSA for the first time and this video made so much sense to me. Thank you
@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
@ajinzrathod6 ай бұрын
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
@sohampaul18 ай бұрын
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".
@radhakrishnabelievers3 ай бұрын
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.
@ghosal_mainak Жыл бұрын
Hi Naveen If you can cover Dynamic Programming..it would be great help
@abhishekm.e3668Ай бұрын
Good explanation but how we can take advantage with Big O Notation in case of unsorted arrays?
@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.
@kalideb-y3y25 күн бұрын
how do we do binarySearch if the target we're looking for is not a number?
@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...
@AdarshaCoder Жыл бұрын
I was waiting for this video... please keep uploading..
@gowthamreddysomala Жыл бұрын
Meeru Great Teacher Sir..
@kapiljain7596 Жыл бұрын
Please post more videos like this. I understood the concept of big 0 very clearly
@user-of8kt9no9s7 ай бұрын
sir even ChatGpt is recommending your channel
@abdallahahmed60227 ай бұрын
Sir you're the best. Thank you sooo much for your kind support!
@iamdivyaprakash Жыл бұрын
Good morning sir ! Are you going cover all DSA topics here ?
@bharathtricks Жыл бұрын
Thanks you so much sir it's very helpful ❤❤
@rmpdasilva Жыл бұрын
Really nice explanation!
@VivekSarmaKommanamanchi11 ай бұрын
excellent video sir , we want more videos like these
@sourishgupta3340 Жыл бұрын
More videos on algorithms and dynamic programming please, and help us to make better projects
@psudhakarreddy654828 күн бұрын
Best videi.Thank you
@runnysarfo4869 Жыл бұрын
can we use a binary search without sorting the array
@vickysit232 ай бұрын
It will not work
@rockstarkavya74313 ай бұрын
In binary search the numbers are always in ascending order
@shaiksohel05 күн бұрын
thank you
@chuabenjamin Жыл бұрын
Sir you are a hero
@praveenmail2him9 ай бұрын
Brilliant explanation!
@RajeshYadav-fz3ds Жыл бұрын
Big thanks to Navin Annaya ❤ maja aayega
@programmerdesire Жыл бұрын
Amazing explanation ❤❤
@vigilante1914 ай бұрын
thank you for existing
@Tom-sp3gyАй бұрын
I love you sir !
@sarasalhi8 Жыл бұрын
thank you so much navin
@bahurudeen7 Жыл бұрын
Great Explanation sir❤🎉
@zr0724 Жыл бұрын
sir thank you , please don,t ever skip this series or i will sucide 😩
@rameshmc17842 ай бұрын
God mode sir ❤
@bharathtricks Жыл бұрын
Super sir❤❤❤❤
@prashlovessamosa Жыл бұрын
Good evening sir.
@rajeshpakkala Жыл бұрын
Please start paid course or give full list of dsa sir
@touheedurrehman Жыл бұрын
Thank you sir❤
@GopiGopi-tl4vt Жыл бұрын
Helpfull 🏅
@rajivsharma7742 Жыл бұрын
Quite helpful 😇😇😇😇😇😇😇😇😇😇😇😇
@gopichanti19777 ай бұрын
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 ?