[問題] 資結-排序

看板Grad-ProbAsk作者 (Terry)時間15年前 (2009/04/16 23:37), 編輯推噓2(2推 0噓 7→)
留言9則, 4人參與, 最新討論串1/1
Given a list of n elements and assuming n is larger than 100 compare the performance of the following sorting algorithms a).. b).. c) quick sort d).. (Hint:list them in ascending or descending order) 請教一下 c)是n^2嗎?? 可是書上是寫nlogn..是書寫錯了嗎? 謝謝 -- ※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 61.228.103.55
→
04/17 00:01, , 1F
應該是寫錯了
04/17 00:01, 1F
推
04/17 00:18, , 2F
quick sort 要算 n^2 嗎 = =?
04/17 00:18, 2F
→
04/17 00:18, , 3F
hint的意思是把a,b,c,d以遞增或遞減排列
04/17 00:18, 3F
→
04/17 00:19, , 4F
quick sort的average case 是n logn沒錯吧
04/17 00:19, 4F
→
04/17 00:33, , 5F
可是遞增、遞減不是會造成最差情況嗎?
04/17 00:33, 5F
→
04/17 00:45, , 6F
他是說或 所以是worst case吧 怎麼會是average case
04/17 00:45, 6F
推
04/17 01:40, , 7F
你誤解了 提議是說把a b c d 依遞增遞減排序
04/17 01:40, 7F
→
04/17 01:40, , 8F
不是說陣列一開始的排列情形
04/17 01:40, 8F
→
04/17 01:48, , 9F
原來是這樣，謝謝
04/17 01:48, 9F
‣ 更多 bernachom 的文章
文章代碼(AID): #19vr2S4f (Grad-ProbAsk)