Merge sort uses

Report

Report an issue

Name

Email

Message

Submit

Cancel

PGCET CSE Exam (Karnataka) 2011 click here to view all questions

Merge sort uses

Agreedy methodology

Bdivide and conquer methodology

Cdynamic methodology

Dheuristics with back tracking.

Akilesh Kharvi ? Dec 8 '2016 at 22:9

Answer: divide and conquer methodology

Explanation:

In computer science, merge sort (also commonly spelled mergesort) is an O(n log n) comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the implementation preserves the input order of equal elements in the sorted output. Mergesort is a divide and conquer algorithm that was invented by John von Neumann in 1945.

Reference: https://en.wikipedia.org/wiki/Merge_sort

All DiscussionsClick here to write answer

Answer: divide and conquer methodology Explanation: In computer science, merge sort (also commonly spelled mergesort) is an O(n log n) comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the implementation preserves the input order of equal elements in the sorted output. Mergesort is a divide and conquer algorithm that was invented by John von Neumann in 1945. Reference: https://en.wikipedia.org/wiki/Merge_sort Akilesh Kharvi ? answered Dec 8 '2016 at 22:9 All Comments

Post your answers here:

Post

Post your comments here:

Message

Post

Cancel