Question: b 2 Arrays (35p) Write down a function 'foo' that returns the number of times that in an array, the sum of three consecutive numbers
2 Arrays (35p) Write down a function 'foo' that returns the number of times that in an array, the sum of three consecutive numbers is NOT zero or is NOT smaller than 10. Ex: for the array [1 2 -3, 4, -1 96] the result is 1. int foo( int A[], int size ) {
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
