Engineering

Efrain Pugh

12 November, 23:37

The method Sum listed below returns the sum of integers between 1 and n. What is its order of growth? Create a new method that performs the same function that is a lower order of growth. public int Sum (int n) { int total = 0; for (i = 1; I < n; i++) total = total + i; return total; }