전체 글
- 중복확인 2022.06.24
- Least Recently Used 2022.06.23
- 버블정렬 2022.06.21
- 정렬 알고리즘 2022.06.20
- 선택정렬 2022.06.19
중복확인
2022. 6. 24. 23:15
Least Recently Used
2022. 6. 23. 23:57
버블정렬
2022. 6. 21. 00:29
정렬 알고리즘
2022. 6. 20. 21:21
< simple, slow>
Bubble sort
Insertion sort
Selection sort
<fast>
Quick sort
Merge sort
Heap sort
<O(N)>
Radix sort
============================================
Selection sort
▣ Bubble sort
bubbleSort(A[ ]. n) -> 배열 A[1....n]을 정렬한다.
{
for last <- n downto 2 {
for i <- 1 to last-1
if (A[ i ] > A[ i + 1] ) then A[ i ] <-> A[ i + 1]; >> 교환
선택정렬
2022. 6. 19. 23:15
