Discussion
The Merger sort algorithm employs the design technique :
Answer: C
Merge sort uses divide and conquer.
It divides the array into two halves, sorts each half recursively, and merges the two sorted halves in linear time, giving \(O(n \log n)\) time.
It does not explore and undo choices (backtracking), it has no overlapping subproblems to store (dynamic programming), and it is far more efficient than trying all orderings (brute force).
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development