diff --git a/Algorithms/Sorting & Searching/binarySearch.java b/Algorithms/Sorting & Searching/binarySearch.java
new file mode 100644
index 0000000..af46a65
--- /dev/null
+++ b/Algorithms/Sorting & Searching/binarySearch.java	
@@ -0,0 +1,16 @@
+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 binarySearch()
+        int pos = Collections.binarySearch(numbers, 3);
+        System.out.println("The position of 3 is " + pos);
+    }
+}
diff --git a/shuffle.java b/shuffle.java
new file mode 100644
index 0000000..92d4a5b
--- /dev/null
+++ b/shuffle.java
@@ -0,0 +1,23 @@
+// Shuffling Using shuffle()
+
+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(1);
+        numbers.add(2);
+        numbers.add(3);
+        System.out.println("Sorted ArrayList: " + numbers);
+
+        // Using the shuffle() method
+        Collections.shuffle(numbers);
+        System.out.println("ArrayList using shuffle: " + numbers);
+
+    }
+}