資料結構與演算法(A)

(5 points) Consider an array of 8 elements being sorted using quicksort. It has just finished the first pass of partitioning and pivot swapping, thus changing the original array into the following array:

$[7, 11, 16, 10, 17, 1, 18, 30]$

How many elements could have been the pivot?