Merge branch 'master' into test/CRCAlgorithmTest

Author: alxkm

src/test/java/com/thealgorithms/bitmanipulation/ParityCheckTest.java

@@ -6,10 +6,30 @@
 import org.junit.jupiter.api.Test;
 
 public class ParityCheckTest {
+    @Test
+    public void testIsEvenParity() {
+        assertTrue(ParityCheck.checkParity(0)); // 0 -> 0 ones
+        assertTrue(ParityCheck.checkParity(3)); // 11 -> 2 ones
+        assertTrue(ParityCheck.checkParity(5)); // 101 -> 2 ones
+        assertTrue(ParityCheck.checkParity(10)); // 1010 -> 2 ones
+        assertTrue(ParityCheck.checkParity(15)); // 1111 -> 4 ones
+        assertTrue(ParityCheck.checkParity(1023)); // 10 ones
+    }
+
     @Test
     public void testIsOddParity() {
-        assertTrue(ParityCheck.checkParity(5)); // 101 has 2 ones (even parity)
-        assertFalse(ParityCheck.checkParity(7)); // 111 has 3 ones (odd parity)
-        assertFalse(ParityCheck.checkParity(8)); // 1000 has 1 one (odd parity)
+        assertFalse(ParityCheck.checkParity(1)); // 1 -> 1 one
+        assertFalse(ParityCheck.checkParity(2)); // 10 -> 1 one
+        assertFalse(ParityCheck.checkParity(7)); // 111 -> 3 ones
+        assertFalse(ParityCheck.checkParity(8)); // 1000 -> 1 one
+        assertFalse(ParityCheck.checkParity(11)); // 1011 -> 3 ones
+        assertFalse(ParityCheck.checkParity(31)); // 11111 -> 5 ones
+    }
+
+    @Test
+    public void testLargeNumbers() {
+        assertTrue(ParityCheck.checkParity(0b10101010)); // 4 ones
+        assertFalse(ParityCheck.checkParity(0b100000000)); // 1 one
+        assertTrue(ParityCheck.checkParity(0xAAAAAAAA)); // Alternating bits, 16 ones
     }
 }

src/test/java/com/thealgorithms/datastructures/lists/SortedLinkedListTest.java

@@ -128,4 +128,81 @@ public void testIsEmptyAfterDeletion() {
         list.delete(10);
         assertTrue(list.isEmpty());
     }
+
+    @Test
+    public void testInsertNegativeNumbers() {
+        list.insert(-10);
+        list.insert(-5);
+        list.insert(-20);
+        assertEquals("[-20, -10, -5]", list.toString());
+    }
+
+    @Test
+    public void testInsertMixedPositiveAndNegativeNumbers() {
+        list.insert(0);
+        list.insert(-1);
+        list.insert(1);
+        assertEquals("[-1, 0, 1]", list.toString());
+    }
+
+    @Test
+    public void testMultipleDeletesUntilEmpty() {
+        list.insert(2);
+        list.insert(4);
+        list.insert(6);
+        assertTrue(list.delete(4));
+        assertTrue(list.delete(2));
+        assertTrue(list.delete(6));
+        assertTrue(list.isEmpty());
+        assertEquals("[]", list.toString());
+    }
+
+    @Test
+    public void testDeleteDuplicateValuesOnlyDeletesOneInstance() {
+        list.insert(5);
+        list.insert(5);
+        list.insert(5);
+        assertTrue(list.delete(5));
+        assertEquals("[5, 5]", list.toString());
+        assertTrue(list.delete(5));
+        assertEquals("[5]", list.toString());
+        assertTrue(list.delete(5));
+        assertEquals("[]", list.toString());
+    }
+
+    @Test
+    public void testSearchOnListWithDuplicates() {
+        list.insert(7);
+        list.insert(7);
+        list.insert(7);
+        assertTrue(list.search(7));
+        assertFalse(list.search(10));
+    }
+
+    @Test
+    public void testToStringOnEmptyList() {
+        assertEquals("[]", list.toString());
+    }
+
+    @Test
+    public void testDeleteAllDuplicates() {
+        list.insert(4);
+        list.insert(4);
+        list.insert(4);
+        assertTrue(list.delete(4));
+        assertTrue(list.delete(4));
+        assertTrue(list.delete(4));
+        assertFalse(list.delete(4)); // nothing left to delete
+        assertEquals("[]", list.toString());
+    }
+
+    @Test
+    public void testInsertAfterDeletion() {
+        list.insert(1);
+        list.insert(3);
+        list.insert(5);
+        assertTrue(list.delete(3));
+        list.insert(2);
+        assertEquals("[1, 2, 5]", list.toString());
+    }
 }