@@akshaykumarmishra6535 So because you encountered one bad Nigerian you're going to plaster an entire race as bad? You're disgusting and a disgrace to Indians
@@akshaykumarmishra6535 shame on you...you can't blame entire community just because of bad deeds of one person.... I am also from India...and I have met several African people ...you can't blame in that way....
Although in programming, in most cases we mean recursion as an implementation where a function calls itself, recursion as a process is reducing a problem to sub-problem in a self-similar manner. Any program that can be written using recursion can be written iteratively as well. In fact , if you write a recursion for binary search, it will be called a tail recursion which will anyway be optimized by compiler to iteration. Thanks for asking :)
I am not from computer science background. So i have no idea about Big o(n) complexity. Finally I found your tutorial here. It really helpful. I finally followed your instruction and applied this logic in my application which i am working. It works like charm :) //Node js version function search (arr, x){ var start = 0; var end = arr.length - 1; console.log("Start value:", start); console.log("End value:", end); console.log("search for x:", x); while( start
Please do a full featured course on Data Structures and Algorithms and solve around 100+ very popular competitive problems and upload it on Udemy! We will be happy to buy it
@code fire well he was the greatest in India in competitive programming at least, he ranked 31st in Google Code Jam in 2008, and i don't think any Indian after that have ever got a higher rank than this in Code Jam.
Who cares about the accent when a man is smarter than the devil? You only bow to him! I mean in all seriousness, you can't but appreciate the knowledge. I can see why your country is on the move. I thank and salute you!
Bullshit. The beginning emphasizes how the typical method is less efficient. Understanding the reason we use binary search is even more important than knowing how to implement it (because why implement it when you don't have a reason to?)
Excellent video, although i'd explicitly label the first search method as linear instead of having "Binary Search" at the top. It could confuse people who are just starting out, or those that just watch the first example.
probably a noob question... but how does binary search works on an unindexed lists? For example, in class I was given the assignment to integrate binary search in an ordered list that we made which only has the attribute 'length'... In the video I noticed you did A[i], which assumes the array or list has an index... what if I wanted to implement binary search into my unindexed list?
Hi , but if the array have duplicates then it should give the output telling positions of indexes , how to make it work for duplicates elements in the array..?
This guy is the best teacher, i watched a lot of teaching videos but this one is really the best
Indians are very intelligent people, Thanks, Greetings from Nigeria.
@@akshaykumarmishra6535 why so much hate?
@@akshaykumarmishra6535 So because you encountered one bad Nigerian you're going to plaster an entire race as bad? You're disgusting and a disgrace to Indians
@@akshaykumarmishra6535 shame on you...you can't blame entire community just because of bad deeds of one person.... I am also from India...and I have met several African people ...you can't blame in that way....
@@shivamkumarsuman3924 pehli fursat me nikal..... Nikal. ***@#₹
@@akshaykumarmishra6535 we indian are good in this only, to criticize others.
Although in programming, in most cases we mean recursion as an implementation where a function calls itself, recursion as a process is reducing a problem to sub-problem in a self-similar manner. Any program that can be written using recursion can be written iteratively as well. In fact , if you write a recursion for binary search, it will be called a tail recursion which will anyway be optimized by compiler to iteration. Thanks for asking :)
Very clearly presented, thanks for taking the time to make these great tutorials!
Thank you so much for the clear explanation! My PH.D professor needs to learn from you on the art of teaching.
ol ^_^ PhD professors usually speak out non-sense....
Superb Explanation. Even after 9yrs I feel this one of the best explanation...
This video will never become old.
I am not from computer science background. So i have no idea about Big o(n) complexity. Finally I found your tutorial here. It really helpful. I finally followed your instruction and applied this logic in my application which i am working. It works like charm :)
//Node js version
function search (arr, x){
var start = 0;
var end = arr.length - 1;
console.log("Start value:", start);
console.log("End value:", end);
console.log("search for x:", x);
while( start
Thanks for helping me get through cs50! I honestly would have given up if it wasn't for your videos
This guy is awesome, very clear explaination
Amazing explanation, clear and to the point.
bro!!... u really made it very clear!!!... i never thought it would be so easy... keep up the good work!!!
finally i started understanding algorithms :D thanks. I appreciate your effort for helping a lot of students.
Please do a full featured course on Data Structures and Algorithms and solve around 100+ very popular competitive problems and upload it on Udemy! We will be happy to buy it
bro mycodeschool was a startup and it is closed after the death of one of its founder known as Humblefool he was best programmer of India
@@dilpreetsinghnagra Humblefool GOD
He died :(
@code fire well i just meant he was Godlike in coding
@code fire well he was the greatest in India in competitive programming at least, he ranked 31st in Google Code Jam in 2008, and i don't think any Indian after that have ever got a higher rank than this in Code Jam.
Thanks for the awesome explanation! I watch your videos to gain conceptual clarity.
I would rate this 10/10. You have a weird accent but everything is clear, and the diagrams are also on point. Keep up the good work man. :)
indian accent for english is the best
Who cares about the accent when a man is smarter than the devil? You only bow to him! I mean in all seriousness, you can't but appreciate the knowledge. I can see why your country is on the move. I thank and salute you!
There are captions :/
he just said that everything is clear
fucvk u
My fav youtuber...wish I could have you as my lecturer 🤗
amazing video! understood the best case and worst case scenarios very clearly !
Clear, helpful, and thorough.
thank you very much for this tutorial.
watching it few hours before exams 😂
the best video for Binary Search algorithm
Excellent video! I need this for my test tomorrow! :D
THE BEST EXPLANATION SO FAR THANKS DUDE
Outstanding explanation! Simple and very clear
very good explaination your teaching skills are very good keep making vedios such like that
Very good interpertion. needed for assignment. Thanks from Pakistan.
This was very well explained.
This gold right here. I have a question though why did you add start and end? Why didnt you do n-1/2?? Thanks!
awesome explaination!
Thank you so much! it's pretty laborious to find apt study materials/videos on python.
This is very well explained...!!!!
Do have you learnt python practically in 3 yrs?
awesome content as always! Fan from Bangladesh!
Clear way of explanation.good work.thank you
clear way to see my braaaaaaaaa
thanks mate, it helps a lot for my exam!!
Very well taught.
Thanks for great explanation...
excellent explanation thanks for giving such type of vedios
Very helpful video .... And also it has included the basics at the first
What a beautiful algorithm♥
Great Explanation!
It's mycodeschool..Which is the best choice of understanding algorithm...
12:00 - 12:40 helped explain how binary search is O(log n). Cool stuff, thanks for sharing.
Thank you. Explained very well.
Nice very clear. Best tutorial
Awesome content on this channel.
Video starts at 4:25, before that is super basic information not regarding binary search,
Thanks bro
Thanks man
Bullshit. The beginning emphasizes how the typical method is less efficient. Understanding the reason we use binary search is even more important than knowing how to implement it (because why implement it when you don't have a reason to?)
Superb amazing job Lucid explanation
I Like your speaking style!!
Can u please upload a video on prims, krushkals, job sequencing algorithms.
very very great explanation.
great...great as always
Great explanation thank you
Excellent video, although i'd explicitly label the first search method as linear instead of having "Binary Search" at the top. It could confuse people who are just starting out, or those that just watch the first example.
i swear
Thank you so much for this video!! Amazing job!!!!
very good explanation!!!!
A great one! Kudos!
tqq.. this video is very helpful.. for us
Thanks it is ver much useful to me
Yo dude, thanks for the video. It was really helpful
Well explained, thank you 🌸
Thanks for uploading ✌🏻🔥
Always better to do: mid = start + (end-start) / 2;. To avoid overflow.
But simplifying algebraically we’d get Start + End /2. It’ll be equal anyways mathematically.
@@lustroustub (Start + End)/2 *
start + (end+start)//2
Best one out there
Thanks a lot buddy, You are really awesome.
wow, the tutorial is clearso much awesome. everything described nicely.
This man is a Legend! Legends Never Die! 🤍
Very well explained Binary Search topic..keep up the good work...
gained new subscriber :)
Nicely explained!
i like your explanation
Good explanation 👍👍👌
awsum..i olwz search for ur vidio if i have to understand anything..thankyou
Thank you for the video explanation
very nice presentation ;-) liked to watch
it was really helpful. thanks to you
probably a noob question... but how does binary search works on an unindexed lists? For example, in class I was given the assignment to integrate binary search in an ordered list that we made which only has the attribute 'length'... In the video I noticed you did A[i], which assumes the array or list has an index... what if I wanted to implement binary search into my unindexed list?
good work buddy!!!!keep it up!!!!
Simply awesome
Superb Video
Hey, have u really used recursion in your code? Although, it solves the purpose iteratively too with O(lgn)....
Are your tutorials language inpependent? Thanks for the tutorial btw. :)
Nicely explain, thanks buddy
Nice explanation, thank u so much
Excellent 👌
thankyou sir!!
you are great..☺
Great video
Great way of teaching (Y)
Nice Explanation.
But i do have a question, if i have an array like this
(1,2,3,4,4,5,6,7) and if i'm looking for 4
What i can do here?
Thank you
Muthaiah Palaniappan First one will be displayed
@@manuj9570 First one found* will be returned.
Hi ,
but if the array have duplicates then it should give the output telling positions of indexes , how to make it work for duplicates elements in the array..?
thanx alot ...U R abest one
great tutorial ..thanks
superb sir
Wonderful! Thank you
nicely explained.
thanks.i understood well.nice....
Wow... Thanks, bro
Sir,please teach java aswell ...that would be graet help for me...:)
sir is this same logic used in binary search tree....?
Best🔥
well explained man helpfull
very good, thanks
Middle element middle element middle element......... XD
hahaha you ruined me the video
dhumidelelement