Bubble Sort is an elementary sorting algorithm, which works by repeatedly exchanging adjacent elements, if necessary. When no exchanges are required, the file is sorted.

We assume list is an array of n elements.

Step $1$ Check if the first element in the input array is greater than the next element in the array.

Step $2$ If it is greater, swap the two elements; otherwise move the pointer forward in the array.

Step $3$ Repeat Step $2$ until we reach the end of the array.

Step $4$ The final output achieved is the sorted array.

Example:

Unsorted Array:

First Iteration:

After $2$nd Iteration:

A$)$ Define a function swap that swaps the values of the given array elements. Define your function in the functions section.

B$)$ Define a function bubbleSort that takes as input an unsorted array and outputs a sorted one. Define your function in the functions section and call it here. Use the unsorted array in the above example to test your function.