|
|
Subject:
Data structure and algorithm
Category: Computers > Algorithms Asked by: math01-ga List Price: $3.00 |
Posted:
16 Jul 2003 07:57 PDT
Expires: 15 Aug 2003 07:57 PDT Question ID: 231620 |
Show the various sublists when performing merge-sort on the following sequence: 6, 8, 1, 3, 0, 3, 5, 12, 4. |
|
Subject:
Re: Data structure and algorithm
Answered By: answerguru-ga on 16 Jul 2003 11:21 PDT |
Hello math01-ga, Here is a parallel view of the sublists that are created during the mergesort process: 6, 8, 1, 3, 0, 3, 5, 12, 4 (6, 8, 1, 3, 0) (3, 5, 12, 4) ((6, 8, 1) (3, 0)) ((3, 5) (12, 4)) (((6, 8) (1)) (3, 0)) ((3, 5) (12, 4)) (((6, 8) (1)) (0, 3)) ((3, 5) (4, 12)) ((1,6,8) (0, 3)) ((3, 5) (4, 12)) (0,1,3,6,8) (3,4,5,12) 0, 1, 3, 3, 4, 5, 6, 8, 12 Hope you find this helpful :) answerguru-ga |
|
There are no comments at this time. |
If you feel that you have found inappropriate content, please let us know by emailing us at answers-support@google.com with the question ID listed above. Thank you. |
Search Google Answers for |
Google Home - Answers FAQ - Terms of Service - Privacy Policy |