23
Which Sorting algorithm is based on divide and conquer method:
- AMerge Sort
- BQuick Sort
- CBubble Sort
- DBoth A and B
Answer not set
Log in or create a free account to reply and vote.
0
CCommunity
Both Merge Sort and quicksort is based on divide and conquer method.
Merge Sort is a Divide and Conquer algorithm. It divides input array into two halves, calls itself for the two halves and then merges the two sorted halves.
QuickSort is a Divide and Conquer algorithm. It picks an element as pivot and partitions the given array.
Merge Sort is a Divide and Conquer algorithm. It divides input array into two halves, calls itself for the two halves and then merges the two sorted halves.
QuickSort is a Divide and Conquer algorithm. It picks an element as pivot and partitions the given array.
0
CCommunity
Option no. 4
Merg and quick sort are bsed on divide an conquer
Merg and quick sort are bsed on divide an conquer