def bubblesort(A):

n = len(A)

for x in range(n):

for y in range(0, n-x-1):

if A[y] > A[y+1] :

A[y], A[y+1] = A[y+1], A[y]

So basically I need to test the timecomplexity of the bubble sort function that I included with Nintegers. On python

Pseucode for testing time complexity This cell shall include the pseudo code to test the time complexity • The input is the total number of integers to be generated (N). • The return is the amount of time used to sort N integers. • You will need to generate an array of N random integers. • To determine the amount of time for sorting, you need to record the time before and after you call the sorting function. Testing complexity To test the complexity of the bubble sort algorithm, you need to call the test function with the following N: • 1000 2000 3000 4000 5000 6000 7000 • 8000 • 9000 • 10000 You need to store the time results in a list for future usage. Show transcribed image text Pseucode for testing time complexity This cell shall include the pseudo code to test the time complexity • The input is the total number of integers to be generated (N). • The return is the amount of time used to sort N integers. • You will need to generate an array of N random integers. • To determine the amount of time for sorting, you need to record the time before and after you call the sorting function.

Testing complexity To test the complexity of the bubble sort algorithm, you need to call the test function with the following N: • 1000 2000 3000 4000 5000 6000 7000 • 8000 • 9000 • 10000 You need to store the time results in a list for future usage.

## Expert Answer

Answer to def bubblesort(A): n = len(A) for x in range(n): for y in range(0, n-x-1): if A[y] > A[y+1] : A[y], A[y+1] = A[y+1], A[y…