search and sort

See inside

n creates a random list (A) of size 100, and makes a sorted version (B).
a searches list A for the last element in the list via linear search.
b searches list B for the same element via binary search.

Check out how much faster binary search is!

Click the cat for instructions.

Notes and Credits

Shared: 14 Feb 2015 Modified: 14 Feb 2015
Favorite this project 0
Love this project 0
Total views 22
View the remix tree  1
More projects by cs8brown