title: How to test for stability in sorting algorithms?
body: <p>I'm currently trying to see if the algorithms I have wrote are stable. Most of my tests consist of creating an unsorted array of integer objects, cloning it, running my sort on the former version and arrays.sort on the one I want to be correctly sorted. Basically am wondering if there is a way with Integer objects or another data type that I can test for stability in my implementations of merge, insertion and others? Disproving it is fine too, I just want to see if I have written a defect in and thus its not stable. </p>
  
  <p>:Any object types work really, Im just using integers currently for ease of testing.</p>