Divide and conquer is option A

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

+14 votes

+18 votes

+1 vote

Option A ---> Merge sort

Merge sort is a divide and conquer algorithm.

It works by recursively breaking down a problem into two or more sub-problems of the same or related type, until these become simple enough to be solved directly. The solutions to the sub-problems are then combined to give a solution to the original problem. So Merge Sort first divides the array into equal halves and then combines them in a sorted manner.

Merge sort is a divide and conquer algorithm.

It works by recursively breaking down a problem into two or more sub-problems of the same or related type, until these become simple enough to be solved directly. The solutions to the sub-problems are then combined to give a solution to the original problem. So Merge Sort first divides the array into equal halves and then combines them in a sorted manner.

0 votes

+1

Everyone of us knows the resources if u want to contribute genuinely at least learn from these video and then contribute by this way u can get points but no one get their right answer in shorter time ,thank you

- All categories
- General Aptitude 1.5k
- Engineering Mathematics 7.1k
- Digital Logic 2.7k
- Programming & DS 4.9k
- Algorithms 4.2k
- Theory of Computation 5.3k
- Compiler Design 2.1k
- Databases 4k
- CO & Architecture 3.5k
- Computer Networks 4k
- Non GATE 1.4k
- Others 1.5k
- Admissions 556
- Exam Queries 551
- Tier 1 Placement Questions 23
- Job Queries 69
- Projects 18

47,894 questions

52,260 answers

182,164 comments

67,678 users