教甄◆資訊科技概論專業(電腦科)題庫 下載題庫

46. Regarding HEAPSORT, which of the following statements is WRONG？
(A)The worst execution time of HEAPSORT is Ω(n² )
(B)The same as the previous item, but it is changed to sort in descending order first, then use HEAPSORT to sort the array and its execution time is Θ(nlogn)
(C)There is an array of length n, which has been sorted in ascending order. When using HEAPSORT to sort this array, the execution time is Θ(nlogn)
(D)When the elements in the array are not the same, the best execution time of HEAPSORT is Ω(nlogn)

教甄◆資訊科技概論專業(電腦科)- 111 年 - 111 臺北市市立國民中學正式教師聯合甄選試題：資訊科技科(雙語)#108096

答案：登入後觀看
難度： 困難

討論
私人筆記( 0 )

【站僕】摩檸Morning：有沒有達人來解釋一下?

倒數 1天 ,已有 0 則答案

全部討論

回報試題錯誤收錄

你可以購買他人私人筆記。