What is the space complexity class of the following algorithm? int getSum(int[] array) { int size...

Transcribed Image Text:

What is the space complexity class of the following algorithm? int getSum(int[] array) { int size = array.length; int sum = =0; for (int iterator = 0; iterator < size; iterator++) { sum += array[iterator]; } return sum; } What is the space complexity class of the following algorithm? int getSum(int[] array) { int size = array.length; int sum = =0; for (int iterator = 0; iterator < size; iterator++) { sum += array[iterator]; } return sum; }

Answer rating: 100% (QA)

The space complexity class of the given algorithm is O1 ... View the full answer