bubble sort, comparing adjacent pairs and swapping them if they are in the wrong order, more number of swaps, simple, checks the neighbouring elements and swaps them accordingly, slow, insertion sort, a simple sorting algorithm that builds the final sorted list by transferring one element at a time, less number of swaps, complex, transfers an element at a time to the partially sorted array, fast

computer science

由
列印
嵌入

視覺風格

顯示所有
活動設定 排行榜 作業

活動設定

排行榜

切換範本

恢復自動保存: ?