發表新討論
#5722: 排序法的速度


stanley17112000 (Stanley)

d550. 物件排序 | From: [203.70.88.138] | 發表日期: 2011-08-27 21:27

我發現了重大的秘密!!!!

這題用合併排序法比快速排序法快!!!!  ><

#6253: Re:排序法的速度


J99 (J)

d550. 物件排序 | From: [218.168.30.244] | 發表日期: 2012-01-24 19:17

我發現了重大的秘密!!!!

這題用合併排序法比快速排序法快!!!!  ><


It is because qsort has poor time complexity O(n2) for partially sorted data.
But using merge sort for  partially sorted data has best time complexity O(n).
#6255: Re:排序法的速度


david942j (文旋)

d550. 物件排序 | From: [182.235.181.182] | 發表日期: 2012-01-26 18:23

我發現了重大的秘密!!!!

這題用合併排序法比快速排序法快!!!!  ><


It is because qsort has poor time complexity O(n2) for partially sorted data.
But using merge sort for  partially sorted data has best time complexity O(n).

樓上..mergesort's complexity is always O(nlgn) no matter what data is ...
#26636: Re:排序法的速度


s1082951 (Amadeus)

d550. 物件排序 | From: [1.200.252.140] | 發表日期: 2021-08-17 21:56

我發現了重大的秘密!!!!

這題用合併排序法比快速排序法快!!!!  ><


It is because qsort has poor time complexity O(n2) for partially sorted data.
But using merge sort for  partially sorted data has best time complexity O(n).


.排序法最低只能到 nlogn吧

ZeroJudge Forum