Binary Search Animated

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.

[@fateriddle14]

I hope people support these type of videos, instead of those IT drama shows.

[@Eckster]

Agreed, good content right here

[@dboydomr]

What is an It drama show?

[@XDarkGreyX]

Uhm... and if people enjoy those? Also, they can enjoy both types....

[@muhammadnaqi4242]

The quality of the animation of this video is really really impressing.

[@dreamsofcode]

Thank you!

[@paddingbox9845]

@@dreamsofcode nice work

[@SecretX1]

@@dreamsofcode How do you create these animations? That could be the topic of a future video. Keep the good work!

[@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.

[@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]

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]

"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]

Elegant as always! Also, nice play there with the git dates and commit messages!

[@nessitro]

I'll share this one with my friends, very informative!

[@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. ❤️

[@conaticus]

Amazing video as always! If only everybody taught this efficiently on KZbin 😄

[@joshi1q2w3e]

Please make more of these! This was amazing!

[@dreamsofcode]

I will do!

[@phpsoftwareengineering]

Such a great video! Thanks!

[@dreamsofcode]

Thank you! I'm glad you enjoyed it

[@GabrielFury-mg8du]

I love your appreciation of Lost

[@dreamsofcode]

My go to set of numbers! I'm glad you noticed haha

[@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]

Thank you! I appreciate that a lot!

[@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]

Thank you so much! I'm really glad people enjoy it! Was a complete labor of love :)

[@__________________________6910]

Thanks 🙏

[@robin-lol]

Nice little XZ reference you snuck in 🤭

[@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]

Awesom!

[@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! :)

[@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 KZbin channel?

[@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]

@@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!!

[@jaddadzakaria]

Hey, i just want to know with what tool do you make this smooth and beautiful presentations and thanks guys

[@dreamsofcode]

This was done pretty much exclusively with Adobe After Effects for the animations, and Davinci Resolve for the final editing!

[@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]

I wish I had this video back in my first Uni semester 😭

[@dr_regularlove]

Would love a video going into the differences between binary trees and B-trees.

[@dreamsofcode]

Absolutely! I'll add that to my backlog 😁

[@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]

@@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]

awesome video

[@uomolercio1992]

Can you do quicksort and mergesort?

[@dreamsofcode]

I absolutely can!

[@Aveniix.]

Can you do a neovim setup for c#? Thanks

[@anthonyraf]

In french we call it "recherche dichotomique". But the array needs to be sorted first.

[@ericlindell3777]

Great vid!

[@dreamsofcode]

Thank you!

[@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]

I did not! I resorted to macOS 😭 My next plan is to use windows in a VM with pcie passthrough

[@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]

@@lemonadeforlife I'm on a provisional probation with it!

[@shuaibkhan7775]

Hoping for B-tree ds in the next video

[@greasedweasel8087]

5:54 the only thing better than the Lost reference is the rest of the video

[@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.

[@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]

new CS playlist loading?

[@dreamsofcode]

You've found me out! 😄

[@paddingbox9845]

@@dreamsofcode I can't wait!!

[@Redyf]

hello everynyan

[@yugalkhanal6967]

first

[@goporororo7404]

I was first

[@Simple_OG]

code aesthetic, dreams of code similar logo similar video style so much confusion

[@goporororo7404]

1 min no views

[@goporororo7404]

Bro fell off

[@goporororo7404]

Bro fell off

[@jatinjoshi9897]

0 minutes ago is crazy!

[@ththththththththth]

4 8 15 16 23 42