Тёмный

Binary Search Animated 

Dreams of Code
Подписаться 124 тыс.
Просмотров 25 тыс.
50% 1

Binary search is a simple yet elegant algorithm for searching for values in a data structure such as an array.
Despite this simplicity, however, Binary Search also happens to be incredibly important, due to the efficiency it provides. This efficiency enables searches to take place on millions of items in orders of magnitude less time.
This video seeks to show what Binary Search is, through animation and motion.
This video was made possible by the wonderful supporters of this channel.

Наука

Опубликовано:

 

30 июн 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 75   
@fateriddle14
@fateriddle14 Месяц назад
I hope people support these type of videos, instead of those IT drama shows.
@Eckster
@Eckster Месяц назад
Agreed, good content right here
@dboydomr
@dboydomr Месяц назад
What is an It drama show?
@XDarkGreyX
@XDarkGreyX Месяц назад
Uhm... and if people enjoy those? Also, they can enjoy both types....
@muhammadnaqi4242
@muhammadnaqi4242 Месяц назад
The quality of the animation of this video is really really impressing.
@dreamsofcode
@dreamsofcode Месяц назад
Thank you!
@paddingbox9845
@paddingbox9845 Месяц назад
@@dreamsofcode nice work
@SecretX1
@SecretX1 Месяц назад
@@dreamsofcode How do you create these animations? That could be the topic of a future video. Keep the good work!
@dreamsofcode
@dreamsofcode Месяц назад
​@@SecretX1 Pretty much all of this was done using Adobe Illustrator and After Effects! I def had to learn a lot. Absolutely would love to do a video on it! There's also some code with after effects expressions.
@gutohertzog
@gutohertzog 26 дней назад
I am a Python teacher at night as my second work and passion. I will show your video to my class and implement with them the Binary Search. Awesome video.
@robertwhite3503
@robertwhite3503 Месяц назад
Most arrays are small. A linear scan is fine for small arrays. Larger amounts of data are typically stored in databases which do not used arrays (generally) and are generally based on B-tree as mentioned in the video. B-tree is quite different from binary trees in concept.
@no-tomorrow7425
@no-tomorrow7425 Месяц назад
Yeah, I agree with this point. For large amounts of data one usually just uses the search functionality offered by databases... no need to implement search from scratch (unless one works for a database company :) )
@angeldude101
@angeldude101 Месяц назад
"B-tree is quite different from binary trees in concept." What do you mean? Is a binary tree not simply a B-tree where the minimum and maximum number of child nodes are 0 and 2 respectively? Yes, binary trees are often balanced, but they don't strictly have to be, and B-trees are usually balanced too, though in a slightly different manner.
@avishjha4030
@avishjha4030 Месяц назад
Elegant as always! Also, nice play there with the git dates and commit messages!
@nessitro
@nessitro Месяц назад
I'll share this one with my friends, very informative!
@bibekjha5628
@bibekjha5628 Месяц назад
Loved the video and the animation just great hope to see more of this kind of video may be one on breadth first search. ❤️
@privatename1250
@privatename1250 Месяц назад
Absolutely fantastic explanation
@phpsoftwareengineering
@phpsoftwareengineering Месяц назад
Such a great video! Thanks!
@dreamsofcode
@dreamsofcode Месяц назад
Thank you! I'm glad you enjoyed it
@conaticus
@conaticus Месяц назад
Amazing video as always! If only everybody taught this efficiently on RU-vid 😄
@doryan08
@doryan08 Месяц назад
Please do more videos about other algorithms and their application on real life like Dijkstra or A*. The animation that you use is very useful to understand those.
@kurshadqaya1684
@kurshadqaya1684 Месяц назад
Awesom!
@joshi1q2w3e
@joshi1q2w3e Месяц назад
Please make more of these! This was amazing!
@dreamsofcode
@dreamsofcode Месяц назад
I will do!
@Kosin-zs9il
@Kosin-zs9il 6 дней назад
This is a very intuitive approach when you work with sorted arrays, the reality is just that you rarely work with sorted arrays and sorting the array to then use a binary search is a pretty bad approach as well.
@momensy2136
@momensy2136 Месяц назад
I really feel so lucky that i found your channels Please keep up on the content, can't wait to see your channel grows well and get what it deserves ❤🔥.
@dreamsofcode
@dreamsofcode Месяц назад
Thank you! I appreciate that a lot!
@GabrielFury-mg8du
@GabrielFury-mg8du Месяц назад
I love your appreciation of Lost
@dreamsofcode
@dreamsofcode Месяц назад
My go to set of numbers! I'm glad you noticed haha
@robin-lol
@robin-lol Месяц назад
Nice little XZ reference you snuck in 🤭
@__________________________6910
@__________________________6910 Месяц назад
Thanks 🙏
@luigidabro
@luigidabro Месяц назад
This video is the greatest example of explanation. You even care for edge cases of the algorithm. I love that detail at 2:01. The animations are great, too! This video is truly a masterpiece.
@dreamsofcode
@dreamsofcode Месяц назад
Thank you so much! I'm really glad people enjoy it! Was a complete labor of love :)
@Amgk69
@Amgk69 19 дней назад
I subscribed cause i loveeed ur video :)
@jaddadzakaria
@jaddadzakaria Месяц назад
Hey, i just want to know with what tool do you make this smooth and beautiful presentations and thanks guys
@dreamsofcode
@dreamsofcode Месяц назад
This was done pretty much exclusively with Adobe After Effects for the animations, and Davinci Resolve for the final editing!
@ericlindell3777
@ericlindell3777 Месяц назад
Great vid!
@dreamsofcode
@dreamsofcode Месяц назад
Thank you!
@paddingbox9845
@paddingbox9845 Месяц назад
I really enjoyed it, especially the awesome animations. question: If I want to learn data structures and algorithms, where should I begin? Can you recommend a RU-vid channel?
@dreamsofcode
@dreamsofcode Месяц назад
I haven't found many channels with DSA content personally but I'm sure there are some out there! It'll take me a while to build out my DSA collection. I personally learnt from some great books! I heard that Grokking algorithms is a good one as well which I plan on reading soon
@paddingbox9845
@paddingbox9845 Месяц назад
@@dreamsofcode yes! there are plenty out there. I found Neso Academy interesting. I also checked out the book you suggested. btw I love your content and nvim setup. I look forward to more!!
@berndeckenfels
@berndeckenfels Месяц назад
Unlike b- or binary trees a sorted array has zero (pointer) overhead, so it’s great when it can be pre-calculated and is static.
@a1mer06
@a1mer06 Месяц назад
I wish I had this video back in my first Uni semester 😭
@dr_regularlove
@dr_regularlove Месяц назад
Would love a video going into the differences between binary trees and B-trees.
@dreamsofcode
@dreamsofcode Месяц назад
Absolutely! I'll add that to my backlog 😁
@angeldude101
@angeldude101 Месяц назад
A binary search splits the remaining nodes into two at each node. Similarly, you can make a "ternary search", where you check 2 roughly evenly spaced nodes to determine which of 3 sectioning the desired node is in. A B-tree is ultimately a "variable-ary search tree", where the number of immediate children of a given node isn't a fixed 2 or 3, but can vary depending on the situation, such as based on how many nodes will fit within a pre-decided maximum size when the nodes themselves might not necessarily have a constant size (though they should be the same within a given node to enable random access). Often, finding which child node has a desired value is done with a linear search of the values in the current node.
@dr_regularlove
@dr_regularlove Месяц назад
@@angeldude101 Thanks for that, yeah I can see how this would lend itself well to use cases such as DB indexing, especially with tunable parameters like that pre-decided maximum size with variably sized nodes like you mentioned. Still would love to see a Dreams of Code style video going into it with the minimalist visual aids that imo can go a long way in terms of really impressing a concept into the brain.
@frd85
@frd85 Месяц назад
awesome video
@anthonyraf
@anthonyraf Месяц назад
In french we call it "recherche dichotomique". But the array needs to be sorted first.
@uomolercio1992
@uomolercio1992 Месяц назад
Can you do quicksort and mergesort?
@dreamsofcode
@dreamsofcode Месяц назад
I absolutely can!
@bastiana3611
@bastiana3611 Месяц назад
I really enjoy it when you give examples of when stuff is used like how you compared when to use linear search vs binary search here. I'd love to see more of that! :)
@Aveniix.
@Aveniix. Месяц назад
Can you do a neovim setup for c#? Thanks
@shuaibkhan7775
@shuaibkhan7775 Месяц назад
Hoping for B-tree ds in the next video
@obiwanjacobi
@obiwanjacobi Месяц назад
Note that CPUs with cache lines and prefetching (like x86), linear search until a couple of MB is the fastest you can get. It is easy to do the benchmarks yourself.
@greasedweasel8087
@greasedweasel8087 Месяц назад
5:54 the only thing better than the Lost reference is the rest of the video
@lemonadeforlife
@lemonadeforlife Месяц назад
Nice Animation but as a Linux User. I have one question, in fact it's just a simple question. Did you resort to windows for producing this animation?(y/n)
@dreamsofcode
@dreamsofcode Месяц назад
I did not! I resorted to macOS 😭 My next plan is to use windows in a VM with pcie passthrough
@lemonadeforlife
@lemonadeforlife Месяц назад
@@dreamsofcode After careful consideration and many decisions later, we came to the conclusion that since it's not a Window. And macOS is UNIX based. Congratulations🎉! Your "I use arch btw" license is not going to terminate. Have a good day🐧
@dreamsofcode
@dreamsofcode Месяц назад
@@lemonadeforlife I'm on a provisional probation with it!
@angeldude101
@angeldude101 Месяц назад
One of the reasons to prefer linear search over binary search is the cache, since reading one value will make the CPU implicitly fetch the values around it, and if you can use those rather than discarding all of them and jumping away, then the fewer data transfers can actually trump the fewer operations of the binary search. However it is actually possible to get the best of both worlds, with fewer comparisons while still respecting the cache. It just requires an unusual form of sorting. The structure is similar to an array-backed heap, but the order of the nodes is that of a traditional binary search tree. This type of structure was first described by Michaël Eytzinger in 1590 for efficiently searching through genealogical data and a person's ancestry... on paper.
@fahimferdous1641
@fahimferdous1641 Месяц назад
new CS playlist loading?
@dreamsofcode
@dreamsofcode Месяц назад
You've found me out! 😄
@paddingbox9845
@paddingbox9845 Месяц назад
@@dreamsofcode I can't wait!!
@Redyf
@Redyf Месяц назад
hello everynyan
@yugalkhanal6967
@yugalkhanal6967 Месяц назад
first
@goporororo7404
@goporororo7404 Месяц назад
I was first
@Simple_OG
@Simple_OG Месяц назад
code aesthetic, dreams of code similar logo similar video style so much confusion
@goporororo7404
@goporororo7404 Месяц назад
1 min no views
@goporororo7404
@goporororo7404 Месяц назад
Bro fell off
@goporororo7404
@goporororo7404 Месяц назад
Bro fell off
@jatinjoshi9897
@jatinjoshi9897 Месяц назад
0 minutes ago is crazy!
@shogun8-9
@shogun8-9 Месяц назад
4 8 15 16 23 42
Далее
Binary Search Algorithm - Computerphile
18:34
Просмотров 156 тыс.
Едим ЕДУ на ЗАПРАВКАХ 24 Часа !
28:51
Клип Уже На Канале #янгер #shorts
00:15
Using docker in unusual ways
12:58
Просмотров 409 тыс.
5 Good Python Habits
17:35
Просмотров 401 тыс.
Tmux has forever changed the way I write code.
13:30
Просмотров 919 тыс.
Never write another loop again (maybe)
10:48
Просмотров 249 тыс.
How Binary Search Makes Computers Much, Much Faster
6:51
The Algorithm Behind Spell Checkers
13:02
Просмотров 406 тыс.
This is Why Programming Is Hard For you
10:48
Просмотров 658 тыс.
The purest coding style, where bugs are near impossible
10:25
God-Tier Developer Roadmap
16:42
Просмотров 6 млн
10 Sorting Algorithms Easily Explained
10:48
Просмотров 35 тыс.