Man I really wish you would bring this series back for other algo techniques, you are my fav python instructor on YT

Thanks a lot for this videos man, they are so simple, but they explain everything in perfect detail

You explained this like I'm 5 years old and thank you bc it makes perfect sense now 😭🙌🏾

You are amazing! I just started my Data Structures and Algorithms course, and I almost had a heart attack as we covered both linear and binary search algorithms and now have to do math problem for the quiz. Both (0)logn and theta problems. But the most important thing is to understand the logic and what the code is doing. You're doing an awesome job at explaining this!! Thank you.

Thanks alot man for the tutorial very well explained you deserve more subs

Thank you for your videos. I came across your algorithm series this morning and spent the day watching all 5 videos and learning from your examples. Now I can use them to make my own Python library of tips & tricks to use when I program. Keep up the good work!

Thanks for the tutorials Derrick they are so easy to understand and well explained. I’m self learning Java and Python for the past three months and your videos are very helpful. Good Teacher.

and also for midpint can be (start + end )//2

I'm cramming for my first face-to-face technical interview in 2 weeks and I have to say that I wish I found your channel sooner. Thank you for your effort in making these videos.

Thank you very much for this amazing video. I've been searching everywhere for this but there are too complex. But this one is...Schway!!😀

You are sooooo young and smart. I feel so inadequate in regard to thinking capacity 😭. But your videos are amazing, please don’t stop!

Excellent tutorial. Love the algorithm explanation at the end to re-iterate our understanding.

You are doing a great job man. The videos are short, well explained and very easy to understand. Please keep posting.

Thanks a lot for this videos man

Really loved this. Simple and precise. Thanks

When I studying this using the below list : sequence_a = [1,2,4,5,6,7,8,9,12,14,16,17,22] list_a = 1 it will return 0 as sequence, which looks a bit strange to me...so I add +1 to it, haha print(binary_search(sequence_a, list_a)+1) Btw, it's a good video! Thanks for teaching me!

Hey Derrick , this is the first time I came across your video and it is so articulate and lucid . I am already subscribing and looking forward to learn more from you .

For beginners like me, make sure that the while loop has a

Thanks a lot for the series!! I watch it all

Binary Search Implementation (I tried before seeing your approach): def binary_search(seq, val): print(f"Base Array: {seq}") seq.sort() print(f"Sorted array: {seq}") midpoint = len(seq)//2 while seq[midpoint] != val: if val > seq[midpoint]: midpoint = midpoint + len(seq[midpoint+1:])//2 elif val < seq[midpoint]: midpoint = len(seq[:midpoint]) return f"value is at {midpoint} index in {seq}"

For anyone wondering. This is a recursive solution. a = [1,2,3,4,5,6] def binarySearch(value, low, high, list): if low value: return binarySearch(value, low, middle-1, list) #here we need to check the upper half as the value is bigger than midpoint elif list[middle] < value: return binarySearch(value,middle+1, high, list) else: return f"Value {value} is not in the list!" print(binarySearch(6, 0, len(a),a))

Beautiful videos you angel, so clear and simple.Thank you!!!

keep uploading ...Nicely,Thoroughly explained...

Thanks amazing it was! Please upload video on linear search also!

Super clear explanation! Thank you so much.

This solution is better than lead code selection

Why we should use the formula midpoint= (start+end-start)/2 instead of (start +end)/2 ?

I think this code is a little simpler: key=a #the_number_you_are_searching first=0 last=len(L)-1 pos=-1 #the_position_of_the_number while first

Absolute clutch, as a comp sci student, you explained better than the teacher (no offence to teacher lol)

i do node.js and php but u made it clear for as weel thanx

Great video and explanation!

Cannot tell if he is smiling or being held at gun point with those facial expressions lol. At times he seems forced other times he generally seems interested.

Thanks man! excellent explanation, greetings from Argentina

Great vid! tysm!

Thank you !

Thank you so much. Huge help. Subscribed

very useful brother. thanks a lot.

gracefully done!

great videos man!

thanks, really help me out!

Awesome, Thank you!

thanks man this video helps alot

Thanks a lot. Very great explanation.

The program as is returns None every time unless you purposely choose a midpoint equal to the value you're searching for

Thanks, this is helpful.

Your algorithm is not quite right. if sequence_a = [2, 4, 5, 6, 9, 9, 9, 10, 12, 13, 14] and item_a = 9 it will return index 5. It is generally accepted that binary search should find the first occurrence, which is 4. Can you correct this problem?

Thank you!!

Thank you :)

wowww, super!!

thank you

you should cast as jack frost. ♥

Great video

Bro pls post more videos on this datas and the algorithms pls ........................ 🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏

2:52 hahaha bruh that glitch in your face, sorry but I can't help but laugh but laugh it off. Btw really good video, it helped me a lot ;)

why the midpoint is begin_index + ? why just second part ( end -begin)//2 only?

Amazing!!!

TY BRO

Is there going to be any more videos on algorithms? Great work!

please do a video on data structures and linked list too

Perfect!

Awesome

hello Derrick, I have a question. What if in the sorted list there is a duplicated number/ numbers? Thanks a lot! :)

Who else feels embarrassed? 🤣🤣 Note: Really thank you for this content. It helped me a lot.

Derrick ,I just completed a python course ,however it is a basic one i am still finding myself rigid while coding how do they I can develop myself to a level where i can write codes smoothly?? Thanks

I can't figure out how to use binary search and user input. I want to use binary search to look at a list of names the user typed in , ask the user for a name to search and display if the name was there or not. I doubt you'll see this but I thought I would put it out there. Can anyone help me?

Hey Derrick. Really enjoy your videos and I think is brilliant the animations you are now adding to the beginning of your videos to explain the theory. I'm trying to create a complexity matrix to determine how complex a project is based on user's input. Was thinking on using radio buttons or something similar for the user to select the input and then generate the result based on the selections. Any ideas on how best to accomplish this (it would need to be a web app)? I am new to Python. Do you think Django would work?

can you do merge sort video

Thumbs up!

def search(list,target): for item in list: if list[item]==target: print(i) list=[4,3,6,8,7,9] target=7 search(list,target) 4 #print the index where item belongs

Is it wrong if I find the mid_point like: midpoint = (begin_index + end_index) // 2

Please upload the vedios for Merge sort, shell sort & heap sort as well.🥺❤️

what do you actually mean by complexity? is it the time required for the p;rogram to run? if we use quick sort could you please how much time will the program take

which ide is used in this video

program code not working properly.IS the code wrong guys ?

im confused by the 7th line. Isnt beginning index always going to equal the same so then it would just cancel out? How could beginning index be 2 different values in the same line?

i noticed a issue if you pass [1, 2, 3, 4, 5] as the sequence the while loop goes infinity

neat!

Thanks very good Explanation. Why not put middle = (begin + end)//2 ? Looks simpler. :)

It's something I was using by 1981 (When I started with CP/M and PDP11 and VAX sistems). What You are showing it'a the startig procedure of a binary search. What about duplicates? It was already used in 1957 (Peterson, William Wesley (1957). "Addressing for random-access storage". IBM Journal of Research and Development.). Finally, I think U studied well. Pls Read also "Moore School Lectures" from the University of Pennsylvania's Moore School It's an old 1946 Compendium. Here is the link en.wikipedia.org/wiki/Moore_School_Lectures

nrb approves

Hey for line 7 why can't it just be begin+end//2

wut if you have an even amount of items

How do you perform 1 through 300

my number is off by one position what should i do?

👍

midpoint = (begin_index + end_index)//2

Umm, why am I getting TLE's? Time limit expired errors. :)

excuse me, why should "begin" and "end" be assigned to "mid +1" and "mid-1" ? istead of just "mid"

I love you

Thank you so much Derrick, I've been rewatching the playlist almost daily. I have a question: I've tested this on an unsorted list and it did find the index of the element I'm searching for, does this mean that this can work on an unsorted list as well? Many thanks!

I don't get what is the point of this? Why not just return the index of the target number? Wouldn't it be the same either way? This just seems like an overly complicated way to do that. Not bashing you or anything but I just don't see the point of all this extra code

Is the code same for visual code for python on windows

Hey Derrick Sherrill, your video is amazing. But I would request you to please don't speak so fast during the animation or during the explanation.

not working in pycharm. Help me!!

Make video on merge sort...... Really need it.....

I've tested all of the sites for free points and only GameCrook works.

What does it feel like to be born with plastic surgery?

If I told you that I am lying to you right now, would I be saying the truth?

#tafelpoten die de winkel kottenphark in de schappen heeft Tafelpoten = [30, 50, 70, 80, 85, 90, 100, 120, 150] Tafelpoten.sort() MaatVanKlant = int(input("Welkom bij meubelwinkel khottenphark, wij verkopen hier verschillende maten tafelpoten, wat is de maat tafelpoot die u graag wilt?")) #zorgt ervoor dat er binair gezocht wordt def binair_zoeken(lijst, maat): links = 0 rechts = len(lijst) - 1 while links 0: dichtstbijzijnde_maten.append(Tafelpoten[index-1]) if index < len(Tafelpoten): dichtstbijzijnde_maten.append(Tafelpoten[index]) if len(dichtstbijzijnde_maten) > 1: print(f"helaas is de maat {MaatVanKlant}cm niet beschikbaar. daarentegen zijn de maten {dichtstbijzijnde_maten} wel vergelijkbaar met de maat die u gekozen heeft") elif len(dichtstbijzijnde_maten) == 1: print(f"helaas is de maat {MaatVanKlant}cm niet beschikbaar. daarentegen zijn de maten {dichtstbijzijnde_maten[0]} wel vergelijkbaar met de maat die u gekozen heeft") else: print(f"helaas is de maat {MaatVanKlant}cm niet beschikbaar.")