you have to sort an array of 100,000 items in place. most items are already in the correct order, except that 10 pairs of random adjacent items have been swapped, which algorithm will sort the array the fastest (ie, with the fewest number of operations)?
