Weekly Rust Trivia: How to Implement Binary Search

The binary search function takes in an arrayarr and a desired valuedesired. The function uses generics to constrain the typeT to only those that implement the trait. It then enters a while loop where it continually computes the midpoint of the current range and compares the value at that index to the desired value.