Question

Please answer ASAP Thank You

1Consider an algorithm that requires the following number of operations (time units) for these input sizes (n). The algorithm is ___________ .

Input size	Operations
100	100,000
400	100,000
1600	100,000

Group of answer choices

1.O(n²)

2.O(n)

3.O(log n)

4.O(n³)

5.O(1)

2The below algorithm contains nested loops.

for (int total = 1; total <= n; total++) {
    for (int samples = 0; samples < n; samples++) {
        for (int location = 1; location < 10; location++) {
            ...
        }
    }       
}

This algorithm has _____________ complexity.

Group of answer choices

1.O(10n)

2.O(n³)

3.O(n²)

4.O(n log n)

5.O(1)

3Bubble sort makes at most _____________ passes through an array to sort n items.

Group of answer choices

1.n²

2.n log n

3.n - 1

4.n - 3

5.log n

Answer 1

1 O(1)

explanation :- as we can see that on vary the input size the operation or time is constant so it is O(1)

2  O(n²)

expalnation

her T(n) = 10 n^2 = O(n²)

3 n²