ANALYSIS OF ALGORITHM

THEORY:

1.BINARY SEARCH 

2.QUICK SORT

3.BUBBLE SORT

4.SHELL SORTING

5.HEAP SORTING

6.KNAPSACK PROBLEM

7.DYNAMIC PROGRAMMING



PROGRAM

1.FINDING MIN AND MAX USING DIVIDE & CONQUER

2.MERGE SORT

3.BUBBLE SORT

4.QUICK SORT

5.SELECTION SORT

6.SHELL SORTING

7.INSERTION SORTING

8.HEAP SORTING

9.N QUEEN

10.PRIMS ALGORITHM

11.KNAPSACK PROBLEM

12.SHORTEST DISTANCE PROBLEM

13.0/1 KNAPSCAK PROBLEM

14.GRAPH COLOR

15.SUBNET-SUM

16.TRAVELLING SALESMAN PROBLEM