array6.java

//https://codingbat.com/prob/p108997
/*
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
*/
public boolean array6(int[] nums, int index) {
  
  if(nums==null || index >= nums.length) return false; //made a misatke here in the if condition
  //intially wrote index>nums.length which cause arrayindexoutofbounds error. Work on this.
  else if(nums[index]==6) return true;
  
  return array6(nums, ++index);
}