The binary search algorithm can be coded recursively or non-recursively. Here are some arguments for each method.

A non-recursive version requires less memory and fewer steps by avoiding the overhead of making recursive calls.

However, the recursive version is somewhat easier to understand and code and is more fun! The lab assignment can be coded as either a recursive or non-recursive version of binary search.