1. Introduction

An algorithm is a set of instructions that, when executed, completes a defined task.

But what if there is more than one way to complete the task? How do you decide which algorithm is the most suitable?

This is the topic of this section. If covers the topic of

• Space efficiency
• Time efficiency
• Big O notation