Data Structure
  • 資料結構自學筆記
  • 1 - Stack & Queue
    • 1.1 - Stack
    • 1.2 - Queue
    • 1.3 - Stack and Queue
  • 2 - Tree & Binary Tree
    • 2.1 - Tree
    • 2.2 - Binary Tree
    • 2.3 - Binary Tree Traversal
    • 2.4 - Binary Search Tree
    • 2.5 - Heap
    • 2.6 - Thread Binary Tree
    • 2.7 - Tree and Binary Tree Conversion
    • 2.8 Advanced Trees
      • 2.8.1 - Min-Max Heap
      • 2.8.2 - Deap
      • 2.8.3 - Symmetric Min-Max Heap
      • 2.8.4 - Extended Binary Tree
      • 2.8.5 - AVL Tree
      • 2.8.6 - M-Way Search Tree
      • 2.8.7 - B Tree
      • 2.8.8 - Red-Black Tree
      • 2.8.9 - Optimal Binary Search Tree
      • 2.8.10 - Splay Tree
      • 2.8.11 - Leftest Heap
      • 2.8.12 - Binomial Heap
  • 3 - Search & Sort
    • 3.1 - Searching
    • 3.2 - Elementary Sorting
      • 3.2.1 - Insertion Sort
      • 3.2.2 - Selection Sort
      • 3.2.3 - Bubble Sort
      • 3.2.4 - Shell Sort
    • 3.3 - Sophisticated Sorting
      • 3.3.1 - Quick Sort
      • 3.3.2 - Merge Sort
      • 3.3.3 - Heap Sort
      • 3.3.4 - Radix Sort
      • 3.3.5 - Bucket Sort
      • 3.3.6 - Counting Sort
    • 3.4 - Summary
  • 4 - Graph
    • 4.1 - Intro
    • 4.2 - Graph Traversal
    • 4.3 - Spanning Tree
      • 4.3.1 - Kruskal's algorithm
      • 4.3.2 - Prim's algorithm
      • 4.3.3 - Sollin's algorithm
    • 4.4 - Shortest Path Length
      • 4.4.1 - Dijkstra's algorithm
      • 4.4.2 - Bellman-Ford algorithm
      • 4.4.3 - Floyd-Warshall algorithm
    • 4.5 - AOV Network
    • 4.6 - AOE Network
    • 4.7 - Others
Powered by GitBook
On this page
  1. 3 - Search & Sort
  2. 3.3 - Sophisticated Sorting

3.3.5 - Bucket Sort

(MSD) Radix Sort

Previous3.3.4 - Radix SortNext3.3.6 - Counting Sort

Last updated 6 years ago

1. 演算法

  1. 依照資料的最高位數值分派到對應的buckets

  2. 每一個bucket各自排序

  3. 合併buckets

Distribution & Merge只需做一次，適用於當位數很多時。

e.g. 排序179, 258, 33, 55, 145, 392, 219, 633, 175, 600

依照百位數來分派數值：

bucket0:33→55bucket1:145→175→179bucket2:219→258bucket3:342bucket4bucket5bucket6:600→633bucket7bucket8...bucket0: 33→55\\ bucket1: 145→175→179\\ bucket2:219→258\\ bucket3:342 \\ bucket4\\ bucket5\\ bucket6:600→633\\ bucket7\\ bucket8\\ ...bucket0:33→55bucket1:145→175→179bucket2:219→258bucket3:342bucket4bucket5bucket6:600→633bucket7bucket8...

合併: 33→55→145→175→179→219→258→342→600→63333→55→145→175→179→219→258→342→600→63333→55→145→175→179→219→258→342→600→633