first commit

Linear Search/README.md

@@ -0,0 +1 @@
+1. https://leetcode.com/problems/two-sum/description/

Linear Search/practise.java

@@ -0,0 +1,30 @@
+import java.util.*;
+
+public class practise {
+
+    public static void bubbleSort(int arr[]) {
+        for(int turn=0; turn<arr.length-1; turn++) {
+            for(int j=0; j<arr.length-1-turn; j++) {
+                if(arr[j] > arr[j+1]) {
+                    //swap
+                    int temp = arr[j];
+                    arr[j] = arr[j+1];
+                    arr[j+1] = temp;
+                }
+            }
+        }
+    }
+
+    public static void printArr(int arr[]) {
+        for(int i=0; i<arr.length; i++) {
+            System.out.print(arr[i] + " ");
+        }
+        System.out.println();
+    }
+
+    public static void main(String[] args) {
+        int arr[] = {5, 4, 1, 3, 2};
+        bubbleSort(arr);
+        printArr(arr);
+    }
+}

Linear Search/question

@@ -0,0 +1,30 @@
+import java.util.*;
+
+public class practise {
+
+    public static void bubbleSort(int arr[]) {
+        for(int turn=0; turn<arr.length-1; turn++) {
+            for(int j=0; j<arr.length-1-turn; j++) {
+                if(arr[j] > arr[j+1]) {
+                    //swap
+                    int temp = arr[j];
+                    arr[j] = arr[j+1];
+                    arr[j+1] = temp;
+                }
+            }
+        }
+    }
+
+    public static void printArr(int arr[]) {
+        for(int i=0; i<arr.length; i++) {
+            System.out.print(arr[i] + " ");
+        }
+        System.out.println();
+    }
+
+    public static void main(String[] args) {
+        int arr[] = {5, 4, 1, 3, 2};
+        bubbleSort(arr);
+        printArr(arr);
+    }
+}

README.md

@@ -1,4 +1 @@
-# First-Contribution
-Hi this is Aryan and this is my contribution.
-This is my first contribution
-hello anuj thanks for this video. Very Helpful
+1. https://leetcode.com/problems/two-sum/description/