void func2(int array[], int n, int key) { int i=1; while (i
Posted: Mon Jun 06, 2022 2:20 pm
- Void Func2 Int Array Int N Int Key Int I 1 While I N If Key Array 0 I I N0 7 I I N Match The Follo 1 (18.76 KiB) Viewed 19 times
Options: O(key), O(n^{0.7}), O(n), O(1), O(log
n), O(n^{0.3}), O(n log n)
void func2(int array[], int n, int key) { int i=1; while (i <n) { if (key != array[0]) i=i+n0.7 i=i+n; } Match the following complexities. n^{x} denotes nª. Thus, n^{0.7} means nº.7 Best-case Worst-case } else
Posted: Mon Jun 06, 2022 2:20 pm
- Void Func2 Int Array Int N Int Key Int I 1 While I N If Key Array 0 I I N0 7 I I N Match The Follo 1 (18.76 KiB) Viewed 19 times
n), O(n^{0.3}), O(n log n)
void func2(int array[], int n, int key) { int i=1; while (i <n) { if (key != array[0]) i=i+n0.7 i=i+n; } Match the following complexities. n^{x} denotes nª. Thus, n^{0.7} means nº.7 Best-case Worst-case } else