DESIGN AND ANALYSIS OF ALGORITHMS LAB

(PCS-505)

NOTE: Implement the following Algorithms in C/C++ & analyze its

run time complexity within the program and verify with mathematically
given complexity.
(For all searching and sorting algorithms Input and Output size should be in
some thousands preferably using File)

Brute Force Approaches:

1. Implement Sequential Search Algorithm.
2. Implement Selection Sort Algorithm.
3. Implement Bubble Sort Algorithm.
4. Implement Brute Force String Matching Algorithm.

DIVIDE AND CONQUER:

5. Implement Binary Search Algorithm.
6. Implement Merge Sort Algorithm.
7. Implement Quick Sort Algorithm.

THE GREEDY METHOD:

8. Implement fractional Knapsack Problem Algorithm.
9. Implement Job Sequencing with Deadlines Algorithm.
10. Implement Minimum-Cost Spanning Trees: Prims Algorithm.
11. Implement Single Source Shortest Paths: Dijkstras Algorithm.

DYNAMIC PROGRAMMING:
12. Implement Single-Source Shortest Paths: Bellman-Fords Algorithm.
13. Implement All-Pairs Shortest Paths: Floyd & Warshalls Algorithm.

DECREASE-AND-CONQUER:
14. Implement Insertion Sort Algorithm.
15. Implement Depth First Search Algorithm.
16. Implement Breadth First Search Algorithm.