(Algorithm) Sorting 모음

- sorting 이름 : best 시간 worst 시간

설명 주소 : 

 

1. List

- Bubble sort : O(n) / O(n^2)

 

- selection sort : O(n^2) / O(n^2)

 

- Insertion sort : O(n) / O(n^2)

 

- Shell sort : O(n) / O(n^3/2)

 

 

2. Divide and Conquer

- Quick sort : O(nlogn) / O(n^2)

 

- Merge sort : O(nlogn) / O(nlogn)

 

3. Tree & Divide and Conquer

- Heap sort : O(nlogn) / O(nlogn)

 

 

4. Radix Sort

- Radix sort : O(nk) / O(nk)