1.1 Fundamentals of Algorithms

In this module, you will learn how algorithms are used to solve problems and complete tasks in a logical and systematic way. You will begin by exploring decomposition and abstraction, and how these techniques can be used as part of a systematic approach to problem solving. You will learn how algorithms can be represented using pseudo-code, program code, and flowcharts, identify their inputs, processing, and outputs, and determine the purpose of algorithms using visual inspection and trace tables.

Next, you will explore algorithm efficiency, learning how different algorithms can solve the same problem while requiring different amounts of processing, and how their time efficiency can be compared. Finally, you will study standard searching and sorting algorithms. You will learn how binary search and linear search are used to find values in lists, and how bubble sort and merge sort are used to arrange data into order. You will apply these algorithms to data sets, compare how they work, and consider their advantages and disadvantages.