title: What Is Quicker: Using Quicksort then Binary Search OR Just Linear Search?
body: <p>If I had an array of integers with 1000 elements, what would be the fastest way to find a specific element's index? Would it be best to first QuickSort it and then use BinarySearch or just to use plain old LinearSearch?</p>
  
  <p>Also, would the fastest method be different if I had 100 000 elements or even just 100 elements?</p>
  
  <p>Thanks!</p>