From ec9fd2975f29497fceb433bbfdaa0b5b06d5f62b Mon Sep 17 00:00:00 2001
From: ANANT JAIN <139585700+anant-jain01@users.noreply.github.com>
Date: Sun, 19 Oct 2025 14:05:20 +0530
Subject: [PATCH] Add files via upload

---
 coding_languages/Java/binarySearch.java  | 30 ++++++++++++++++++
 coding_languages/Java/bubbleSort.java    | 32 +++++++++++++++++++
 coding_languages/Java/insertionSort.java | 30 ++++++++++++++++++
 coding_languages/Java/selectionSort.java | 39 ++++++++++++++++++++++++
 4 files changed, 131 insertions(+)
 create mode 100644 coding_languages/Java/binarySearch.java
 create mode 100644 coding_languages/Java/bubbleSort.java
 create mode 100644 coding_languages/Java/insertionSort.java
 create mode 100644 coding_languages/Java/selectionSort.java

diff --git a/coding_languages/Java/binarySearch.java b/coding_languages/Java/binarySearch.java
new file mode 100644
index 0000000..44b60f7
--- /dev/null
+++ b/coding_languages/Java/binarySearch.java
@@ -0,0 +1,30 @@
+package function;
+import java.util.Scanner;
+public class binarySearch {
+    public static void main(String[] args) {
+    try(Scanner sc=new Scanner(System.in)){
+        int x=sc.nextInt();
+        int[] arr=new int[x];
+        for (int i = 0; i < arr.length; i++) {
+            arr[i]=sc.nextInt();
+        }
+        System.out.println("target:");
+        int target=sc.nextInt();
+        System.out.println(binary(arr,target));
+    }
+}
+    public static int binary(int[] arr,int target){
+        int low=0;int high=arr.length-1;
+        while(low<=high){
+            int mid=low-(high+low)/2;
+            if(arr[mid]==target)
+            return mid;
+            else if(arr[mid]>target)
+            high=mid-1;
+            else
+            low=mid+1;
+        }
+        return -1;
+
+}
+}
diff --git a/coding_languages/Java/bubbleSort.java b/coding_languages/Java/bubbleSort.java
new file mode 100644
index 0000000..38fb0b1
--- /dev/null
+++ b/coding_languages/Java/bubbleSort.java
@@ -0,0 +1,32 @@
+package function;
+import java.util.Scanner;
+
+public class bubbleSort {
+    public static void main(String[] args) {
+        try(Scanner sc=new Scanner(System.in)){
+        int i=sc.nextInt();
+        int[] arr=new int[i];
+        for (int j = 0; j < i; j++) {
+            System.out.println("number:");
+            arr[j] = sc.nextInt();
+        }
+        int[] num=bubble(arr);
+        System.out.println();
+        for (int j = 0; j < num.length; j++) {
+            System.out.println(num[j]);
+        }
+    }
+    }
+    public static int[] bubble(int[] arr){
+        for(int j=0;j<arr.length;j++){
+            for (int i = 0; i < arr.length-1; i++) {
+                if(arr[i]>arr[i+1]){
+                    int temp=arr[i];
+                    arr[i]=arr[i+1];
+                    arr[i+1]=temp;
+                }
+            }
+        }
+        return arr;
+    }
+}
diff --git a/coding_languages/Java/insertionSort.java b/coding_languages/Java/insertionSort.java
new file mode 100644
index 0000000..ecf586a
--- /dev/null
+++ b/coding_languages/Java/insertionSort.java
@@ -0,0 +1,30 @@
+package function;
+import java.util.Scanner;
+public class insertionSort {
+    public static void main(String[] args) {
+        try(Scanner sc=new Scanner(System.in)){
+            System.out.print("no of elements:");
+            int n=sc.nextInt();
+            int[] arr=new int[n];
+            for (int i = 0; i < arr.length; i++) {
+                System.out.print("number:");
+                arr[i]=sc.nextInt();
+            }
+            int[] nya=insertion(arr);
+            for (int j = 0; j < arr.length; j++) {
+                System.out.println(nya[j]);
+            }
+        }}
+        public static int[] insertion(int[] arr){
+            for (int j = 1; j < arr.length; j++) {
+                for (int i = j; i > 0 ; i--){
+                    if(arr[i]<arr[i-1]){
+                        int temp=arr[i];
+                        arr[i]=arr[i-1];
+                        arr[i-1]=temp;
+                    }
+                }
+            }
+            return arr;
+    }
+}
diff --git a/coding_languages/Java/selectionSort.java b/coding_languages/Java/selectionSort.java
new file mode 100644
index 0000000..b148385
--- /dev/null
+++ b/coding_languages/Java/selectionSort.java
@@ -0,0 +1,39 @@
+package function;
+
+import java.util.Scanner;
+
+public class selectionSort {
+    public static void main(String[] args) {
+        try(Scanner sc=new Scanner(System.in)){
+        int i=sc.nextInt();
+        int[] arr=new int[i];
+        for (int j = 0; j < i; j++) {
+            System.out.println("number:");
+            arr[j] = sc.nextInt();
+        }
+        int[] num=selection(arr);
+        System.out.println();
+        for (int j = 0; j < num.length; j++) {
+            System.out.println(num[j]);
+        }
+    }
+    }
+    public static int minimum(int[] arr,int i){
+        int min=i;
+        for (int j = i+1; j < arr.length; j++) {
+            if(arr[j]<arr[min])
+            min=j;
+        }
+        return min;
+    }
+    public static int[] selection(int[] arr){
+        for (int i = 0; i < arr.length; i++) {
+            int j=minimum(arr,i);
+            int temp=arr[j];
+            arr[j]=arr[i];
+            arr[i]=temp;
+        }
+        return arr;
+    }  
+    
+}