This algorithm sorts a array $($or list$)$ one item at a time. At each iteration, the algorithm moves one element from its initial position in the list, to the location it belongs within the sorted list.

O Kruskal's Minimum Spanning Tree algorithm

$$ Heap sort

$$ Merge sort

$$ Prim's Minimum Spanning Tree algorithm

$$ Selection sort

$$ Binary search

O Quicksort

$$ Linear search

$$ Bucket sort

$$ none of these

$$ Depth first search

$$ Radix sort