Search

Binary search

Categories:  Search   Inefficient  

Splits sorted data set in half until target is (not) found

Try it out!

Binary tree search

Categories:  Search   Efficient  

Binary tree traversal to retrieve node. Goes left or right at each node to reach its target

Try it out!

Linear search

Categories:  Search   Inefficient  

Goes over the whole array, index by index, looking for the target value

Try it out!