Asorting algorithm takes 1 second to sort n =1000 items.

1) how many operations will be performed if the sorting algorithm is o(n2) (approximately)?

2) how long will it take to sort 10,000 items if the sorting algorithm is o(n2)?

3) how much time will one operation take if the sorting algorithm is o(n2)?

1.1,000,000,

2, 1 minute 40 secs

3.10^-6 secs

Step-by-step explanation:

sorting algorithm takes 1 second to sort n =1000 items.

1) How many operations will be performed if the sorting algorithm is O(n2) (approximately)?

2) How long will it take to sort 10,000 items if the sorting algorithm is O(n2)?

3) How much time will one operation take if the sorting algorithm is O(n2)?

algorithm takes time proportional to n^2,

1. then 1,000^2=1,000,000,

2. if it takes 1 secs to generate 1000 items

yhen n^2=1000^2=1000000  and 10,000^2=100,000,000.

Dividing  by  100. Therefore, the sorting algorithm would take

1 minute and 40 seconds to sort 10,000 items.

3. How much time will one operation take if the sorting algorithm is O(n2)?

1/1000^2

10^-6 secs to sort 1 operations

to find the perimeter of the rectangle this is the expression:

x-9+x-9+3x-4+3x-4=138

if we simplify it:

8x-26=138

remember, 138 is what it all adds up to

the length is 11.5cm

the width is 57.5cm

the area is 661.25cm^2

the answers might not be correct use at own risk