Formatted the code manually

Author: audhee

src/test/java/com/thealgorithms/maths/BinaryPowTest.java

@@ -7,18 +7,15 @@
 
 public class BinaryPowTest {
 
-    // --- Existing Tests (from your provided code) ---
     @Test
     @DisplayName("Original tests for common cases")
     void testBinPow() {
-        assertEquals(4, BinaryPow.binPow(2, 2)); // No 'L' needed for int literals
+        assertEquals(4, BinaryPow.binPow(2, 2));
         assertEquals(256, BinaryPow.binPow(4, 4));
         assertEquals(729, BinaryPow.binPow(9, 3));
         assertEquals(262144, BinaryPow.binPow(8, 6));
     }
 
-    // --- New Comprehensive Tests (integrated and adjusted for binPow(int, int)) ---
-
     @Test
     @DisplayName("binPow(2, 3) should return 8")
     void testBinPow_basicCase1() {
@@ -37,19 +34,16 @@ void testBinPow_basicCase3() {
         assertEquals(10000, BinaryPow.binPow(10, 4));
     }
 
-    // --- Edge Cases and Special Values ---
-
     @Test
     @DisplayName("binPow(base, 0) should return 1 for non-zero base")
     void testBinPow_exponentZero() {
         assertEquals(1, BinaryPow.binPow(5, 0));
         assertEquals(1, BinaryPow.binPow(1, 0));
         assertEquals(1, BinaryPow.binPow(-10, 0));
-        // Removed Long.MAX_VALUE as it exceeds int range
     }
 
     @Test
-    @DisplayName("binPow(0, 0) should return 1 (as per common convention for this algorithm)")
+    @DisplayName("binPow(0, 0) should return 1 (as per convention)")
     void testBinPow_zeroToThePowerOfZero() {
         assertEquals(1, BinaryPow.binPow(0, 0));
     }
@@ -107,8 +101,6 @@ void testBinPow_negativeBaseOddExponent() {
         assertEquals(-243, BinaryPow.binPow(-3, 5));
     }
 
-    // --- Exception Handling for Negative Exponent ---
-
     @Test
     @DisplayName("Should throw IllegalArgumentException for negative exponent")
     void testBinPow_negativeExponentThrowsException() {
@@ -118,19 +110,15 @@ void testBinPow_negativeExponentThrowsException() {
         assertThrows(IllegalArgumentException.class, () -> BinaryPow.binPow(1, -2));
     }
 
-    // --- Large Number Tests (within int range, careful with potential overflow) ---
-
     @Test
-    @DisplayName("binPow(2, 30) should return 1073741824 (fits in int)")
+    @DisplayName("binPow(2, 30) should return 1073741824")
     void testBinPow_largeExponentFitsInInt() {
-        // 2^30 = 1,073,741,824, which fits within Integer.MAX_VALUE (2,147,483,647)
         assertEquals(1073741824, BinaryPow.binPow(2, 30));
     }
 
     @Test
-    @DisplayName("binPow(7, 10) should return 282475249 (fits in int)")
+    @DisplayName("binPow(7, 10) should return 282475249")
     void testBinPow_anotherLargeExponentFitsInInt() {
-        // 7^10 = 282,475,249, which fits within Integer.MAX_VALUE
         assertEquals(282475249, BinaryPow.binPow(7, 10));
     }
-}
+}