13.5: The Efficiency of RecursionPARTICIPATION13.5.3: Produce a non-recursive method for counting zeroes in an array.АCTIVITYHere is a recursive method for counting all zeroes in an array starting...

Extracted text: Section 13.5 - cSC 1351: Compute b Membership | bartleby E zyBooks Computer Science II for Majors home > 13.5: The Efficiency of Recursion PARTICIPATION 13.5.3: Produce a non-recursive method for counting zeroes in an array. АCTIVITY Here is a recursive method for counting all zeroes in an array starting with a given position: public static int zeroes (int[] a, int pos) { if (pos == a.length) { return 0; } int result = zeroes(a, pos + 1); if (alpos] == 0) { return result + 1; } else { return result; } Rearrange the following lines of code to produce a non-recursive version of this method. Not all lines are useful. Mouse: Drag/drop Keyboard: Grab/release Spacebar (or Enter ). Move 1D00 Cancel Esc Unused Arrays.java Load default template.. else import java.util.Scanner; return result; public class Arrays return result; public static void main (String [] args) Scanner in = new Scanner (System.in); int arraysige = in.nextInt(); int [] intAray new int [arraySizel; System.out.print ("Array contents: "); for (int i = 0; i < araysize;="" i++)="" for="" (int="" i="pos;" i="">< a.length;="" i++)="" intarray="" (i]="in.nextInt();" system.out.print(intarray(i]="" +"="" ");="" int="" result="0;" int="" result="zeroes" (a,="" pos="" +="" 1);="" int="" startingpos="in.nextInt();" system.out.printin("\nstarting="" position:="" "="" +="" start="" int="" numzeros="zeroes" (intarray,="" startingpos);="" public="" static="" int="" zeroes="" (int="" []="" a,="" int="" pos)="" if="" (alnosl="=" a)="" check="" feedback?="" participation="" 13.5.4:="" comparing="" the="" performance="" of="" the="" recursive="" and="" iterative="" solutions.="" аctivity="" macbook="" pro="" く="" @="" %23="" $="" %="" &="" 2="" 3="" 4="" 5="" 7="" w="" e="" r="" y="" u="" *="">


Extracted text: PARTICIPATION 13.5.3: Produce a non-recursive method for counting zeroes in an array. АCTIVITY Here is a recursive method for counting all zeroes in an array starting with a given position: public static int zeroes (int[] a, int pos) { if (pos == a.length) { return 0; } int result = zeroes(a, pos + 1); if (a[pos] == 0) { return result + 1; } else { return result; } Rearrange the following lines of code to produce a non-recursive version of this method. Not all lines are useful. Mouse: Drag/drop Keyboard: Grab/release Spacebar (or Enter). Move 0000 Cancel Esc Unused Arrays.java Load default template.. int result = 0; public static void main (String [] args) int result = zeroes (a, pos + 1); Scanner in = new Scanner(System.in); int arraySize = in.nextInt(): int [) intArray = new int [arraySizel; System.out.print("Array contents: "); for (int i = 0; i < arraysize;="" i++)="" public="" static="" int="" zeroes="" (int[]="" a,="" int="" pos)="" if="" (alpos)="=" 0)="" return="" result="" +="" 1;="" }="" intarray="" (i]="in.nextInt();" syste.="" out.print="" (intarray="" [i]="" +="" "="" ");="" if="" (ali]="=" 0)="" int="" startingpos="in.nextInt();" system.out.println("\nstarting="" position:="" "="" +="" start="" int="" numzeros="zeroes(intArray," startingpos);="" system.out.println("number="" of="" zeros="" found:="" "="" +="" nur="" result++;="" if="" (a[pos)="=" 0)="" result++;="" check="" feedback?="" participation="" 13.5.4:="" comparing="" the="" performance="" of="" the="" recursive="" and="" iterative="" solutions.="" activity="" macbook="" pro="" #3="" $="" 2="" 7="" 8="" w="" e="" r="" y="" p="">< co>