COMPUTER SCIENCE AND ENGINEERING
ALGORITHMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Merge
|
|
|
Bubble
|
|
|
Insertion
|
|
|
None of them do
|
Detailed explanation-1: -It takes one iteration to build a sorted sublist of length 1, 2 iterations to build a sorted sublist of length two and finally n-1 iterations to build the final list.
Detailed explanation-2: -In the bubble sort algorithm, we check the neighbour element and swap them if required. In the insertion sort, we transfer an element at one time to construct a sorted array. It includes more swaps. It includes less number of swaps.
Detailed explanation-3: -Quicksort. Quicksort is one of the most efficient sorting algorithms, and this makes of it one of the most used as well.
Detailed explanation-4: -Time Complexity On average, O(logN) time is required to fetch the minimum or maximum element from the heap, and we have to fetch N elements. So overall time complexity of quicksort is O(NlogN). The order of time taken by quicksort is always the same irrespective of the array.