Shows for what size of list (k) it becomes efficent to sort with n log n algorithm then search with log n, versus sequential search on unsorted list.