The program has four steps:

Read the size of an integer array, followed by the elements of the array $($no duplicates$).$

Output the array.

Perform an insertion sort on the array.

Output the number of comparisons and swaps performed.