void countSwaps(vector<int> a) {
    int count = 0;
    for (int i = 0; i < a.size() - 1; i++) {
        for (int j = 0; j < a.size() - i - 1; j++) {
            if (a[j] > a[j + 1]) {
                swap(a[j],a[j+1]);
                count++;
            }
        }
    }
    cout << "Array is sorted in " << count << " swaps." << endl << "First Element: " << a[0] << endl << "Last Element: " << a[a.size()-1];
}

	public static void countSwaps(List<Integer> a) {

		int swaps = 0;

		for (int i = 0; i < a.size(); i++) {
			for (int j = 0; j < a.size() - 1; j++) {
				if (a.get(j) > a.get(j + 1)) {
					a.set(j + 1, a.set(j, a.get(j + 1)));
					swaps++;
				}
			}
		}

		System.out.println("Array is sorted in " + swaps + " swaps.");
		System.out.println("First Element: " + a.get(0));
		System.out.println("Last Element: " + a.get(a.size() - 1));

	}

#python3
def countSwaps(a):
    numSwaps=0
    n=len(a)
    for i in range(n):
        for j in range(0, n-1-i):
            if a[j] > a[j+1]:
                numSwaps+=1
                a[j+1], a[j]=a[j], a[j+1]
            else:
                pass
    last_element = a[-1]
    first_element = a[0]
    
    print(f'Array is sorted in {numSwaps} swaps.\nFirst Element: {first_element}\nLast Element: {last_element}')

    current_num = 0
    swap_num = 0

    # Make a number of checks and potential changes equal to the length of the
    # array.
    for i in range(len(a)):
        for j in range(len(a) - 1):
            if a[j] > a[j + 1]:
                # Store the current number before it changes.
                current_num = a[j]

                # Perform the swap.
                a[j] = a[j + 1]
                a[j + 1] = current_num

                # Count up 1 swap.
                swap_num += 1

    # Print out the statements.
    print(f"Array is sorted in {swap_num} swaps.")
    print(f"First Element: {a[0]}")
    print(f"Last Element: {a[len(a) - 1]}")
    return