COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Identify the types of sorting that used the concept of divide and conquer.
|
|
Insertion sort
|
|
|
Merge sort
|
|
|
Selection sort
|
|
|
Bubble sort
|
Explanation:
Detailed explanation-1: -Merge sort is similar to the quick sort algorithm as it uses the divide and conquer approach to sort the elements. It is one of the most popular and efficient sorting algorithm. It divides the given list into two equal halves, calls itself for the two halves and then merges the two sorted halves.
There is 1 question to complete.