In R:

Compare the running times of the bubble sort and improved bubble sort algorithms.

Both algorithms are (n2). This means that the number of commands executed for a list of size n is approximately n2. This means that the number of commands executed for a list of size n is approximately n2.

x

system.time({bubble(x)})

The first part of this project is to fill out the table below. List Size Time to Sort Bubble Time to Sort Improved 10 100 1,000 10,000 12,000