Krithikgokuls patch 4

Composition.java

@@ -0,0 +1,25 @@
+import java.util.Collections;
+import java.util.ArrayList;
+
+class Main {
+    public static void main(String[] args) {
+        // Creating an ArrayList
+        ArrayList<Integer> numbers = new ArrayList<>();
+        numbers.add(1);
+        numbers.add(2);
+        numbers.add(3);
+        numbers.add(2);
+        System.out.println("ArrayList1: " + numbers);
+
+        int count = Collections.frequency(numbers, 2);
+        System.out.println("Count of 2: " + count);
+
+        ArrayList<Integer> newNumbers = new ArrayList<>();
+        newNumbers.add(5);
+        newNumbers.add(6);
+        System.out.println("ArrayList2: " + newNumbers);
+
+        boolean value = Collections.disjoint(numbers, newNumbers);
+        System.out.println("Two lists are disjoint: " + value);
+    }
+}

Finding Extreme Values

@@ -0,0 +1,20 @@
+import java.util.Collections;
+import java.util.ArrayList;
+
+class Main {
+    public static void main(String[] args) {
+        // Creating an ArrayList
+        ArrayList<Integer> numbers = new ArrayList<>();
+        numbers.add(1);
+        numbers.add(2);
+        numbers.add(3);
+
+        // Using min()
+        int min = Collections.min(numbers);
+        System.out.println("Minimum Element: " + min);
+
+        // Using max()
+        int max = Collections.max(numbers);
+        System.out.println("Maximum Element: " + max);
+    }
+}

Routine Data Manipulation.java

@@ -0,0 +1,34 @@
+import java.util.Collections;
+import java.util.ArrayList;
+
+class Main {
+    public static void main(String[] args) {
+        // Creating an ArrayList
+        ArrayList<Integer> numbers = new ArrayList<>();
+        numbers.add(1);
+        numbers.add(2);
+        System.out.println("ArrayList1: " + numbers);
+
+        // Using reverse()
+        Collections.reverse(numbers);
+        System.out.println("Reversed ArrayList1: " + numbers);
+
+        // Using swap()
+        Collections.swap(numbers, 0, 1);
+        System.out.println("ArrayList1 using swap(): " + numbers);
+
+        ArrayList<Integer> newNumbers = new ArrayList<>();
+
+        // Using addAll
+        newNumbers.addAll(numbers);
+        System.out.println("ArrayList2 using addAll(): " + newNumbers);
+
+        // Using fill()
+        Collections.fill(numbers, 0);
+        System.out.println("ArrayList1 using fill(): " + numbers);
+
+        // Using copy()
+        Collections.copy(newNumbers, numbers);
+        System.out.println("ArrayList2 using copy(): " + newNumbers);
+    }
+}

Sorting Using sort().java

@@ -0,0 +1,21 @@
+import java.util.ArrayList;
+import java.util.Collections;
+
+class Main {
+    public static void main(String[] args) {
+
+        // Creating an array list
+        ArrayList<Integer> numbers = new ArrayList<>();
+
+        // Add elements
+        numbers.add(4);
+        numbers.add(2);
+        numbers.add(3);
+        System.out.println("Unsorted ArrayList: " + numbers);
+
+        // Using the sort() method
+        Collections.sort(numbers);
+        System.out.println("Sorted ArrayList: " + numbers);
+
+    }
+}