Algorithms and Data Structures (Week 11-20)

Algorithms and Data Structures (Week 11-20)

1. What makes a good algorithm? part 1

   • Random Access Machines
     • Growth of functions
       • What makes a good algorithm part 2
         • Analysing algorithms

2. Searching Data part 1

   • Binary search
     • Comparing search algorithms
       • Searching Data part 2
         • Abstractions and Linked lists

3. Recursion Part 1

   • Decrease and Conquer
     • Recursion examples
       • Recursion Part 2
         • Recursive binary search and the call stack

4. Sorting Data Part 1

   • Quick sort
     • Merge Sort
       • Sorting Data part 2
         • Complexity of sorting

5. Computational Complexity Part 1

   • Introduction
     • Complexity classes
       • Computational Complexity part 2
         • NP