Question

Give an example of an o(n) algorithm and an o(n*n ) algorithm such that the former algorithm is slower.

Answer 1

boolean flag;

void algoA(int n) {

for (int i = 0; i < n; i++)

for (int j = 0; j < 1000000; j++)

flag = !flag;

void algoB(int n) {

for (int i = 0; i < n; i++)

for (int j = 0; j < n; j++)

flag = !flag;