CMC
Company
Programming
Technical
Which of the following sorting algorithms does not have worst case running time of O(n2) ?
A Merge Sort
B Quick Sort
C Bubble Sort
D Insertion Sort
Read Solution (Total 6)
-
- A. Merge Sort
- 9 years agoHelpfull: Yes(2) No(0)
- A) MERGE SORT BECOZ ITS WORST IS O(nLogn)
- 9 years agoHelpfull: Yes(2) No(0)
- merge sort
- 9 years agoHelpfull: Yes(0) No(0)
- A. Merge Sort
- 9 years agoHelpfull: Yes(0) No(0)
- merge sort
- 9 years agoHelpfull: Yes(0) No(0)
- merge sort
- 7 years agoHelpfull: Yes(0) No(0)
CMC Other Question
The ideal data structure to handle backtracking is?
A Queue
B Tree
C Stack
D Linked list
The following operations are performed on a stack:
push(10), push(20), pop, push(10), push(20), pop, pop, pop, push(20), pop. The sequence of values popped out is
A) 20, 10, 20, 10, 20
B) 20, 20, 10, 10, 20
C) 10, 20, 20, 10, 20
D) 20, 20, 10, 20, 10