Update code

Author: xuyang471

src/main/java/com/thealgorithms/scheduling/diskscheduling/CircularScanScheduling.java

@@ -37,7 +37,7 @@ public List<Integer> execute(List<Integer> requests) {
         if (movingUp) {
             // Moving up: process requests >= current position
             for (int request : sortedRequests) {
-                if (request >= currentPosition) {
+                if (request >= currentPosition && request < diskSize) {
                     result.add(request);
                 }
             }

src/main/java/com/thealgorithms/scheduling/diskscheduling/LookScheduling.java

@@ -11,12 +11,12 @@
  * and once it processes all requests in that direction, it reverses the direction.
  */
 public class LookScheduling {
-
     private final int maxTrack;
     private final int currentPosition;
     private boolean movingUp;
     private int farthestPosition;
 
+
     public LookScheduling(int startPosition, boolean initialDirection, int maxTrack) {
         this.currentPosition = startPosition;
         this.movingUp = initialDirection;
@@ -36,10 +36,12 @@ public List<Integer> execute(List<Integer> requests) {
 
         // Split requests into two lists based on their position relative to current position
         for (int request : requests) {
-            if (request < currentPosition) {
-                lower.add(request);
-            } else {
-                upper.add(request);
+            if (request >= 0 && request < maxTrack) {
+                if (request < currentPosition) {
+                    lower.add(request);
+                } else {
+                    upper.add(request);
+                }
             }
         }
 

src/test/java/com/thealgorithms/scheduling/diskscheduling/SSFSchedulingTest.java

@@ -52,5 +52,4 @@ public void testGetCurrentPositionAfterExecution() {
         int currentPosition = scheduler.getCurrentPosition();
         assertEquals(10, currentPosition, "Current position should be the last request after execution.");
     }
-
- }
+}