Chapter 3

Question 1

How is time efficiency calculated?

Answer 1

We measure time efficiency by checking the amount of work an algorithm has to do in terms of the size of the problem.

Question 2

How do we measure efficiency?

Answer 2

Using best cases (fewest comparisons) and worst cases (most comparisons).

Question 3

What is O(n)?

Answer 3

The number of comparisons made of the order of n

Question 4

What is the notation of a simplified analysis of an algorithm’s efficiency?

Answer 4

Big O Notation.

Question 5

What exactly does Big O Notation do?

Answer 5

It gives us the algorithm’s complexity in terms of N.

Question 6

What are the three types of measurements?

Answer 6

Worst-Case
Best-Case
Average-Case

Question 7

Big O Notation uses Running Time Complexity.

What is the hierarchy of algorithms from least intense to most intense performance?

Answer 7

Least Intense
O(1)
O(logn)
O(n)
O(nlogn)
O(n^2)
O(2^n)
O(n!)
Most Intense

Question 8

What algorithm has the task of putting a list of values into a specific order?

Answer 8

Sorting algorithm.