Big-O Notation: Measuring the Efficiency of an Algorithm

Big O Notation
Student Name
University Affiliation
Course Name
Instructor’s Name
Assignment Due Date
Big O Notation
Big O Notation is used to measure the efficiency of an algorithm. It does this by measuring the time taken to run a function as the input grows (Chivers & Sleighthome, 2006). There are two parts involved in measuring the efficiency of an algorithm. The first is time complexity. Time complexity measures how long a function takes to run through computational steps. The second is space complexity. Space complexity checks the amount of memory required to execute the algorithm (Chivers & Sleighthome, 2006). 
In programming, Big O notation is used as a unit of measurement (Chivers & Sleighthome, 2006). It helps programmers in estimating the efficiency of an algorithm, script, or block of code. For example, one of the things programmers seek to know is how long the algorithm, code, or script wi...