Chapter 2.2
The chapter talks about how we must consider the technology where the instructions of the program gonna run into to be able to analyze the algorithm.
Then we start to analyze the algorithm (insertion sort) of the last chapter.
To do so we must examine how many times it executes each line of pseudocode and how long each line of pseudocode takes to run. Therefore, the 2 measures we take in count to analyze
— Mar 11, 2026 01:33PM
Add a comment