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

만든이
인쇄
퍼가기

순위표

비주얼 스타일

옵션

템플릿 전환하기

자동 저장된 게임을 복구할까요?