Data Structures and Algorithms (COM1029)

In depth coverage of algorithms and data structures. Covers algorithmic efficency, time and space complexity for all O notation (big 0, little 0, omega). Linear, quadratic to exponential algorithms. Kadane's algorithm, brute force algorithm. Summary of all sorting algorithms, trees (AVL, B-trees), arrays, loops, heaps (fibonnaci, binomial etc), stacks, queues, all types of lists. Details recursion and iteration, tower of hanoi, types of searches, divide and conquer and greedy algorithms, traver...