1. What is the worst case run-time complexity of binary search algorithm? a. Ο(n2) b. Ο(nlog n) c. Ο(n3) d. Ο(n) 2. What is not true about insertion sort? a. Exhibits the worst case performance when the initial array is sorted in reverse order. b. Worst case and average case performance is Ο(n2) c. Can be compared to the way a card player arranges his card from a card deck. d. None of the above! 3. Which of the following is example of in-place algorithm? a. Bubble Sort b. Merge Sort c. Insertion Sort d. All of the above 4. Which of the below mentioned sorting algorithms are not stable? a. Selection Sort b. Bubble Sort c. Merge Sort d. Insert Sort 5. Q 10 - A stable sorting algorithm − a. does not crash. c. does not run out of memory. b. does not change the sequence of appearance of elements. d. does not exists.
ACTIVITIES/ASSESSMENTS:
1. What is the worst case run-time complexity of binary search
a. Ο(n2) b. Ο(nlog n) c. Ο(n3) d. Ο(n)
2. What is not true about insertion sort?
a. Exhibits the worst case performance when the initial array is sorted in reverse
order.
b. Worst case and average case performance is Ο(n2)
c. Can be compared to the way a card player arranges his card from a card deck.
d. None of the above!
3. Which of the following is example of in-place algorithm?
a. Bubble Sort b. Merge Sort c. Insertion Sort d. All of the above
4. Which of the below mentioned sorting algorithms are not stable?
a. Selection Sort b. Bubble Sort c. Merge Sort d. Insert Sort
5. Q 10 - A stable sorting algorithm −
a. does not crash. c. does not run out of memory.
b. does not change the sequence of appearance of elements.
d. does not exists.
Trending now
This is a popular solution!
Step by step
Solved in 4 steps
