Algorithm Purposes

Different Algorithms and their Uses

Kruskal’s Algorithm

Finding the minimal spanning tree of a graph. Good for sparse graphs.

Prim’s Algorithm

Finding the minimal spanning tree of a graph. Good for dense graphs.

Dijkstra’s Algorithm

Find’s the shortest path in a weighted graph with non negative weights.

Warshall’s Algorithm

Creates a transitive closure matrix for a graph that determines whether you can reach vertex t from vertex s.

Breadth-First-Search

Finds shortest path from starting vertex to all other vertices. Searching a tree/graph wide but shallow. Uses a Queue ADT.

Depth-First-Search

Can check if a path exists between two vertices. Searches deep but not wide. Uses a Stack ADT.

Quick Sort

Best to sort randomly sorted data. Not good for sorted data. Unstable, non-adaptive, in-place.

Radix Sort

Non-Comparison based sorting. Stable, non-adaptive, not in-place

Selection Sort

Sorting data, unstable, non-adaptive, IN-PLACE!

Bubble Sort

Sorting data, Stable, adaptive, in-place

Insertion Sort

Sorting data. Stable, Adaptive, In-Place.

Merge Sort

Used for sorting arrays mostly. STABLE. Non-adaptive, not in-place.