COMP90038 Summary

Description

Detailed summary on all the algorithms assessed throughout the course. Summary includes pseudocode, explanation, complexity and any properties that may exist for each algorithm. Includes a bonus page summarising the analysis of complexity. The summary includes algorithms from the following lectures: Algorithms and Data Structures Brute Force Methods Graph Traversal Decrease and Conquer by a Constant Decrease-and-Conquer-by-a-Factor Sorting with Divide-and-Conquer More Divide-and-Conquer Algorithms Priority Queues, Heaps and Heapsort Input Enhancement (Time/Space Tradeoffs) Hashing Dynamic Programming Warshall and Floyd algorithms Greedy Techniques – Prim and Dijkstra