tag:blogger.com,1999:blog-4949960181628888221.post4049736635754483284..comments2022-04-09T19:46:43.609+08:00Comments on Infinite Loop: 【演算】插入排序法 - Insertion SortAnonymoushttp://www.blogger.com/profile/17636157464310241832noreply@blogger.comBlogger4125tag:blogger.com,1999:blog-4949960181628888221.post-3506552151132630232012-07-30T00:47:49.161+08:002012-07-30T00:47:49.161+08:00請問為什麼需要j = j - 1這步驟?請問為什麼需要j = j - 1這步驟?Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-4949960181628888221.post-21065197989114463922012-07-14T00:39:54.955+08:002012-07-14T00:39:54.955+08:00while loop, j>0就好吧while loop, j>0就好吧Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-4949960181628888221.post-80825064353278051682012-04-16T09:53:35.226+08:002012-04-16T09:53:35.226+08:00While loop中, j >= 0 開始才對, 否則data[0]會沒有排到While loop中, j >= 0 開始才對, 否則data[0]會沒有排到Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-4949960181628888221.post-70921873266096162132011-10-27T14:00:22.025+08:002011-10-27T14:00:22.025+08:001 + 1 + (n - 1) + (n - 1) + (n - 1) + n(n - 1) / 2...1 + 1 + (n - 1) + (n - 1) + (n - 1) + n(n - 1) / 2 + n(n - 1) / 2 + n(n - 1) / 2 + (n - 1) = (3n^2 + 5n - 4)/2才對Anonymousnoreply@blogger.com