tag:blogger.com,1999:blog-4949960181628888221.post1273125334238030932..comments2022-04-09T19:46:43.609+08:00Comments on Infinite Loop: 【演算】合併排序法 - MergesortAnonymoushttp://www.blogger.com/profile/17636157464310241832noreply@blogger.comBlogger12125tag:blogger.com,1999:blog-4949960181628888221.post-68012238214466821562016-05-11T22:35:43.673+08:002016-05-11T22:35:43.673+08:00https://c2.staticflickr.com/8/7186/26884313321_911...https://c2.staticflickr.com/8/7186/26884313321_91116fd0cc_o.png<br />這是我實際跑出來的情形, 看起來應該是沒有寫錯<br />Anonymoushttps://www.blogger.com/profile/05738547756001890544noreply@blogger.comtag:blogger.com,1999:blog-4949960181628888221.post-86734217566245231772016-05-11T21:47:33.081+08:002016-05-11T21:47:33.081+08:00非遞迴的虛擬碼, 在陣列中有奇數個數的時候似乎會有問題
不過我不肯定是不是我自己有錯, 我是用C++...非遞迴的虛擬碼, 在陣列中有奇數個數的時候似乎會有問題<br />不過我不肯定是不是我自己有錯, 我是用C++寫的, 因此index是改由0開始Anonymoushttps://www.blogger.com/profile/05738547756001890544noreply@blogger.comtag:blogger.com,1999:blog-4949960181628888221.post-16065985408150964972014-03-22T18:41:44.957+08:002014-03-22T18:41:44.957+08:00請問step是什麼意思請問step是什麼意思Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-4949960181628888221.post-52631132706246943662014-02-14T16:22:59.334+08:002014-02-14T16:22:59.334+08:00謝謝大大分享謝謝大大分享Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-4949960181628888221.post-32508698117508005772013-09-28T17:27:19.865+08:002013-09-28T17:27:19.865+08:00大大 請問跑出來可以跑嗎????怎麼會出現bug大大 請問跑出來可以跑嗎????怎麼會出現bugAnonymoushttps://www.blogger.com/profile/02119352293603763112noreply@blogger.comtag:blogger.com,1999:blog-4949960181628888221.post-10685408293842680172010-04-10T16:29:28.155+08:002010-04-10T16:29:28.155+08:00你好
不好意思, 這麼久才回覆
非遞迴的 mergesort 版本我已經更新在文章上了:)你好<br />不好意思, 這麼久才回覆<br />非遞迴的 mergesort 版本我已經更新在文章上了:)Anonymoushttps://www.blogger.com/profile/17636157464310241832noreply@blogger.comtag:blogger.com,1999:blog-4949960181628888221.post-46438969175884146202010-04-07T17:59:30.198+08:002010-04-07T17:59:30.198+08:00樓上是台科大鮑興國教授演算法課的學生吧?樓上是台科大鮑興國教授演算法課的學生吧?Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-4949960181628888221.post-15371232943205979042010-04-05T16:32:51.281+08:002010-04-05T16:32:51.281+08:00請問
如果不用遞迴的方式做的話
該如何執行merge?請問<br />如果不用遞迴的方式做的話<br />該如何執行merge?Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-4949960181628888221.post-79391816662767944392009-11-04T18:42:06.388+08:002009-11-04T18:42:06.388+08:00OK, thanks you :)OK, thanks you :)Anonymoushttps://www.blogger.com/profile/17636157464310241832noreply@blogger.comtag:blogger.com,1999:blog-4949960181628888221.post-47292928194491720382009-11-04T17:01:30.333+08:002009-11-04T17:01:30.333+08:00This code is incorrect.
In the function "mer...This code is incorrect.<br /><br />In the function "merge()", <br /><br />you should put<br />while (i < x && j < y)<br />instead of <br />while (i <= x && j <= y)<br /><br />and same with othersAnonymousnoreply@blogger.comtag:blogger.com,1999:blog-4949960181628888221.post-65734526146688784222009-04-15T10:34:00.000+08:002009-04-15T10:34:00.000+08:00是的,您說的沒錯。
原始資料中,前端的資料會被分進 left[], 而後端的資料會被分進 righ...是的,您說的沒錯。<br /><br />原始資料中,前端的資料會被分進 left[], 而後端的資料會被分進 right[]。<br />所以,在 left[i] = right[j] 的情況下,應該要將 left[i] 放在 right[j] 的前端。<br />如此,才能達到不破壞等值紀錄原始相對順序的 stable 特性。<br /><br />感謝您的補充。Anonymoushttps://www.blogger.com/profile/17636157464310241832noreply@blogger.comtag:blogger.com,1999:blog-4949960181628888221.post-60194857081897265432009-04-15T02:40:00.000+08:002009-04-15T02:40:00.000+08:00您好,想請問在 merge () 這涵式中
if (left[i] < right[j])...您好,想請問在 merge () 這涵式中<br /><br /> if (left[i] < right[j])<br />是否要改成 <br /> if (left[i] <= right[j])<br />才能達到 merge sort 中的 stable 特性?<br /><br />感謝您的回答~Anonymousnoreply@blogger.com