This algorithm works by distributing the elements of an array into a number of containers.

Each container is then sorted individually, and the sorted contents are then gathered, in order, to build the sorted array.

$$ Dijkstra's Shortest Path algorithm

$$ Bubble sort

$$ Merge sort

O Kruskal's Minimum Spanning Tree algorithm

$$ Linear search

$$ Radix sort

$$ none of these

$$ Insertion sort

O Heap sort

$$ Binary search

$$ Bucket sort

$$ Quicksort