title: Smallest element in a binary heap?
body: <p>Why does finding the smallest event in a binary heap take O(log V) time? (where V is the number of elements)</p>
  
  <p>The Quicksort divide and conquer algorithm takes O(V) time to find the smallest element. Since finding the smallest element in a binary heap is almost identical to Quicksort (both divide the size of the problem by 2 at each step, and the number of problems stay the same) why do they have different times?</p>
  
  <p><strong>Why does finding the smallest element using Quicksort and finding the smallest element in a binary heap take different amounts of time?</strong></p>