By using this site, you agree to our updated Privacy Policy and our Terms of Use. Manage your Cookies Settings.
446,148 Members | 1,339 Online
Bytes IT Community
+ Ask a Question
Need help? Post your question and get tips & solutions from a community of 446,148 IT Pros & Developers. It's quick & easy.

How to prove merge sort is stable

P: 1
I am trying to prove with writing code in a megre sort alogorithm code in order to show that is stable but I cannot manage.
Have you any idea how this is impmented? I know that I have to check for the same values but i donot know where in code of the mergesort. Can i keep the pointer of the unsorted list ?
thanks
Nov 4 '06 #1
Share this question for a faster answer!
Share on Google+

Post your reply

Sign in to post your reply or Sign up for a free account.