Multiple Choice
An array a[ ] of N elements is being sorted using the insertion sort algorithm.The algorithm is at the last stage,with the segment of the array in positions 0 through N-2 already sorted.How many array elements will a[N-1] have to be compared to,before it can be placed into its proper position?
A) Just one
B) Could be any number of elements between 1 and N-1 (inclusive.
C) Could be any number of elements between 1 and N (inclusive.
D) N-1
Correct Answer:
Verified
Correct Answer:
Verified
Q1: The worst case complexity function is a
Q2: One can sort an array a[ ]
Q3: When applied to an array a[ ]
Q5: Let F be an algorithm with complexity
Q6: The selection sort algorithm works by<br>A) repeatedly
Q7: Binary Search is in the complexity class<br>A)
Q8: Consider the following implementation of insertion sort:<br>Public
Q9: The insertion sort algorithm works by<br>A) repeatedly
Q10: A search for an item X in
Q11: If lower is the first subscript in