title: Quicksort visualization?
body: <p>I'm fairly new to programming and would like some visual representation of the quicksort algorithm using median-of-three partitioning and a cutoff of 3.</p>
  
  <p>I would like to see the entire iterative process because the Java algorithm is tough to understand for me. </p>
  
  <p>For example, try applying quicksort to this array: [2, 6, 3, 1, 6, 5, 2, 4, 8]</p>
  
  <p>With the median-of-three rule, the pivot is the median of the leftmost, center, and rightmost elements. So the median of 2, 6, and 8 is 6. What now?</p>