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

 

sspiege3@schools.nyc.gov > indexSmallest
prev  |  next  |  chance

Given an array, detremine position of the minimum within a given section of the array. If a section has a minimum in two positions, return the position of the first occurance.


indexSmallest([3, -2, 6, 9, -2, -3, 0], 0, 2) → 1
indexSmallest([3, -2, 6, 9, -2, -3, 0], 0, 3) → 1
indexSmallest([3, -2, 6, 9, -2, -3, 0], 2, 3) → 2

...Save, Compile, Run (ctrl-enter)

public int indexSmallest(int[] arr, int lower, int upper) { }

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: 202

Copyright Nick Parlante 2017 - privacy