Basics

**1.**Two main measures for the efficiency of an algorithm are

**2.**The time factor when determining the efficiency of algorithm is measured by

**3.**The space factor when determining the efficiency of algorithm is measured by

**4.**Which of the following case does not exist in complexity theory

**5.**The Worst case occur in linear search algorithm when

**6.**The Average case occur in linear search algorithm

**7.**The complexity of linear search algorithm is

**8.**The upper bound on the time complexity of the nondeterministic sorting algorithm is

**9.**The worst case time complexity of the nondeterministic dynamic knapsack algorithm is

**10.**What do you call the selected keys in the quick sort method?