for (int j = 1 to n) { int k = j while (k < n) { Sum += a[k]*b[k] k += sqrt n } }

Time complexity of this code