Home
Recent Q&A
Java
Cloud
JavaScript
Python
SQL
PHP
HTML
C++
Data Science
DBMS
Devops
Hadoop
Machine Learning
Azure
Blockchain
Devops
Ask a Question
Which sorting algorithm uses divide and conquer principle to divide the list to single elements?
Home
Go Semantics Supplemental
Which sorting algorithm uses divide and conquer principle to divide the list to single elements?
0
votes
asked
Jul 14, 2022
in
Go Semantics Supplemental
by
john ganales
Which sorting algorithm uses divide and conquer principle to divide the list to single elements?
a) Bubble Sort
b) Heap Sort
c) Radix Sort
d) Merge Sort
sort
semantics
Please
log in
or
register
to answer this question.
1
Answer
0
votes
answered
Jul 14, 2022
by
john ganales
d) Merge Sort
...
