[理工] [資結]-98成大電機

[gn00618777 (123)]

which of the following statement(s) is(are) true

A) Both heap sort and insertion sort are not stable sorting schemes

B) Heapsort can sort n unique numbers into an ascending or descending
   order O(logn)

C) Comparing the performance of rhe worst-case scenario,merge sort is
   better then quick sort

D) The worst case performance of heap sort is better than the average case
   performance of the insertion sort when the number of keys to be sorted is
   sufficient large

E) Radix sort and heap sort have the same space complexity

解答說是CD，我個人覺得是CE，請問大家覺得？若我錯了能否解答D位啥是對的
還有E是錯的 謝謝

--
※ 發信站: 批踢踢實業坊(ptt.cc) 
◆ From: 220.138.105.159
推 tureday:E是錯在heap sort的空間複雜度是O（1）Radix sort有O（n）
→ tureday:和O（n+r）兩種（msd/lsd）
→ taitin:D heap worst O(nlogn)  insert av  O(n^2)
推 tureday:D是heap sort是O(nlogn)，insertion sort是O(n^2)
→ tureday:樓上太快了＝ ＝～
→ taitin:其實我跟你同時推，看到你推E我就不回了XD
→ gn00618777:可是..D選項說是大致排序好的阿..那應該選insertion吧
→ taitin:他是說...要排序的數字夠多吧....
→ gn00618777:= =阿...其實我故意在考考你們的英文
→ tureday:哈哈哈～台大也要考英文唷
推 chenbojyh:台大英文我都沒準備耶  我覺得贏20%的考生感覺很難
→ chenbojyh:我英文超弱的.....
推 abien:弱爆+1
→ gn00618777:那我不是更若..我都還不敢報台大耶..