Array Iteration, Linear Search, and Min/Max Algorithms

Beginner13 min read•Updated: 2026-10-22

🔍 Array Iteration, Linear Search, and Min/Max Algorithms

Introduction

Processing arrays involves traversing items to compute sums, find extremes (minimum and maximum), or locate specific elements via linear search.

💻 Full Implementation

1public class ArrayAlgorithms {
  public static void main(String[] args) {
      int[] marks = {65, 88, 42, 95, 73, 58, 91};
4 
      // 1. Finding Maximum and Minimum
      int max = marks[0];
      int min = marks[0];
      int sum = 0;
9 
      for (int score : marks) {
          if (score > max) max = score;
          if (score < min) min = score;
          sum += score;
      }
15 
      double average = (double) sum / marks.length;
17 
      System.out.println("Highest Mark: " + max);
      System.out.println("Lowest Mark:  " + min);
      System.out.printf("Average Score: %.2f%n", average);
21 
      // 2. Linear Search Algorithm:
      int target = 95;
      int foundIndex = -1;
25 
      for (int i = 0; i < marks.length; i++) {
          if (marks[i] == target) {
              foundIndex = i;
              break;
          }
      }
32 
      System.out.println("Target " + target + " found at index: " + foundIndex);
  }
35}

Next Lesson

Two-Dimensional Arrays (Matrices) and Jagged Arrays

Continue learning with hands-on practice, examples, and exercises in the upcoming topic.

Related Lessons

Previous Lesson	Next Lesson
Array Declaration, Allocation, and Default Values	Two-Dimensional Arrays (Matrices) and Jagged Arrays

Practice Quiz

Test your understanding of this lesson with 1 questions. Each question has one correct answer.

Previous Next

PreviousPrevNext

MSK Institute • Shikohabad

Loading Page Content...

Preparing courses, live labs, and learning resources.सामग्री लोड हो रही है, कृपया प्रतीक्षा करें...

Connecting serverPlease wait...

💻 Practical Labs🚀 Free Demo📜 Verified Certificates

Two-Dimensional Arrays (Matrices) and Jagged Arrays

Array Iteration, Linear Search, and Min/Max Algorithms

Beginner13 min read•Updated: 2026-10-22

Study Materials

🔍 Array Iteration, Linear Search, and Min/Max Algorithms

Introduction

Processing arrays involves traversing items to compute sums, find extremes (minimum and maximum), or locate specific elements via linear search.

💻 Full Implementation

1public class ArrayAlgorithms {
  public static void main(String[] args) {
      int[] marks = {65, 88, 42, 95, 73, 58, 91};
4 
      // 1. Finding Maximum and Minimum
      int max = marks[0];
      int min = marks[0];
      int sum = 0;
9 
      for (int score : marks) {
          if (score > max) max = score;
          if (score < min) min = score;
          sum += score;
      }
15 
      double average = (double) sum / marks.length;
17 
      System.out.println("Highest Mark: " + max);
      System.out.println("Lowest Mark:  " + min);
      System.out.printf("Average Score: %.2f%n", average);
21 
      // 2. Linear Search Algorithm:
      int target = 95;
      int foundIndex = -1;
25 
      for (int i = 0; i < marks.length; i++) {
          if (marks[i] == target) {
              foundIndex = i;
              break;
          }
      }
32 
      System.out.println("Target " + target + " found at index: " + foundIndex);
  }
35}

Next Lesson

Two-Dimensional Arrays (Matrices) and Jagged Arrays

Continue learning with hands-on practice, examples, and exercises in the upcoming topic.

Related Lessons

Previous Lesson	Next Lesson
Array Declaration, Allocation, and Default Values	Two-Dimensional Arrays (Matrices) and Jagged Arrays

Practice Quiz

Test your understanding of this lesson with 1 questions. Each question has one correct answer.

Previous Next