資料結構›Ch7 搜尋與排序
第 31 題/共 76 題
◀ DS 31/76
31. Quicksort、Worst Case
#DS-07-031易QuicksortWorst Case

When CAN the worst case of Quicksort occur? C1C_1: Quick Sort where leftmost (or rightmost) element is always chosen as pivot C2C_2: leftmost element is chosen as pivot and array is already sorted in SAME order C3C_3: leftmost element is chosen as pivot and array is already sorted in REVERSE order

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