Assessment2

What is the average case running time of an insertion sort algorithm?

• O(N)

• O(N log N)

• O(log N)

• O(N²)

What is the running time of an insertion sort algorithm if the input is pre-sorted?

• O(N²)

• O(N log N)

• O(N)

• O(M log N)

What will be the number of passes to sort the elements using insertion sort?

• 6

• 5

• 7

• 1

For the following question, how will the array elements look like after second pass?

34, 8, 64, 51, 32, 21

• 8, 21, 32, 34, 51, 64

• 8, 32, 34, 51, 64, 21

• 8, 34, 51, 64, 32, 21

• 8, 34, 64, 51, 32, 21

Binary search can be used in an insertion sort algorithm to reduce the number of comparisons.

• True

• False

For the best case input, the running time of an insertion sort algorithm is?

• Linear

• Binary

• Quadratic

• Depends on the input

What does time complexity measure in an algorithm?

• Number of operations executed

• Amount of memory used

• Number of lines of code

• Input size

What is the time complexity of a binary search algorithm?

Which of the following best describes space complexity?

• The amount of time an algorithm takes to run

• The amount of memory an algorithm requires to execute

• The number of inputs an algorithm can handle

• The number of times an algorithm loops