Scribd
Upload
3 views2 pages

Prateek Narang's DSA Course Overview

The document outlines various algorithms and their results, including Binary Search, Merge Sort, Quick Sort, Dijkstra's Algorithm, and others. Specific outputs are provided for Binary Search, Merge Sort, Quick Sort, Dijkstra's Algorithm, Floyd-Warshall, N-Queens, and TSP, while several algorithms are noted as not implemented. Example outputs are given for Dijkstra's Algorithm and Hamiltonian Cycle.

Uploaded by

pipaldebadal6
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views2 pages

Prateek Narang's DSA Course Overview

The document outlines various algorithms and their results, including Binary Search, Merge Sort, Quick Sort, Dijkstra's Algorithm, and others. Specific outputs are provided for Binary Search, Merge Sort, Quick Sort, Dijkstra's Algorithm, Floyd-Warshall, N-Queens, and TSP, while several algorithms are noted as not implemented. Example outputs are given for Dijkstra's Algorithm and Hamiltonian Cycle.

Uploaded by

pipaldebadal6
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

1.

Binary Search

Found at index: 3

Found at index: 3

2. Merge Sort

5 6 7 11 12 13

3. Quick Sort

1 5 7 8 9 10

4. Strassen's Matrix Multiplication

Not implemented here.

5. BFS

Not implemented here.

6. DFS

Not implemented here.

7. Dijkstra's Algorithm

Vertex Distance from Source

0 0

1 4

2 12

3 19

4 21

5 16

8. Floyd-Warshall

057
302

160

9. N-Queens

0010

1000

0001

0100

10. TSP

60

11. Job Scheduling

Not implemented here.

12. Hamiltonian Cycle

0 1 4 2 3 0 (example output)

You might also like