forgot password | create account
about | help | code help+videos | done | prefs
CodingBat code practice


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 (ctrl-enter)

public boolean array6(int[] nums, int index) { }

Editor font size %:
Shorter output

Forget It! -- delete my code for this problem

Progress graphs:
 Your progress graph for this problem
 Random user progress graph for this problem
 Random Epic Progress Graph

Java Help

Misc Code Practice

Difficulty: 345.0

Copyright Nick Parlante 2017 - privacy