COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Merge sort
|
|
|
Binary Search
|
|
|
Linear Search
|
|
|
Quick sort
|
Detailed explanation-1: -Answer. Answer: Linear Search does not divide a list as it linearly searches (i.e. searches an element one by one) an element in a list. It is the most inefficient way of searching an element.
Detailed explanation-2: -Merge sort keeps on dividing the list into equal halves until it can no more be divided. By definition, if it is only one element in the list, it is sorted. Then, merge sort combines the smaller sorted lists keeping the new list sorted too.
Detailed explanation-3: -As previously stated, heap sort is not a “Divide and Conquer” method.
Detailed explanation-4: -This option D, which is the recurrence relation, and that I will not follow the device and conquer strategy. And the recurrent relation method uses substitution properties instead of the development conquer. So that’s an option recurrence relation.
Detailed explanation-5: -The linear search uses an iterative approach to find the element, so it is also known as a sequential approach. In contrast, the binary search calculates the middle element of the array, so it uses the divide and conquer approach. Linear search is not suitable for the large data set.