merge sort process for an example array {38, 27, 43, 3, 9, 82, 10}. If we take a closer look at the diagram, we can see that the array is recursively divided in two halves till the size becomes 1. Once the size becomes 1, the merge processes comes into action and starts merging arrays back till the complete array is merged.

Posted Date: 9/9/2016 1:44:12 PM | Location : USA

Ask an Expert

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

Write discussion on 2 way merge sort
Your posts are moderated

Write your message here..

Related Questions

Binary search tree, write an algorithm to delete an element x from binary... write an algorithm to delete an element x from binary search with time complex

Algorithms, Data array A has data series from 1,000,000 to 1 with step size... Data array A has data series from 1,000,000 to 1 with step size 1, which is in perfect decreasing order. Data array B has data series from 1 to 1,000,000, which is in random order.

frequenty count of function, Ask question find frequency count of function... Ask question find frequency count of function- {for(i=1;i {for(j=1;j {for(k=1;k } } }

Rl rotation - avl tree, Example: (Double left rotation while a new node is ... Example: (Double left rotation while a new node is added into the AVL tree (RL rotation)) Figure: Double left rotation when a new node is inserted into the AVL tree A

Recursive function , Q. Write down the recursive function to count the numb... Q. Write down the recursive function to count the number of the nodes in the binary tree.    A n s . R ecursive Function to count no. of Nodes in Binary Tree is writt

Structural Induction, Let a be a well-formed formula. Let c be the number o... Let a be a well-formed formula. Let c be the number of binary logical operators in a. (Recall that ?, ?, ?, and ? are the binary logical operators). Let s be the number of proposit

Graph representation, adjacency multi list adjacency multi list

How will you represent a max-heap sequentially, How will you represent a ma... How will you represent a max-heap sequentially? Max heap, also known as the descending heap, of size n is an almost complete binary tree of n nodes such that the content of eve

Inorder and preorder traversal to reconstruct a binary tree, Q. Using the f... Q. Using the following given inorder and preorder traversal reconstruct a binary tree Inorder sequence is D, G, B, H, E, A, F, I, C

Explain memory allocation strategies, Memory Allocation Strategies If i... Memory Allocation Strategies If it is not desirable to move blocks of due storage from one area of memory to another, it must be possible to relocate memory blocks that have be