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

打印
嵌入

排行榜

视觉风格

选项

切换模板

恢复自动保存：？