Describe the merge sort algorithm.

1.	Describe the merge sort algorithm.
Answer» Merge sort (ALSO known as MERGESORT) is a general-purpose, comparison-based sorting algorithm developed in computer science. The majority of its implementations result in a stable sort, which indicates that the order of equal elements in the input and output is the same. In 1945, John von Neumann DEVISED the merge sort method, which is a divide and conquer algorithm. The following is how a merge sort WORKS conceptually: Separate the unsorted list into n sublists, each with one element (a list of one element is considered sorted). Merge sublists repeatedly to create new sorted sublists until only one SUBLIST remains. The sorted list will be displayed then. The time complexity of the Merge Sort Algorithm is O(nlog(n)) where n is the size of the list of the elements to be sorted while the space complexity of the Merge Sort Algorithm is O(n), that is, linear space complexity.

Answer»

Merge sort (ALSO known as MERGESORT) is a general-purpose, comparison-based sorting algorithm developed in computer science. The majority of its implementations result in a stable sort, which indicates that the order of equal elements in the input and output is the same. In 1945, John von Neumann DEVISED the merge sort method, which is a divide and conquer algorithm. The following is how a merge sort WORKS conceptually:

Separate the unsorted list into n sublists, each with one element (a list of one element is considered sorted).
Merge sublists repeatedly to create new sorted sublists until only one SUBLIST remains. The sorted list will be displayed then.

The time complexity of the Merge Sort Algorithm is O(nlog(n)) where n is the size of the list of the elements to be sorted while the space complexity of the Merge Sort Algorithm is O(n), that is, linear space complexity.

Discussion

No Comment Found

Related InterviewSolutions

What is the space complexity of the selection sort algorithm?
What is the space complexity of the insertion sort algorithm?
Describe the heap sort algorithm.
Define tree traversal and list some of the algorithms to traverse a binary tree.
Define insertion sort and selection sort.
Devise an algorithm to insert a node in a Binary Search Tree.
What are recursive algorithms? State the important rules which every recursive algorithm must follow.
Can we use the binary search algorithm for linked lists? Justify your answer.
Explain the Dijkstra's Algorithm to find the shortest path between a given node in a graph to any other node in the graph.
Write an algorithm to find the maximum subarray sum for a given array. In other words, find the maximum sum that can be achieved by taking contiguous elements from a given array of integers.