merge sort is also called as
Answers
Answered by
0
Answer:
In computer science, merge sort (also commonly spelled mergesort) is an efficient, general-purpose, comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the order of equal elements is the same in the input and output.
Similar questions
Math,
28 days ago
Math,
28 days ago
English,
28 days ago
Social Sciences,
1 month ago
Math,
1 month ago
Social Sciences,
7 months ago
Music,
7 months ago