Graph Searching: DFS and BFS Algorithms Explained
When we characterize the running time of a graph algorithm on a given graph G = (V, E), we usually
Read More
Algorithms
Kruskal Algorithm
Let G(V, E) be a connected, weighted graph. Kruskal’s algorithm is used to find a minimum-cost spanning tree (MCST) of
Read MoreUnderstanding Pseudocode
Line 1 performs the usual initialization of d and π values and line 2 initializes the set S to the
Read MoreDijkstra Algorithm
Dijkstra’s algorithm, named after its discoverer, Dutch computer scientist Edsger Dijkstra, is a greedy algorithm that solves the single-source shortest
Read MoreBubble Sort Algorithm: Steps, Working, and Efficiency
The bubble sort is similar to the selection sort, but more than one value is exchanged on each pass through
Read MoreMerge Sort: Divide and Conquer Algorithm Explained
The merge sort algorithm closely follows the divide-and-conquer paradigm. Intuitively, it operates as follows. Divide: Divide the n-element sequence to
Read MoreAsymptotic Notations: Big-Oh (O), Big-Omega (Ω), and Big-Theta (Θ)
Let f be a non negative function. Then we can define the three most common asymptotic bounds as follows. Big-Oh(O)
Read More