previous | start | next

Order of Growth 3

For N = 2k

        int sum = 0;
        for(int i = 1; i < N; i *= 2) {
           for(int j = 0; j < N; j++) {
              sum++;
           }
        }
     


previous | start | next