Add Codes

Author: shub8968

genericprob/PermuationOfString.java

@@ -0,0 +1,7 @@
+package genericprob;
+
+public class PermuationOfString {
+
+
+
+}

genericprob/SubStringcheck.java

@@ -0,0 +1,10 @@
+package genericprob;
+
+public class SubStringcheck {
+	
+	public static void main(String[] args) {
+		String hashId = "12222/abddc.png";
+		String res = hashId.substring(hashId.indexOf("/") +1 ,hashId.indexOf("."));
+		System.out.println(res);
+	}
+}

BubbleSort.java javacodesds/BubbleSort.java

@@ -5,6 +5,7 @@
  */
 package javacodesds;
 
+import java.util.Arrays;
 import java.util.Scanner;
 
 /**
@@ -23,8 +24,8 @@ public void setArr(int[] arr) {
     {
         for (int i=0; i <arr.length-1;i++)
            {
-            for(int j=0; j<arr.length-i-1;j++)
-                
+            for(int j=0; j < arr.length-i-1;j++)
+
             {
              if(arr[j]>arr[j+1])
                  temp=arr[j+1];
@@ -33,7 +34,37 @@ public void setArr(int[] arr) {
             }
             }
         return arr;
+    
+
+    }
+    
+    public int [] selectionSort(int arr []){
+        
+        for(int i = 0 ; i < arr.length; i ++){
+            
+            int min = arr[i];
+            int index= i;
+            for(int j = i + 1; j < arr.length; j++){
+                
+                if(min > arr[j]){
+                    min = arr[j];
+                    index = j;
+                }
+                
+            }
+    
+            if(min != arr[i]){
+                int temp = arr[i];
+                arr[i] = arr[index];
+                arr[index] = temp;
+            }
+            
+        }
+    
+        System.out.println(Arrays.toString(arr));
+        return arr;
     }
+    //[-4,-1,0,3,10]
 }
 public class BubbleSort {
 
@@ -47,13 +78,13 @@ public static void main(String[] args) {
 
             }
 
-            m.setArr(arr);
+            m.selectionSort(arr);
             int arrb[]=new int[5];
             arrb=m.sort();
             System.out.println("Sorted array");
             for(int i=0;i<5;i++)
             {
-                System.out.print(arrb[i]+",");   
+                System.out.print(arrb[i]+",");
             }
 
         }

InsertionSort.java javacodesds/InsertionSort.java

@@ -23,7 +23,7 @@ public void mergeSort(int ar [],int m,int h)
      m=(l+h)/2;
      mergeSort(arr,l,m);
      mergeSort(arr,m+1,h);
-     merge(arr,l,m,h)   
+     merge(arr,l,m,h);
 
 
 
@@ -86,10 +86,5 @@ public void merge(int ar [],int l, int m, int h)
 
 
     }
-    {
-        
-    }
-}
-public class MergeSort {
-    
-}
+ 
+

JavaCodesDS.java javacodesds/JavaCodesDS.java

@@ -0,0 +1,27 @@
+package javacodesds;
+
+public class SelectionSortAlgo {
+
+public int [] selectionSort(int arr []){
+    
+    for(int i = 0 ; i < arr.length; i ++){
+        
+        int min = arr[i];
+        for(int j = i + 1; j < arr.length; j++){
+            
+            if(min > arr[j]){
+                min = arr[j];
+            }
+            if(min != arr[i]){
+                int temp = arr[j];
+                min = arr[i];
+                arr[i] = temp;
+            }
+        }
+       
+    }
+    
+    
+    return arr;
+}
+}

SearchArray.java javacodesds/LinearSearch.java

@@ -0,0 +1,77 @@
+package javacodesds;
+
+import java.util.Scanner;
+
+
+
+
+/**
+ *
+ * @author Shubham
+ */
+class SimpleSorting{
+    int arr[] = new int[5];
+    int temp;
+    
+    public void setArr(int[] arr) {
+        this.arr = arr;
+    }
+    
+    public int [] sort()
+    {
+//        for (int i=0; i <arr.length-1;i++)
+//           {
+//            for(int j=0; j<arr.length-i-1;j++)
+//
+//            {
+//             if(arr[j]>arr[j+1])
+//                 temp=arr[j+1];
+//             arr[j+1]=arr[j];
+//             arr[j]=temp;
+//            }
+//            }
+//        return arr;
+        
+        for(int i = 0 ; i < arr.length - 1; i++){
+            
+            
+            for(int j = i+1 ; j < arr.length; j++){
+                
+                if(arr [i] > arr [j]){
+                    
+                    int temp = arr [j];
+                    arr [j] = arr [i];
+                    arr [i] = temp;
+                }
+                
+            }
+        }
+        
+        return arr;
+    }
+    //[-4,-1,0,3,10]
+}
+public class SimpleSortingAlgo {
+    
+    public static void main(String[] args) {
+        {   int arr[]=new int[5];
+            MyBubbleSort m=new MyBubbleSort();
+            Scanner kb= new Scanner (System.in);
+            for (int i=0;i<5;i++)
+            {
+                arr[i]=kb.nextInt();
+                
+            }
+            
+            m.setArr(arr);
+            int arrb[]=new int[5];
+            arrb=m.sort();
+            System.out.println("Sorted array");
+            for(int i=0;i<5;i++)
+            {
+                System.out.print(arrb[i]+",");
+            }
+            
+        }
+    }
+}

LinkedList.java javacodesds/LinkedList.java

@@ -0,0 +1,7 @@
+package leetcode;
+
+public class MaximumSubArray {
+
+
+
+}

MergeSort.java javacodesds/MergeSort.java

@@ -0,0 +1,32 @@
+package recursion;
+
+public class BinarySearchUsingRecursion {
+	
+	
+	public static void main(String[] args) {
+	
+	
+	}
+	
+	public static int binarySearch(int arr[], int l, int r, int x) {
+		
+		int mid = l + r / 2;
+		
+		
+		if (l >= r) {
+			return -1;
+		}
+		
+		if (arr[mid] == x) {
+			return mid;
+		}
+		
+		if (x > arr[mid]) {
+			
+			return binarySearch(arr, l, mid - 1, x);
+		}
+		{
+			return binarySearch(arr, mid + 1, r, x);
+		}
+	}
+}

Queue.java javacodesds/Queue.java

@@ -0,0 +1,20 @@
+package recursion;
+
+public class DecimalToBinary {
+	
+	public static void main(String[] args) {
+	
+	String k = findBinary(100, "");
+		System.out.println(k);
+	}
+	
+	
+	private static String findBinary(int number, String result){
+		
+		if(number == 0){
+			return result;
+		}
+		result = number % 2 + result;
+		return findBinary(number/2, result);
+	}
+}

javacodesds/SelectionSortAlgo.java

@@ -0,0 +1,6 @@
+package recursion;
+
+public class Subset {
+
+
+}

javacodesds/SimpleSortingAlgo.java

@@ -0,0 +1,20 @@
+package recursion;
+
+public class SumOfNaturalNumbers {
+	
+	public static void main(String[] args) {
+		
+		int k = sum(0);
+		System.out.println(k);
+		
+	}
+	
+	private static int sum(int i){
+		
+		if(i==1){
+			return 1;
+		}
+		
+		return i + sum(i - 1);
+	}
+}