## Project: Bubble Sort

The [[Bubble sort]] is perhaps the easiest sort to implement. Write a function that takes a list of integers and sorts the list, in place, using a bubble sort. Test the function by creating a random list of integers, print the random list, sort the list, then print out the sorted list. Accept the number of integers to put in the list and the maximum integer to randomly generate on the command line. What is the worst case performance of the Bubble sort?

## Output

$

**g++ -std=c++17 BubbleSort.cpp -o BubbleSort -lfmt**$**./BubbleSort 10 10**Random List [6, 3, 7, 5, 3, 8, 8, 0, 2, 4] Sorted List [0, 2, 3, 3, 4, 5, 6, 7, 8, 8] $**g++ -std=c++17 BubbleSort.cpp -o BubbleSort -lfmt**$**./BubbleSort 20 100**Random List [63, 46, 50, 3, 89, 4, 88, 74, 96, 43, 74, 63, 78, 47, 33, 27, 37, 20, 41, 98] Sorted List [3, 4, 20, 27, 33, 37, 41, 43, 46, 47, 50, 63, 63, 74, 74, 78, 88, 89, 96, 98]