1. In order to decide which algorithm to chose over another, they are compared in terms of their efficiency: the _____ it takes to find the solution and the resources which are consumed in the process

2. Space-wise efficiency is referring to the amount of (memory) space the algorithm will take up before it terminates with the correct solution

3. When considering space-wise efficiency, the aim is to utilise data structures which take up ______________________

4. Example: populating a list with variables of type "real" will be ___________ inefficient, when it is clear that only whole numbers (integers) will ever be needed to solve the problem

5. This is the amount of time it takes for the algorithm to terminate with the correct solution

6. Insertion Sort uses the insertion method and while it can perform at O(n) in the best case, it performs at O(n2) in the average and worst case.

7. Consider the following algorithm: Count the number of computational steps in the algorithm

8. An ___________ algorithm is considered highly efficient, as the ratio of the number of operations to the size of the input decreases and tends to zero when n increases

9. For a larger data set a linear search would be preferrable (more efficient or suitable) than a binary search.

10. The Best Case represents the ________ speed the the algorithm can operate in in the most optimal conditions

11. The Worst Case represents the _______ speed that the algorithm will operate in in the worst conditions

12. The Average Case represents the average (or expected) speed the the algorithm will operate in in ______ conditions.

13. Fill in the blanks for the following excerpt

14. The worst case scenario for a Bubble Sort is O(n)

15. These are algorithms which provide close approximations for problems for which no known polynomial solution algorithm exists