Название | : | How Binary Search Makes Computers Much, Much Faster |
Продолжительность | : | 6.51 |
Дата публикации | : | |
Просмотров | : | 1,3 jt |
|
I am, as ever, extremely thankful for animator William Marler for handling all the graphics here! Comment from : Tom Scott |
|
Binary search does NOT make computers faster The computer speed is totally independent of the algorithm You are comparing the speeds of the algorithms Comment from : Roger Haslock |
|
Regarding searching, ok, it is interesting to learn how computers do searching, most have probably seen a computer searching, but, how do our brain seach?brI have seen people i haven't seen in 20 years, and i recognise them instantly, one time i recognised a a classmate from 40 years back in time, also instantly, how many faces have i seen in 40 years? It must have been thousands, how can my brain "search" so incredible fast? Comment from : Don Carlo di Vargas |
|
what the? ok ok Comment from : thinksie |
|
Color sort is not valid Comment from : Sudo__ |
|
There was no need for the virtue signaling! Comment from : sashimiP |
|
absolutely loving all of the references in the book titles at 0:05 Comment from : teho |
|
I'm asking my interns watch this :) Comment from : kainpwnsu |
|
Congrats Tom You are required listening for CS 2 at my school Comment from : Insydian |
|
Funny thing : In my country there is actually a school named Dewey and that's my niece's school Comment from : SlGalaxy |
|
Worth mentioning that binary search is often slower in practice than linear search because the memory accesses are less predictable by the computer hardware Comment from : microcolonel |
|
The combo of a good teacher and a skilled animator makes tutorials excellent ! Thanks to the team Comment from : vinod kc |
|
You're a gift from God, Tom Comment from : MIDAS redblade |
|
getting fired due to complaints about you in 1905 is insane Comment from : Blackilykat |
|
"How bad do you have to be to be kicked out in 1905?" Is literally so funny I had to pause the video Comment from : Galv |
|
Another search is to place the last used item on top, and use linear search Frequently used items are near the top and more readily found, while rarely used items are farther down Comment from : vincent412 l |
|
Takes me back to The University of York… Comment from : Dr Dave |
|
I had a task to quickly search 36 million items and started with a binary search Someone told me that was slow and I should try using a hash lookup It was an order of magnitude faster Comment from : BnORailFan |
|
Lucky no 13 I am scared of 13 Comment from : Raghavendra Kp |
|
Blast N is an algorithm useded by ncbi to search for sequence of dna on the database Comment from : Fernando Pilger |
|
Wait till Tom discovers hashmaps Comment from : Michael Halpern |
|
I javascript letters have numerical weight for them, "a" > "b" is true I was completely confused when I learned about the "sort" method for arrays that operated exclusively on whether it received 1, 0, or -1 I had no idea that here you can do math with letters as if they were numbers Comment from : DANser |
|
I think most of us have figured out that any prominent white people from the past (and at least a plurality if not majority in the present) can be safely assumed to be terrible people Comment from : Display Name |
|
That is true for most applications but there Google search is not the best example for this Comment from : Brogan Josh |
|
"windows makes sure to give you the right answer search answer quickly by using indexing"brExcept windows search since Win 10 is total crap Comment from : Andrews_Lab |
|
thank youuuu a lot, you reminded me the smell s of a library Comment from : kedicat7 |
|
When I took an advanced data structures class in college, I thought I would be learning about how to store databrThe algorithms I learned there for faster data parsing and sorting really opened my eyes Comment from : kilroy987 |
|
A113 Nice touch Comment from : Mike Johnson |
|
Alsodon't over-index your tables The optimization goes away Comment from : BeeRich33 |
|
5:40: modern computers having literally hundreds of gigabytes of space and insanely efficient compression algorithms Comment from : Alyx |
|
2023 Feb 11 Comment from : TD |
|
You know that indexes are important when you forget to create one and your search need 30 minutes instead of 0034 seconds Comment from : Julian Egner |
|
"don't you know the dewey decimal system" conan the librarian Comment from : Ugur Onder Bozkurt |
|
Watched this vid about binary search instead of my lecture Comment from : Charan Nanduri |
|
Oh i love logN Comment from : DasPD |
|
He was a chad :d (!) Comment from : Alper Kaya |
|
I always heard it as "duodecimal" 🤣 Comment from : CerberaOdollam |
|
Tom misspoke a bit Google gives you exactly what Google wants you to have Comment from : John Terpack |
|
just noticed the reverb and it's only slightly bothering me because i can't unhear it Comment from : BGD |
|
I have worked for a few libraries in my time, and I've come to the opinion that even the modern version of the Dewey system needs a serious update Not just what the Melvil Decimal System is proposing, but a heavy reordering of several sections to make them more capable of indexing modern library collections Three examples: brbr1) There is no section for travel guides--they barely existed in Dewey's time, and so they share space with those travel memoirs that haven't been redefined as biographies brbr2) Most religion categories are occupied by specific topics relating to Christianity and its various denominations All the other world religions have to share 290-299 This worked great in the USA in 1905brbr3) If something can possibly be indexed by country, it will be It's no longer strictly European countries that existed in 1905, that's been updated (sort of), but the structure is still there, furthermore, not everything is best indexed by country of origin, and as anyone who's tried to classify World Music will tell you, "country of origin" doesn't always tell you what you need to know, in the modern worldbrbrFinally, I'm grateful to Tom for acknowledging Dewey's disturbing and inappropriate behavior Many librarians are ignorant of this, although that's likely because the story of Dewey's life is essentially irrelevant to a modern librarian Comment from : Vinemaple |
|
0:35 pIxAr bOx Comment from : Super Pokemon Bros |
|
This was so well done Comment from : cschip g |
|
You should do a series on Leetcode Or cracking the coding interview Comment from : Long Range VR |
|
What I live about these videos is that you seem to show the foundations of these which is good because I want to know how the creators came to the solutions and their intentions instead of a already simplified solution by some random guy :) Comment from : Akuma |
|
0:33 A113 Comment from : THE_KRAKEN |
|
O(log(n)) Comment from : AlkhilJohn |
|
A113 Easter egg Comment from : Sidsdabest |
|
Wow is something you would naturally do whenever looking for some word in a dictionary or a page in a book Comment from : ボロ EU |
|
I just noticed the box is called 'Box A113' Comment from : BWD |
|
Even without indexes you can organise everything by Author, colour and title, in only one list, however that just calls for a little bit of arts and crafts A couple buckets of paint is really all you need Comment from : Matthew Bergeron |
|
Video would've been better without the Dewey tangent, completely unnecessary information Comment from : Lukasz Spychaj |
|
Nice reference to Pixar and a113! Comment from : Srijan |
|
the ruling class speaks fondly of your extensive apology Comment from : Maple Leaf |
|
sort f < bookshelf Comment from : Krozar TAL |
|
me, a non binary very interested in computer science Comment from : nyx m |
|
Thank you Comment from : Stephen Brickwood |
|
“Box A113” — didn’t know you were a Cal Arts alum ;-) Comment from : Nicholas Shanks |
|
Hope you're never made into a character on Star Trek 🤣 Comment from : The Sleepy Craftsman |
|
thanks for saving me on my GCSE Computer Science Tom! Comment from : ItsPrettySwell |
|
Well, you can also hash values which is a fast way to find information Comment from : 8-Bit Retro Journal |
|
668 librarians downvoted this Comment from : upthebracket26 |
|
Does the range of numbers "between 1 and 50" start at 1 or 2 and end at 49 or 50? Comment from : @triggertreat |
|
Just had to make a numbering system relationship to social justice Comment from : kitkatcats |
|
I am a bit late to this party What are those antiques you are showing at your side? Are they some kind of a prop? Comment from : Dean Rhodenizer |
|
Years ago I invented these kinds of systems - this in an EXCELLENT primerbrbrJR Comment from : James Ryzlot |
|
Nice nod to room A-113 by your animators :D Comment from : Vodhin |
|
Use The Index, Luke Comment from : Boris Diadus |
|
Google's search result system is simple brIt takes what you are searching for, and buries it after half a dozen paid ads that they shove down our throats Comment from : Clifton Photographer |
|
FINE I'LL INDEX MY DATABASE OKAY Comment from : Amir Iskandar |
|
Mrs Richards: " I paid for a room with a view !" brBasil: (pointing to the lovely view) "That is Torquay, Madam" brMrs Richards: "It's not good enough!" brBasil: "May I ask what you were expecting to see out of a Torquay hotel bedroom window? Sydney Opera House, perhaps? the Hanging Gardens of Babylon? Herds of wildebeest sweeping majestically past?" brMrs Richards: "Don't be silly! I expect to be able to see the sea!" brBasil: "You can see the sea, it's over there between the land and the sky" brMrs Richards: "I'm not satisfied But I shall stay But I expect a reduction" brBasil: "Why?! Because Krakatoa's not erupting at the moment ? Comment from : fred flintstoner |
|
4:09 "non-clustered index" hmm, interesting can someone explain what's the difference in clustered and non-clustered index?? Comment from : Yash |
|
Box A113 a Pixar easter egg? Comment from : Yellow- Harold |
|
What sort of monster doesn't sub organize books by height?! Comment from : LittleBallOfPurr |
|
I am so beyond upset by how many people who came up with such brilliant solutions to problems were just scumbags Comment from : Ashurean |
|
great CS stuff, sadly i dont see the reason to wrap this in woke Marxist ideology Comment from : Jens Pedersen |
|
Dewey was based Comment from : Rykehuss |
|
bwhat is a petabite/b Comment from : Grimmkin |
Binary Search examples | Successful search | Design u0026 Algorithms | Lec-13 | Bhanu Priya РѕС‚ : Education 4u Download Full Episodes | The Most Watched videos of all time |
Binary Search Tree - Search Pseudo Code РѕС‚ : Lalitha Natraj Download Full Episodes | The Most Watched videos of all time |
This Makes Android Games Much Faster РѕС‚ : Hardware Savvy Download Full Episodes | The Most Watched videos of all time |
HOW TO ADD MARTINGALE CREATING BINARY ROBOT, HOW TO MAKE MONEY ONLINE, FREE BINARY BOTS, PROF BEN РѕС‚ : PROF BEN FX Download Full Episodes | The Most Watched videos of all time |
Binary Search Algorithm in 100 Seconds РѕС‚ : Fireship Download Full Episodes | The Most Watched videos of all time |
Binary search in 4 minutes РѕС‚ : Michael Sambol Download Full Episodes | The Most Watched videos of all time |
Introduction to Binary Search (Data Structures u0026 Algorithms #10) РѕС‚ : CS Dojo Download Full Episodes | The Most Watched videos of all time |
Algorithms: Binary Search РѕС‚ : HackerRank Download Full Episodes | The Most Watched videos of all time |
Learn Binary Search in 10 minutes ? РѕС‚ : Bro Code Download Full Episodes | The Most Watched videos of all time |
Learn Binary search trees in 20 minutes ? РѕС‚ : Bro Code Download Full Episodes | The Most Watched videos of all time |