Binary Search - CS50 Shorts

preview_player
Показать описание
***

This is CS50, Harvard University's introduction to the intellectual enterprises of computer science and the art of programming.

***

HOW TO SUBSCRIBE

HOW TO TAKE CS50

HOW TO JOIN CS50 COMMUNITIES

HOW TO FOLLOW DAVID J. MALAN

***

CS50 SHOP

***

LICENSE

CC BY-NC-SA 4.0
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International Public License

David J. Malan
Рекомендации по теме
Комментарии
Автор

Perfect. This was well explained and easy to follow.
Thank you Doug ❤︎

omaroats
Автор

Thank you Doug! As always, a very clear explanation, with visuals to help support your points!

troyke
Автор

Probably my favourite algorithm. Any time I know a dataset is sorted, I just want to employ this.

GY-yvcz
Автор

Thanks man helped with my computing test on search and sorts

mandaleswaranthasarathakum
Автор

Thank you for the video :) Sometimes it is hard to find the Middle. In Python 2, all sorts of divisions return an int. In Python 3 we need to use the // operator

codeklaudia
Автор

Great job, Dough! Keep it up. You divided this problem to as simple as possible chunks.

ktswjp
Автор

every time he asked a question, I was like no please don't pick me to answer, I don't know

candicehwt
Автор

Awesome! It was a pretty simple explanation and easy to understand. I enjoyed the way he was explaining in detail and showing it visually! thanks a lot

mohammadkermani
Автор

I wish there were coding examples in these videos :[

TheInvestmentCircle
Автор

I have a question, what if the number of elements in a sub-array were to be an even number instead of an odd number? Do I round it or just take the integer part?

whatever
Автор

I'm still trying to wrap my head @7:33 how does the looping logic turn to "Repeat until the (sub)array is of size 0" based on the upper right hand table in the corner. What does "(sub)array is of size 0" mean anyway?

LoneWolf
Автор

Binary search is much more better than linear search!!!

sithoidinh
Автор

Does it only work with a linear arrays?

deronburton
Автор

odin project ?
lets do it
hare krishna

random-xlzm
Автор

But why doesn't we calculate the sorting time as it is the necessary prerequisite?

swanandpangam
Автор

Would someone elaborate on the Log n part? Why doesnt that log have a base? I get that as long as n increases, so will the lenght of time (in the linear search case) but I dont fully get it..

LUITEN
Автор

Doug Lloyd really looks like Doug Mcquaid lol

krupasankari
Автор

we go to the middle I understand that perfectly but how do we chouse either right or left? cause we dont know where that number .

samuelfey
Автор

Bro said everything except show the code

brendonspears
Автор

Why does he seem to be annoyed at his imaginary student? lol

lowrl