 Unstable sorting algorithms can be specially implemented to be stable.One way of doing this is to artificially extend the key comparison, so that comparisons between two objects with otherwise equal keys are decided using the order of the entries in the original input list as a tie-breaker.Remembering this order, however, may require additional time and space.