diff --git a/Algorithms Specialization/Part 3/README.md b/Algorithms Specialization/Part 3/README.md index f45d905..88e801b 100644 --- a/Algorithms Specialization/Part 3/README.md +++ b/Algorithms Specialization/Part 3/README.md @@ -6,6 +6,11 @@ by Stanford University The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees). +### Extra + +I analysed the runtime of different minimum spanning tree algorithms and compared the running time. Although the asymtotic analysis predicts the opposite, Prim's MST algorithm is faster than Pettie and Ramachandran optimal minimum spanning tree algorithm. + + ### Week 1 Two motivating applications; selected review; introduction to greedy algorithms; a scheduling application; Prim's MST algorithm. @@ -20,7 +25,6 @@ Prim's MST algorithm was used to convert a 500 Node 2500 Edge Graph into a minim Kruskal's MST algorithm and applications to clustering; advanced union-find. - | Graph clustert by edge weight into 4 Sub-Graphs | | :------------------------------------------------------: | | | diff --git a/Algorithms Specialization/Part 3/mst.svg b/Algorithms Specialization/Part 3/mst.svg new file mode 100644 index 0000000..8cf57a7 --- /dev/null +++ b/Algorithms Specialization/Part 3/mst.svg @@ -0,0 +1 @@ +0 ms5,000 ms10,000 ms15,000 ms20,000 ms25,000 ms30,000 ms35,000 ms49861124339250640374912498570125008824989103750033499750962490297502091RuntimeEdge countRuntime of different algorithms for minimal spanning tree calculation for 10000 NodesPrimKruskalBoruvkaFredman, TarjanPettie, Ramachandran \ No newline at end of file