|
|
|
 |
|
|
|
|
This section C++ : Algorithms contains source codes of some Programs that implements some Algorithms that i had study in my 'Algorithm Design & Analysis' Course.
Select one of the Topics listed below:
|
Note:
All the given files are in zip format, which can be uncompressed with the help of a compression tool. If you do not have any tool, then you can get one from Utilities : Compression Tools. |
|
|
Linear Time Algorithms |
|
|
|
|
|
|
| ALGO-01 |
 |
A C++ Program to coumputes and displays the factorial of the given number ( using Recursive Algorithm ). |
|
|
|
|
|
Logrithmic Time Algorithms |
|
|
|
|
|
|
| ALGO-02 |
|
A C++ Program to implement the Binary search Algorithm. |
|
|
|
|
|
Quadratic Time Algorithms |
|
|
|
|
|
|
| ALGO-03 |
|
A C++ Program to show the implementation of the Bubble Sort Algorithm. |
|
|
|
|
|
Cubic Time Algorithms |
|
|
|
|
|
|
| ALGO-04 |
|
A C++ Program to Multiply two Matrices. |
|
|
|
|
|
Exponential Time Algorithms |
|
|
|
|
|
|
| ALGO-05 |
|
A C++ Program to solve the Towers of Hanoi Problem (using Recursive Algorithm). |
|
|
|
|
|
Divide and Conquer Strategy |
|
|
|
|
|
|
| ALGO-06 |
|
A C++ Program to computes the n_th term of the fibonacci series using Divide and Conquer Strategy. |
| ALGO-07 |
|
A C++ Program to computes the product of two matrices of size 4x4 using Divide and Conquer Strategy. |
| ALGO-08 |
|
A C++ Program to computes the product of two matrices of size 4x4 using Strassen's Algorithm (Improved Divide and Conquer Strategy). |
|
|
|
|
|
Dynamic Programming Technique |
|
|
|
|
|
|
| ALGO-09 |
|
A C++ Program to computes the n_th term of the fibonacci series using Dynamic Programming Technique. |
| ALGO-10 |
|
A C++ Program to computes the n_th term of the fibonacci series using Toplogical Odering and Dynamic Programming Technique. |
|
|
|
|
|
Minimum Cost Spanning Tree Problem |
|
|
|
|
|
|
| ALGO-11 |
|
A C++ Program to implement the Prim's Algorithm to solve Minimum Spanning Tree Problem (MST). |
| ALGO-12 |
|
A C++ Program to implement the Prim's Algorithm to solve Minimum Spanning Tree Problem (MST) using Graphics. |
| ALGO-13 |
|
A C++ Program to implement the Prim's Algorithm to solve Minimum Spanning Tree Problem (MST) using Graphics and with Mouse support. |
| ALGO-14 |
|
A C++ Program to implement the Kurskal's Algorithm to solve Minimum Cost Spanning Tree Problem (MST). |
| ALGO-15 |
|
A C++ Program to implement the Kurskal's Algorithm to solve Minimum Cost Spanning Tree Problem (MST) using Graphics. |
| ALGO-16 |
|
A C++ Program to implement the Kurskal's Algorithm to solve Minimum Cost Spanning Tree Problem (MST) using Graphics with Mouse Support. |
|
|
|
|
|