Week 1 introduces Algorithms and Data Structures showing how to measure the complexity of an algorithm.

Week 2 covers searching and sorting arrays with emphasis on the computational complexity of different sorting algorithms.

Week 3 covers searching. We will also review structures from Structured Programming. particular we will discuss binary searching which requires sorted data.

Week 4 moves into more complex sorting algorithms. These algorithms are less computationally complex but much more complex to program.

Through this backlog you will input, sort and output one dimensional arrays. Through it you will see the relationship between algorithmic complexity and the difficulty of writing programs. Often faster programs are harder to write the slow ones. You will also perform a matrix multiplication on two-dimensional arrays.