The best general purpose algorithm to sort a large array of integers is The best algorithm to sort a nearly sorted array is The algorithm which performs least number of swaps (think average or worst case) A heap data structure can be used for sorting Mergesort is good for sorting objects whereas quicksort is good for sorting numbers