Sorting

[abc1]

Which of the following sorting algorithm is of divide and conquer type?
A) Bubble sort B) lnsertion sort
C) Quick sort D) Merge sort

Please help......

[YFGHNG]

A quick simplistic breakdown of all the sorts:

Bubble sort: swap everything in order of progression until everything is in order.

Insertion sort: if data on a certain side is bigger/smaller than the value, in goes the value at that point.

Quicksort: pick a middle point, small goes on left and big goes on right, repeat until everything is in order.

Mergesort: have several arrays, divide into halves, repeat until everything is array of size 1, start combining, sort after each combination iteration, repeat until done.

[Duthomhas]

Here's a quick observation for you:

Teachers ask these kinds of questions just to gauge how much attention you have bothered to give to your instruction.

[usama shahid]

merge sort and Quick Sort

[GrShultz]

Merge Sorting algorithm and Quick sort algorithm are known as divide and conquer type.