C++

Write a function cocktailSort that takes an array of integers and the number of elements in the array. Your function should sort the array using cocktail sort and print the number of comparisons and swaps (a "swap" is whenever two numbers change places). You should implement the cocktail sort algorithm with a flag. Note: You might also want to write and use a function that swaps two values Your function should not return anything but should display the sorted array, number of comparisons and the number of swaps executed. Your output should look like: Cocktail Sort: 1 1 2 3 3 3 3 4 4 5 6 77 7 89 10 13 15 17 Number of comparisons: