In terms of a list of objects with two separate fields, suppose a stable sort would order the list in increasing order. However, if two elements have the same number, then they'll appear in the same order as in the unsorted list.
I'm confused by what property of the Merge procedure is required for the stability of MergeSort. why? How is this proven? We talked about this in class but i don't understand the concept
- I have trouble with induction as well. Please help.