Practice›Java Fundamentals›Module 5. Arrays & Lists›5.2 Array algorithms

Task 6 of 9 · 0 solved · 9 to go0%

1 2 3 4 567 8 9

You can read the problem, but answers are checked only for signed-in students. Sign in to answer →

5.2 Array algorithms — contains

Total: 0 / 3 pts

Practice mode — check each part and get hints as you go.

Task

Fill in contains so that it returns true when target appears in the array and false otherwise.

The program prints true and then false.

Your solution

public class Main {

    public static boolean contains(int[] arr, int target) {
        // return true if target appears in the array

    }

    public static void main(String[] args) {
        int[] nums = {1, 5, 9};
        System.out.println(contains(nums, 5));
        System.out.println(contains(nums, 7));
    }
}

Next task →