扣筆記 CodeNotes by kaiyuncheng

Sorting 排序

• 排序 Sorting:
  Comparison Sort

1. 氣泡排序 Bubble Sort - Time O(n) or O(n^2) / Space - O(1)

2. 選擇排序 Selection Sort - Time O(n^2) / Space - O(1)

3. 插入排序 Insertion Sort - Time O(n) or O(n^2) / Space - O(1)

4. 合併排序 Merge Sort - Time O(n log n) / Space - O(n)

5. 快速排序 Quick Sort - Time O(n log n) / Space - O(log n)

• 合併排序 Merge Sort 和 快速排序 Quick Sort 用 Divide and Conquer Recursion 方式

• Heap Sort

Non-Comparison Sort

• Counting Sort
• Radix Sort