title: Does partition function gives quick sort its locality of reference?
body: <p>Does partition function gives quick sort its locality of reference ?
  If it does, how ? </p>
  
  <p>I mean what is there in quicksort which gives it locality of reference when compared to other algorithms such as merge sort or heap sort ?</p>
  
  <p>I also read that </p>
  
  <p>"The partitioning step in quicksort typically has excellent locality, since it accesses consecutive array elements near the front and the back".</p>
  
  <p>i did not get it ?</p>