Merge sort is a sorting algorithm which uses the basic idea of divide and conquers. This algorithm initially divides the array into two halves, sorts them separately and then merges them together again. This method is recursive, with the base criterion-the number of elements in the array is not more than 1. Let us suppose variable low and high represents the index of the first and last element of the array respectively, the merge sort can be defined recursively as follows

If(low

Divide the list into two halves Mergesort the left half Mergesort the right half

Mergesort the two sorted halves into one sorted list

Endif.

 

 

Posted Date: 7/10/2012 3:32:11 AM | Location : United States

Ask an Expert

Related Discussions:- Merge sort, Assignment Help, Ask Question on Merge sort, Get Answer, Expert's Help, Merge sort Discussions

Write discussion on Merge sort
Your posts are moderated

Write your message here..

Related Questions

Write a program to create a hashed file, Write a program to create a hashed... Write a program to create a hashed file that stores the records currently in the file " data_2013 ". Records should use the same fixed-length schema given previously, and should ag

Function overloading, program on function loading program on function loading

Diophantine Equations, Implement algorithm to solve 5-1 fifth order equati... Implement algorithm to solve 5-1 fifth order equation given.

Process of decision making under uncertainty, (a) Describe the steps involv... (a) Describe the steps involved in the process of decision making under uncertainty. (b) Explain the following principles of decision making: (i) Laplace, (ii) Hurwicz. (c

Multikey file organization, what are the applications of multikey file orga... what are the applications of multikey file organization?

Make adjacency matrix for un-directed graph, Q. Describe the adjacency matr... Q. Describe the adjacency matrix and make the same for the given undirected graph.    Ans: The representation of Adjacency Matrix: This representation consists of

Explain graph traversal, Graph Traversal In many problems we wish to in... Graph Traversal In many problems we wish to investigate all the vertices in a graph in some systematic order. In graph we often do not have any single vertex singled out as spe

Delete a given specific node from a doubly linked list. , D elete a specif... D elete a specific Node from Double Linked List as follows DELETEDBL(INFO, FORW, BACK, START, AVAIL,LOC) 1. [Delete Node] Set FORW [ BACK [LOC]]:= FORW[LOC]& BACK [FORW[

Applications of the queue, Write down any four applications of the queues. ... Write down any four applications of the queues.                                                            Ans. A pp li cation of Queue is given below (i)  Queue is

What is a range - a structured type in ruby, Range: A Structured Type in Ru... Range: A Structured Type in Ruby Ruby has a numerous structured types, comprising arrays, hashes, sets, classes, streams, and ranges. In this section we would only discuss rang