Java > Recursion-1 > array11
prev  |  next  |  chance

Given an array of ints, compute recursively the number of times that the value 11 appears in the array. We'll use the convention of considering only the part of the array that begins at the given index. In this way, a recursive call can pass index+1 to move down the array. The initial call will pass in index as 0. array11({1, 2, 11}, 0) → 1 array11({11, 11}, 0) → 2 array11({1, 2, 3, 4}, 0) → 0 ...Save, Compile, Run public int array11(int[] nums, int index) { } See also Java Example Code. Java help docs: If Boolean Logic | Strings | While and For Loops | Arrays and Loops prev  |  next  |  chance   |  CodingBat  >  Recursion-1

Forget It! -- delete my code for this problem 348.0

Copyright Nick Parlante 2006-10 - privacy