(這裡是英文介紹，中文請往下滑) Graphical demonstration of eight sorting algorithms. https://en.wikipedia.org/wiki/Sorting_algorithm R key initialize with random input C key initialize with random input, but the value of the element can be repeated D key initialize with the input sorted from largest to smallest A key initialize with a slightly pre-sorted input S key initialize with the last used input Spacebar Pause/Start Right Arrow works when paused, advances one frame 1~6 key to set the speed 7~0 key to set the list size *Warning: Most visualization features will be disabled when the list size is greater than 100, due to the 1px Scratch limit. It's not unsolvable, but I'm too lazy to do that, this already cost me a week. It's a pain to practice quicksort and mergesort without using recursion... 八種排序演算法的圖像化演示 https://zh.wikipedia.org/wiki/排序算法 R鍵 以隨機輸入初始化 C鍵 以隨機輸入初始化，但元素數值可重複 D鍵 以從大到小排序的輸入初始化 A鍵 以已預先稍微排序的輸入初始化 S鍵 以上次使用的輸入初始化 空白鍵 暫停 / 開始 向右鍵 在暫停時作用，前進一幀 1~6鍵 設定速度 7~0鍵 設定清單大小 ＊警告：在清單大小大於100時大部分的可視化功能將被禁用，因1像素的Scratch限制。 這不是不可解決的，但我懶得再去做，在不使用遞迴的情況下實踐快速排序和合併排序真的很痛苦...
Speed n means running n ticks per frame. Writes penalty m means that every time an element on the main list or auxiliary list is changed, the subsequent m ticks will be suspended to simulate the additional overhead caused by writing elements to the list. speed 速度 n 意味著每幀運行n次操作 writes penalty 寫入懲罰量 m 意味著每次執行寫入元素到主要或輔助列表時都將暫停之後的m次計算以模擬交換元素所產生的額外開銷。
