Does partition function gives quick sort its locality of reference ?

Does partition function gives quick sort its locality of reference ? If it does, how ?

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 ?

I also read that

“The partitioning step in quicksort typically has excellent locality, since it accesses consecutive array elements near the front and the back”.

i did not get it ?

//