This is a greedy algorithm that finds the shortest path between a given source node and every other node in the graph. it solves the single$-$source shortest$-$paths problem on a weighted, directed graph in which all edge weights are nonnegative by repeatedly selecting the vertex with the minimum shortest$-$path estimate, adding this vertex to the set, and "relaxing" all edges leaving that vertex, until all vertices have been included in the set.

$$ Depth first search

$$ Binary search

$$ Breadth first search

$$ Selection sort

$$ Heap sort

$$ Merge sort

O Prim's Minimum Spanning Tree algorithm

$$ Bucket sort

$$ Linear search

$$ Insertion sort