TURN ON TURBO MODE. Choose how the lists are set up and the number of elements, then watch and see! :) Random - Good example, binary search is faster. Sorted Backwards - Perfect example, binary search is much faster. Nearly Sorted - Counter example, binary search is slower.
I realized you could combine binary search with insertion sort, so here's a quick test to show how it works out! Sometimes with nearly sorted, binary search doesn't sort the first few elements... The coding was a bit rushed, so I'll have to look into that.
