Which of the following algorithm is best suited for the case where swap operation is expensive?

• A. bubble sort
• B. cycle sort
• C. cocktail sort
• D. merge sort