Q. Sort the sequence written below of keys using merge sort.

66, 77, 11, 88, 99, 22, 33, 44, 55                                                                     

Ans:

Sorting using Merge sort technique:-

Original File       [66] [77] [11] [88] [99] [22] [33] [44] [55]

Pass1     [66 77] [11 88] [22 99] [33 44] [55]

Pass2         [11 66   77   88] [22 33   44   99] [55]

Pass3         [11 22   33   44   66   77   88   99] [55]

Pass4   [11 22   33   44   55   66   77   88   99]

 

Posted Date: 7/10/2012 5:04:49 AM | Location : United States

Ask an Expert

Related Discussions:- Sort the Sequence Using Merge Sort, Assignment Help, Ask Question on Sort the Sequence Using Merge Sort, Get Answer, Expert's Help, Sort the Sequence Using Merge Sort Discussions

Write discussion on Sort the Sequence Using Merge Sort
Your posts are moderated

Write your message here..

Related Questions

Briefly explain the prim''s algorithm, Question 1 Describe the following- ... Question 1 Describe the following- Well known Sorting Algorithms Divide and Conquer Techniques Question 2 Describe in your own words the different asymptotic func

Efficient algorithms.., implementation of fast fourier transforms for non p... implementation of fast fourier transforms for non power of 2

linear-expected-time algorithm, Implement a linear-expected-time algorithm... Implement a linear-expected-time algorithm for selecting the k th smallest element Algorithm description 1. If |S| = 1, then k = 1 and return the element in S as the an

Addressing modes, Compare zero-address, one-address, two-address, and three... Compare zero-address, one-address, two-address, and three-address machines by writing programs to compute: Y = (A – B X C) / (D + E X F) for each of the four machines. The inst

Stack, Explain in detail the algorithmic implementation of multiple stacks.... Explain in detail the algorithmic implementation of multiple stacks.

Structured programming, What do you understand by term structured programmi... What do you understand by term structured programming? Explain the structured programming as well.                                 Ans. S tructured Programming is expla

Convertion, how we can convert a graph into tree how we can convert a graph into tree

Indexed sequential files, Indexed Sequential Files An index is inserted... Indexed Sequential Files An index is inserted to the sequential file to provide random access. An overflow area required to be maintained to permit insertion in sequence. I

Explain the assertions in ruby, Explain the Assertions in Ruby Ruby off... Explain the Assertions in Ruby Ruby offers no support for assertions whatever. Moreover, because it's weakly typed, Ruby doesn't even enforce rudimentary type checking on opera

Boundary tag system., boundary tag system in data structure? boundary tag system in data structure?