# Sorting

1.

Two main measures for the efficiency of an algorithm are

A.) Processor and memory
B.) Complexity and capacity
C.) Time and space
D.) Data and space

Time and space

2.

The Average case occur in linear search algorithm

A.) When Item is somewhere in the middle of the array
B.) When Item is not in the array at all
C.) When Item is the last element in the array
D.) When Item is the last element in the array or is not there at all

When Item is somewhere in the middle of the array

3.

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

A.) Counting the maximum memory needed by the algorithm
B.) Counting the minimum memory needed by the algorithm
C.) Counting the average memory needed by the algorithm
D.) Counting the maximum disk space needed by the algorithm

Counting the maximum memory needed by the algorithm

4.

The complexity of the average case of an algorithm is

A.) Much more complicated to analyze than that of worst case
B.) Much more simpler to analyze than that of worst case
C.) Sometimes more complicated and some other times simpler than that of worst case
D.) None of the mentioned

Much more complicated to analyze than that of worst case

5.

The complexity of Bubble sort algorithm is

A.) O(n)
B.) O(log n)
C.) O(n2)
D.) O(n log n)