Description
Deep in the Stem Forest, in the trunk of an old tree lies a library for fairies. Meet Leaf, a plant girl librarian from the Stem Forest. She loves finding books for her fairy friends, but her library is huge. How can Leaf find books without taking days? Learn binary search with Leaf so she can find books in her giant library without getting frustrated.
Children will love the cute fairies, silly book names, and relatable challenges in this picture book, all while learning the importance of sorting and how to look through sorted lists.
Binary search is a very important algorithm in computer science and mathematics. It helps us search through large databases quickly, but is also useful in many algorithms. For instance, a common proof of the intermediate value theorem in calculus uses a variation of binary search. It can be used to calculate square roots, logarithms, exponentials, and many other functions. It is an extremely generic and useful tool.
Reviews
There are no reviews yet.