Merge branch 'master' into SMJI/stack/min_max_const_time

Author: S-M-J-I

DIRECTORY.md

@@ -89,6 +89,7 @@
             * [DecimalToBinary](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/conversions/DecimalToBinary.java)
             * [DecimalToHexadecimal](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/conversions/DecimalToHexadecimal.java)
             * [DecimalToOctal](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/conversions/DecimalToOctal.java)
+            * [EndianConverter](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/conversions/EndianConverter.java)
             * [HexaDecimalToBinary](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/conversions/HexaDecimalToBinary.java)
             * [HexaDecimalToDecimal](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/conversions/HexaDecimalToDecimal.java)
             * [HexToOct](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/conversions/HexToOct.java)
@@ -99,6 +100,7 @@
             * [OctalToBinary](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/conversions/OctalToBinary.java)
             * [OctalToDecimal](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/conversions/OctalToDecimal.java)
             * [OctalToHexadecimal](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/conversions/OctalToHexadecimal.java)
+            * [PhoneticAlphabetConverter](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/conversions/PhoneticAlphabetConverter.java)
             * [RgbHsvConversion](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/conversions/RgbHsvConversion.java)
             * [RomanToInteger](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/conversions/RomanToInteger.java)
             * [TurkishToLatinConversion](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/conversions/TurkishToLatinConversion.java)
@@ -503,6 +505,12 @@
           * Recursion
             * [GenerateSubsets](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/Recursion/GenerateSubsets.java)
           * scheduling
+            * diskscheduling
+              * [CircularLookScheduling](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/scheduling/diskscheduling/CircularLookScheduling.java)
+              * [CircularScanScheduling](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/scheduling/diskscheduling/CircularScanScheduling.java)
+              * [LookScheduling](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/scheduling/diskscheduling/LookScheduling.java)
+              * [ScanScheduling](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/scheduling/diskscheduling/ScanScheduling.java)
+              * [SSFScheduling](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/scheduling/diskscheduling/SSFScheduling.java)
             * [EDFScheduling](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/scheduling/EDFScheduling.java)
             * [FCFSScheduling](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/scheduling/FCFSScheduling.java)
             * [HighestResponseRatioNextScheduling](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/scheduling/HighestResponseRatioNextScheduling.java)
@@ -728,6 +736,7 @@
             * [DecimalToBinaryTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/conversions/DecimalToBinaryTest.java)
             * [DecimalToHexadecimalTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/conversions/DecimalToHexadecimalTest.java)
             * [DecimalToOctalTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/conversions/DecimalToOctalTest.java)
+            * [EndianConverterTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/conversions/EndianConverterTest.java)
             * [HexaDecimalToBinaryTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/conversions/HexaDecimalToBinaryTest.java)
             * [HexaDecimalToDecimalTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/conversions/HexaDecimalToDecimalTest.java)
             * [HexToOctTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/conversions/HexToOctTest.java)
@@ -738,6 +747,7 @@
             * [OctalToBinaryTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/conversions/OctalToBinaryTest.java)
             * [OctalToDecimalTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/conversions/OctalToDecimalTest.java)
             * [OctalToHexadecimalTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/conversions/OctalToHexadecimalTest.java)
+            * [PhoneticAlphabetConverterTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/conversions/PhoneticAlphabetConverterTest.java)
             * [RomanToIntegerTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/conversions/RomanToIntegerTest.java)
             * [UnitConversionsTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/conversions/UnitConversionsTest.java)
             * [UnitsConverterTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/conversions/UnitsConverterTest.java)
@@ -919,6 +929,7 @@
             * [CeilTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/maths/CeilTest.java)
             * [CollatzConjectureTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/maths/CollatzConjectureTest.java)
             * [CombinationsTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/maths/CombinationsTest.java)
+            * [ConvolutionTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/maths/ConvolutionTest.java)
             * [CrossCorrelationTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/maths/CrossCorrelationTest.java)
             * [DeterminantOfMatrixTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/maths/DeterminantOfMatrixTest.java)
             * [DigitalRootTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/maths/DigitalRootTest.java)
@@ -1042,6 +1053,12 @@
           * Recursion
             * [GenerateSubsetsTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/Recursion/GenerateSubsetsTest.java)
           * scheduling
+            * diskscheduling
+              * [CircularLookSchedulingTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/scheduling/diskscheduling/CircularLookSchedulingTest.java)
+              * [CircularScanSchedulingTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/scheduling/diskscheduling/CircularScanSchedulingTest.java)
+              * [LookSchedulingTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/scheduling/diskscheduling/LookSchedulingTest.java)
+              * [ScanSchedulingTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/scheduling/diskscheduling/ScanSchedulingTest.java)
+              * [SSFSchedulingTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/scheduling/diskscheduling/SSFSchedulingTest.java)
             * [EDFSchedulingTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/scheduling/EDFSchedulingTest.java)
             * [FCFSSchedulingTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/scheduling/FCFSSchedulingTest.java)
             * [HighestResponseRatioNextSchedulingTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/scheduling/HighestResponseRatioNextSchedulingTest.java)

src/main/java/com/thealgorithms/conversions/EndianConverter.java

@@ -0,0 +1,23 @@
+package com.thealgorithms.conversions;
+
+/**
+ * Converts between big-endian and little-endian formats.
+ * Big-endian is the most significant byte first, while little-endian is the least significant byte first.
+ * Big-endian to little-endian: 0x12345678 -> 0x78563412
+ *
+ * Little-endian to big-endian: 0x12345678 -> 0x78563412
+ *
+ * @author Hardvan
+ */
+public final class EndianConverter {
+    private EndianConverter() {
+    }
+
+    public static int bigToLittleEndian(int value) {
+        return Integer.reverseBytes(value);
+    }
+
+    public static int littleToBigEndian(int value) {
+        return Integer.reverseBytes(value);
+    }
+}

src/main/java/com/thealgorithms/conversions/PhoneticAlphabetConverter.java

@@ -0,0 +1,68 @@
+package com.thealgorithms.conversions;
+
+import java.util.HashMap;
+import java.util.Map;
+
+/**
+ * Converts text to the NATO phonetic alphabet.
+ * Examples:
+ * "ABC" -> "Alpha Bravo Charlie"
+ * "Hello" -> "Hotel Echo Lima Lima Oscar"
+ * "123" -> "One Two Three"
+ * "A1B2C3" -> "Alpha One Bravo Two Charlie Three"
+ *
+ * @author Hardvan
+ */
+public final class PhoneticAlphabetConverter {
+    private PhoneticAlphabetConverter() {
+    }
+
+    private static final Map<Character, String> PHONETIC_MAP = new HashMap<>();
+
+    static {
+        PHONETIC_MAP.put('A', "Alpha");
+        PHONETIC_MAP.put('B', "Bravo");
+        PHONETIC_MAP.put('C', "Charlie");
+        PHONETIC_MAP.put('D', "Delta");
+        PHONETIC_MAP.put('E', "Echo");
+        PHONETIC_MAP.put('F', "Foxtrot");
+        PHONETIC_MAP.put('G', "Golf");
+        PHONETIC_MAP.put('H', "Hotel");
+        PHONETIC_MAP.put('I', "India");
+        PHONETIC_MAP.put('J', "Juliett");
+        PHONETIC_MAP.put('K', "Kilo");
+        PHONETIC_MAP.put('L', "Lima");
+        PHONETIC_MAP.put('M', "Mike");
+        PHONETIC_MAP.put('N', "November");
+        PHONETIC_MAP.put('O', "Oscar");
+        PHONETIC_MAP.put('P', "Papa");
+        PHONETIC_MAP.put('Q', "Quebec");
+        PHONETIC_MAP.put('R', "Romeo");
+        PHONETIC_MAP.put('S', "Sierra");
+        PHONETIC_MAP.put('T', "Tango");
+        PHONETIC_MAP.put('U', "Uniform");
+        PHONETIC_MAP.put('V', "Victor");
+        PHONETIC_MAP.put('W', "Whiskey");
+        PHONETIC_MAP.put('X', "X-ray");
+        PHONETIC_MAP.put('Y', "Yankee");
+        PHONETIC_MAP.put('Z', "Zulu");
+        PHONETIC_MAP.put('0', "Zero");
+        PHONETIC_MAP.put('1', "One");
+        PHONETIC_MAP.put('2', "Two");
+        PHONETIC_MAP.put('3', "Three");
+        PHONETIC_MAP.put('4', "Four");
+        PHONETIC_MAP.put('5', "Five");
+        PHONETIC_MAP.put('6', "Six");
+        PHONETIC_MAP.put('7', "Seven");
+        PHONETIC_MAP.put('8', "Eight");
+        PHONETIC_MAP.put('9', "Nine");
+    }
+
+    public static String textToPhonetic(String text) {
+        StringBuilder phonetic = new StringBuilder();
+        for (char c : text.toUpperCase().toCharArray()) {
+            phonetic.append(PHONETIC_MAP.getOrDefault(c, String.valueOf(c))).append(" ");
+        }
+        return phonetic.toString().trim();
+    }
+}

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

@@ -0,0 +1,80 @@
+package com.thealgorithms.scheduling.diskscheduling;
+
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.List;
+
+/**
+ * Circular Look Scheduling (C-LOOK) is a disk scheduling algorithm similar to
+ * the C-SCAN algorithm but with a key difference. In C-LOOK, the disk arm also
+ * moves in one direction to service requests, but instead of going all the way
+ * to the end of the disk, it only goes as far as the furthest request in the
+ * current direction. After servicing the last request in the current direction,
+ * the arm immediately jumps back to the closest request on the other side without
+ * moving to the disk's extreme ends. This reduces the unnecessary movement of the
+ * disk arm, resulting in better performance compared to C-SCAN, while still
+ * maintaining fair wait times for requests.
+ */
+public class CircularLookScheduling {
+    private int currentPosition;
+    private boolean movingUp;
+    private final int maxCylinder;
+
+    public CircularLookScheduling(int startPosition, boolean movingUp, int maxCylinder) {
+        this.currentPosition = startPosition;
+        this.movingUp = movingUp;
+        this.maxCylinder = maxCylinder;
+    }
+
+    public List<Integer> execute(List<Integer> requests) {
+        List<Integer> result = new ArrayList<>();
+
+        // Filter and sort valid requests in both directions
+        List<Integer> upRequests = new ArrayList<>();
+        List<Integer> downRequests = new ArrayList<>();
+
+        for (int request : requests) {
+            if (request >= 0 && request < maxCylinder) {
+                if (request > currentPosition) {
+                    upRequests.add(request);
+                } else if (request < currentPosition) {
+                    downRequests.add(request);
+                }
+            }
+        }
+
+        Collections.sort(upRequests);
+        Collections.sort(downRequests);
+
+        if (movingUp) {
+            // Process all requests in the upward direction
+            result.addAll(upRequests);
+
+            // Jump to the lowest request and process all requests in the downward direction
+            result.addAll(downRequests);
+        } else {
+            // Process all requests in the downward direction (in reverse order)
+            Collections.reverse(downRequests);
+            result.addAll(downRequests);
+
+            // Jump to the highest request and process all requests in the upward direction (in reverse order)
+            Collections.reverse(upRequests);
+            result.addAll(upRequests);
+        }
+
+        // Update current position to the last processed request
+        if (!result.isEmpty()) {
+            currentPosition = result.get(result.size() - 1);
+        }
+
+        return result;
+    }
+
+    public int getCurrentPosition() {
+        return currentPosition;
+    }
+
+    public boolean isMovingUp() {
+        return movingUp;
+    }
+}

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

@@ -0,0 +1,83 @@
+package com.thealgorithms.scheduling.diskscheduling;
+
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.List;
+
+/**
+ * Circular Scan Scheduling (C-SCAN) is a disk scheduling algorithm that
+ * works by moving the disk arm in one direction to service requests until
+ * it reaches the end of the disk. Once it reaches the end, instead of reversing
+ * direction like in the SCAN algorithm, the arm moves back to the starting point
+ * without servicing any requests. This ensures a more uniform wait time for all
+ * requests, especially those near the disk edges. The algorithm then continues in
+ * the same direction, making it effective for balancing service time across all disk sectors.
+ */
+public class CircularScanScheduling {
+    private int currentPosition;
+    private boolean movingUp;
+    private final int diskSize;
+
+    public CircularScanScheduling(int startPosition, boolean movingUp, int diskSize) {
+        this.currentPosition = startPosition;
+        this.movingUp = movingUp;
+        this.diskSize = diskSize;
+    }
+
+    public List<Integer> execute(List<Integer> requests) {
+        if (requests.isEmpty()) {
+            return new ArrayList<>(); // Return empty list if there are no requests
+        }
+
+        List<Integer> sortedRequests = new ArrayList<>(requests);
+        Collections.sort(sortedRequests);
+
+        List<Integer> result = new ArrayList<>();
+
+        if (movingUp) {
+            // Moving up: process requests >= current position
+            for (int request : sortedRequests) {
+                if (request >= currentPosition && request < diskSize) {
+                    result.add(request);
+                }
+            }
+
+            // Jump to the smallest request and continue processing from the start
+            for (int request : sortedRequests) {
+                if (request < currentPosition) {
+                    result.add(request);
+                }
+            }
+        } else {
+            // Moving down: process requests <= current position in reverse order
+            for (int i = sortedRequests.size() - 1; i >= 0; i--) {
+                int request = sortedRequests.get(i);
+                if (request <= currentPosition) {
+                    result.add(request);
+                }
+            }
+
+            // Jump to the largest request and continue processing in reverse order
+            for (int i = sortedRequests.size() - 1; i >= 0; i--) {
+                int request = sortedRequests.get(i);
+                if (request > currentPosition) {
+                    result.add(request);
+                }
+            }
+        }
+
+        // Set final position to the last request processed
+        if (!result.isEmpty()) {
+            currentPosition = result.get(result.size() - 1);
+        }
+        return result;
+    }
+
+    public int getCurrentPosition() {
+        return currentPosition;
+    }
+
+    public boolean isMovingUp() {
+        return movingUp;
+    }
+}