| I believe the concept behind merge sort is you take TWO OR MORE already sorted lists and combine them into one, making sure the final list is sorted as well.
What's the prompt? Are you starting with two lists already sorted, or do you have to take an array of unsorted elements and make a recursive function that constructs a lot of lists and slowly adds them together?
The trick here is to watch the indexes and keep track of variables. (And of course know what the concept behind a merge sort is.) If you post code I'll be sure to cricitize it, otherwise look for other students or your professor. |