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
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 w hat are the stacks? How can we use the stacks  to check whether an expression is correctly parentheses or not. For example (()) is well formed but (() or )()( is not w

Define Strictly Binary Tree Strictly Binary Tree: - If each non leaf node in binary tree has non empty left and right sub-trees , then the tree is known as a strictly binary t


what algorithms can i use for the above title in my project desing and implmentation of road transport booking system

Q. Enumerate number of operations possible on ordered lists and arrays.  Write procedures to insert and delete an element in to array.

Q. What do you understand by the tree traversal? Write down the procedure for traversing a binary tree in preorder and execute it on the following tree.    Ans: Th

explain the prims''s algorithm with suitable example?

To delete an element in the list at the end, we can delete it without any difficult. But, assume if we desire to delete the element at the straining or middle of the list, then, we

Explain All-pair shortest-paths problem Given a weighted linked graph (undirected or directed), the all pairs shortest paths problem asks to find the distances (the lengths of