Date: 02/08/09 (Algorithms)    Keywords: no keywords

Let's say you have an array, which is sorted, and then some small number of the elements become corrupt, so the array is not sorted anymore. Is there some efficient way to sort it again that doesn't involve resorting the whole array? (You may not necessarily know which elements are corrupt)

Source: http://community.livejournal.com/algorithms/101636.html