資料結構›Ch7 搜尋與排序
第 24 題/共 76 題
◀ DS 24/76
24. Quicksort、Partition
#DS-07-024易QuicksortPartition

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][7, 11, 16, 10, 17, 1, 18, 30]

How many elements could have been the pivot?

📄 台大111
跳轉到第題
▤完整推導請見《WH 資工筆記 · 資料結構》Ch7 搜尋與排序
本章題號 · 21–40 / 76