6.5.2. Поиск минимума в диапазоне;

https://job4j.ru/profile/exercise/2/task-view/105

src/main/java/ru/j4j/array/MinDiapason.java

@@ -0,0 +1,13 @@
+package ru.j4j.array;
+
+public class MinDiapason {
+    public static int findMinDiapason(int[] array, int start, int finish) {
+        int min = array[start];
+        for (int i = start; i <= finish; i++) {
+            if (array[i] < min) {
+                min = array[i];
+            }
+        }
+        return min;
+    }
+}

src/test/java/ru/j4j/array/MinDiapasonTest.java

@@ -0,0 +1,37 @@
+package ru.j4j.array;
+
+import static org.assertj.core.api.Assertions.*;
+
+import org.junit.jupiter.api.Test;
+
+class MinDiapasonTest {
+    @Test
+    public void whenFirstMin() {
+        int[] array = new int[] {-1, 0, 5, 10};
+        int start = 1;
+        int finish = 3;
+        int result = MinDiapason.findMinDiapason(array, start, finish);
+        int expected = 0;
+        assertThat(result).isEqualTo(expected);
+    }
+
+    @Test
+    public void whenLastMin() {
+        int[] array = new int[] {10, 5, 3, 1};
+        int start = 1;
+        int finish = 3;
+        int result = MinDiapason.findMinDiapason(array, start, finish);
+        int expected = 1;
+        assertThat(result).isEqualTo(expected);
+    }
+
+    @Test
+    public void whenMiddleMin() {
+        int[] array = new int[] {10, 2, 5, 1};
+        int start = 0;
+        int finish = 2;
+        int result = MinDiapason.findMinDiapason(array, start, finish);
+        int expected = 2;
+        assertThat(result).isEqualTo(expected);
+    }
+}