front + index
DESCRIPTION
about algoTRANSCRIPT
![Page 1: FRONT + INDEX](https://reader036.vdocument.in/reader036/viewer/2022083018/577c7f7e1a28abe054a4d0f9/html5/thumbnails/1.jpg)
ALGORITHM ANALYSIS AND DESIGN
University School of Information and Communication Technology, GGSIPU
Submitted by Vishal Sharma 02916403213
B.Tech CSE (VI semester)
![Page 2: FRONT + INDEX](https://reader036.vdocument.in/reader036/viewer/2022083018/577c7f7e1a28abe054a4d0f9/html5/thumbnails/2.jpg)
![Page 3: FRONT + INDEX](https://reader036.vdocument.in/reader036/viewer/2022083018/577c7f7e1a28abe054a4d0f9/html5/thumbnails/3.jpg)
ALGORITHM ANALYSIS AND DESIGN
University School of Information and Communication Technology, GGSIPU
Submitted by Rajat Chauhan 02916403213
B.Tech CSE (VI semester)
![Page 4: FRONT + INDEX](https://reader036.vdocument.in/reader036/viewer/2022083018/577c7f7e1a28abe054a4d0f9/html5/thumbnails/4.jpg)
INDEXS.No
PROGRAM Signature
1 MERGE SORT
2 COUNT SORT
3 STRAIGHT RADIX SORT
4 Longest Common Subsequences (LCS)
5 Matrix Chain Multiplication Algorithm
6 Huffman Encoding
7 FRACTIONAL KNAPSNACK
8 Depth First Traversal (DFS)
9 Breadth First Search (BFS)
10 Dijkstra's shortest path algorithm
![Page 5: FRONT + INDEX](https://reader036.vdocument.in/reader036/viewer/2022083018/577c7f7e1a28abe054a4d0f9/html5/thumbnails/5.jpg)
11 Prim's Minimum Spanning Tree (MST) algorithm
INDEXS.No
PROGRAM Signature
1 MERGE SORT
2 COUNT SORT
3 STRAIGHT RADIX SORT
4 Longest Common Subsequences (LCS)
5 Matrix Chain Multiplication Algorithm
6 Huffman Encoding
7 FRACTIONAL KNAPSNACK
8 Depth First Traversal (DFS)
9 Breadth First Search (BFS)
![Page 6: FRONT + INDEX](https://reader036.vdocument.in/reader036/viewer/2022083018/577c7f7e1a28abe054a4d0f9/html5/thumbnails/6.jpg)
10 Dijkstra's shortest path algorithm
11 Prim's Minimum Spanning Tree (MST) algorithm