Define merge sort, Data Structure & Algorithms

Define Merge Sort

 Merge sort is a perfect example of a successful application of the divide and conquer method. It sorts a given array A[0...n-l] by separating it into two halves A[0...[n/2] - 1] and  A[[n/2]....n-l], sorting each of them recursively, and then merging the two smaller sorted arrays into a single sorted one.


Posted Date: 7/27/2013 5:36:41 AM | Location : United States

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

Write discussion on Define merge sort
Your posts are moderated
Related Questions
example of stack using flowchart

Implementation of queue using a singly linked list: While implementing a queue as a single liked list, a queue q consists of a list and two pointers, q.front and q.rear.

Ask queConsider the following functional dependencies: Applicant_ID -> Applicant_Name Applicant_ID -> Applicant_Address Position_ID -> Positoin_Title Position_ID -> Date_Position_O

Define Hashing. Store the following values in a hash table of table size 11 using division method: 25, 42, 96, 101, 102, 162, and 197. In case of collision, use other hash functio

The  total  of  time  needed  by  an algorithm to run to its completion is termed as time complexity. The asymptotic running time of an algorithm is given in terms of functions. Th

Q. Explain quick sort? Sort the given array using quick sort method. 24 56 47 35 10 90 82 31

Full Binary Trees: A binary tree of height h that had 2h -1 elements is called a Full Binary Tree. Complete Binary Trees: A binary tree whereby if the height is d, and all of

write a c++ program to find out the area of a curve y=f(x) between x=a and x=b

Two-dimensional array is shown in memory in following two ways:  1.  Row major representation: To achieve this linear representation, the first row of the array is stored in th

Q. Sort the sequence written below of keys using merge sort. 66, 77, 11, 88, 99, 22, 33, 44, 55                                                                      Ans: