Dijkstra's Algorithm
Introduction: Given a graph and a source vertex in graph, find shortest paths from source to all vertices in the given graph. Let's take a real life example:
Posts
C++ code to Calculate SquareRoot of a number using Recursion
Example: Input: 25 Output: 5 Input: 11 Output:3
C++ Program for Power Function using Recursion
Example: Input: N=5; x=3; Output: 125 #include <iostream>
Geometric Mean for a given K Using Recursion
Example: For a given K find: 1 + 1/2 + 1/4 + 1/8 + ... + 1/(2^k)
Multiply two numbers using Recursion
This program is to multiply two numbers using Recursive function.