simona1@sfusd.edu searching > linearSearch
prev  |  next  |  chance

Searches for a target value in an array. Returns the index of the first target value in an array.Returns -1 if the target value is not in the array. The array will have a length >= 1. linearSearch([8, 3, -1, 7], 7) → 3 linearSearch([1, -1, -5, 7], 1) → 0 linearSearch([1, 1, 5, -7], 1) → 0 Go...Save, Compile, Run (ctrl-enter) public int linearSearch(int [] a, int target){ } Go Editor font size %:75100125150 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

• Java Example Solution Code
• Java String Introduction (video)
• Java Substring v2 (video)
• Java String Equals and Loops
• Java String indexOf and Parsing
• Java If and Boolean Logic
•   If Boolean Logic Example Solution Code 1 (video)
•   If Boolean Logic Example Solution Code 2 (video)
• Java For and While Loops
• Java Arrays and Loops
• Java Map Introduction
• Java Map WordCount
• Java Functional Mapping
• Java Functional Filtering

Misc Code Practice

• Code Badges
• Introduction to Mod (video)
• MakeBricks problem and solution (video x 2)
• FizzBuzz the famous code interview question (video)

Difficulty: 310

Copyright Nick Parlante 2017 - privacy