COMPUTER SCIENCE AND ENGINEERING
ALGORITHMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Selection Sort
|
|
|
Insertion Sort
|
|
|
Mergesort
|
|
|
None of the above
|
Detailed explanation-1: -Quick sort and merge sort algorithms are based on the divide and conquer algorithm which works in the recursive manner. Recursion is used in Quick sort and merge sort.
Detailed explanation-2: -Merge sort is a recursive algorithm that continually splits a list in half. If the list is empty or has one item, it is sorted by definition (the base case).
Detailed explanation-3: -What Is a Merge Sort Algorithm? Merge sort is one of the most efficient sorting algorithms. It is based on the divide-and-conquer strategy. Merge sort continuously cuts down a list into multiple sublists until each has only one item, then merges those sublists into a sorted list.
Detailed explanation-4: -Like merge sort, quicksort uses divide-and-conquer, and so it’s a recursive algorithm.
Detailed explanation-5: -Bottom up merge sort uses recursion.