Question

HELP...I'm am unsure where to even start?
Use the merge sort algorithm to alphabetize the following names: Rachel, Sammy, Wilma, Tyrone, Carlos, Olga, Jasmine, Bethamy. SHOW ALL OF YOUR STEPS USED TO SORT THE LIST! (Show the list at each “outer loop” after you have merged lists of length 1 into pairs, then merged lists of length 2 into lists of length 4, then lists of length 4 into 8.

a) Pass 1 list:


b) Pass 2 list:


c) Pass 3 list:

Answer 1

Decompose the problem. Decomposing is breaking the problem down into more manageable pieces.

In this case, you need to create a data structure of these names. Sort them using Merge sort. After that, you can put in the code for the extra shows the lists ( probably the same code to output the list during development ).

Answer 2

So, the first item asking Pass 1 list? Would it be me taking the eight names and sorting them into two lists?

Answer 3

If you're not familiar with Merge sort, check out Wikipedia. I would write it recursively, which could bite me with your reporting requirement.

After rereading your original post, are you supposed to be writing a program? Which language? Or is it just to show the logic of merge sort?

One thing to remember about merge sort is that it doesn't really create any sort of sorted data until it's "coming back up".