- pick an arbitrary minimal element
- delete minimal element and any edges incident on it
- repeat until all vertices included



Sorting Algorithms

elementary       advanced
O(n2)             O(n log n)

exchange         quicksort
insert           -->Shell O(n1.5)
selection           heapsort

Previous Page - 41 Next Page - 43 Home