Recursion-1 > array6
prev  |  next  |  chance

Given an array of ints, compute recursively if the array contains a 6. 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. array6({1, 6, 4}, 0) → true array6({1, 4}, 0) → false array6({6}, 0) → true ...Save, Compile, Run public boolean array6(int[] nums, int index) { } See Also: Example Code Java help: If Boolean Logic | Strings | While and For Loops | Arrays and Loops prev  |  next  |  chance   |  JavaBat  >  Recursion-1

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

Copyright Nick Parlante 2006-09 - privacy