Merge pull request #253 from Dipit12/main

feat: added code for Moore voting algorithm in java

Author: Pradeepsingh61

Java/algorithms/arrays/MooreVoting.java

@@ -0,0 +1,43 @@
+public class MooreVoting {
+
+    public static Integer findMajorityElement(int[] nums) {
+        // Phase 1: Find candidate
+        int candidate = 0, count = 0;
+
+        for (int num : nums) {
+            if (count == 0) {
+                candidate = num;
+            }
+            if (num == candidate) {
+                count++;
+            } else {
+                count--;
+            }
+        }
+
+        // Phase 2: Verify candidate
+        count = 0;
+        for (int num : nums) {
+            if (num == candidate) {
+                count++;
+            }
+        }
+
+        if (count > nums.length / 2) {
+            return candidate;
+        } else {
+            return null; // No majority element
+        }
+    }
+
+    public static void main(String[] args) {
+        int[] nums = {2, 2, 1, 1, 2, 2, 2};
+        Integer majority = findMajorityElement(nums);
+
+        if (majority != null) {
+            System.out.println("Majority Element: " + majority);
+        } else {
+            System.out.println("No Majority Element exists");
+        }
+    }
+}

Java/algorithms/sorting/DutchFlag.java

@@ -0,0 +1,41 @@
+public class DutchFlag {
+
+    public static void sortColors(int[] nums) {
+        int low = 0, mid = 0, high = nums.length - 1;
+
+        while (mid <= high) {
+            switch (nums[mid]) {
+                case 0:
+                    // swap nums[low] and nums[mid]
+                    int temp0 = nums[low];
+                    nums[low] = nums[mid];
+                    nums[mid] = temp0;
+                    low++;
+                    mid++;
+                    break;
+
+                case 1:
+                    mid++;
+                    break;
+
+                case 2:
+                    // swap nums[mid] and nums[high]
+                    int temp2 = nums[mid];
+                    nums[mid] = nums[high];
+                    nums[high] = temp2;
+                    high--;
+                    break;
+            }
+        }
+    }
+
+    public static void main(String[] args) {
+        int[] nums = {2, 0, 2, 1, 1, 0};
+        sortColors(nums);
+
+        System.out.print("Sorted array: ");
+        for (int num : nums) {
+            System.out.print(num + " ");
+        }
+    }
+}