Exam
Vibe
Home
Engineering
Aerospace Engineering
Biomedical Engineering
Chemical Engineering
Civil Engineering
Computer Science
Digital Marketing Quiz
Electrical Engineering
Electronics and Communication Engineering
Mechanical Engineering
Govt Exam
Banking Exams
Other Government
Police
Railway Exams
SSC
State PSC Exams
Teaching / Education Exams
UPSC Exams
Blog
Contact
🔍
Home
›
Computer Science
›
Algorithms MCQ
›
Which of the following is a divide and conquer algorithm?
Which of the following is a divide and conquer algorithm?
A. Quick Sort
B. Bubble Sort
C. Selection Sort
D. Linear Search
Explanation:
Quick Sort follows divide and conquer strategy for sorting.
Tags:
Algorithms MCQ
,
Computer Science
« Previous
Next »
More from Algorithms MCQ:
Which of the following is the time complexity of binary search algorithm?
Which sorting algorithm has the best average case time complexity?
In a graph, which traversal technique uses a queue?
Which data structure is used in a recursive function call?
What is the time complexity of binary search algorithm?
Which sorting algorithm has the best average-case performance?