Which recursive sorting technique always makes recursive calls to sort subarrays that are about half size of the original array?
- 1 Answers
- 1084 Views
- I also Faced
- E-Mail Answers
Answer Posted / Ankur Singh Yadav
Binary Search (not a sorting algorithm) has a divide-and-conquer approach and operates on sorted arrays, making recursive calls to compare keys and divide the search space in half until finding the target. Merge Sort and QuickSort are common recursive sorting algorithms that make recursive calls to sort subarrays approximately halved in size.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
Please Help Members By Posting Answers For Below Questions
