Add files via upload

Author: shatakshigarg

RECURSION 2/MERGE SORT.txt

@@ -0,0 +1,55 @@
+public class solution {
+
+	public static void mergeSort(int[] input){
+		// Write your code here
+        
+        if(input.length<=1)
+            return;
+        int mid=input.length/2;
+        int[] part1=new int[mid];
+        int[] part2=new int[input.length-mid];
+        for(int i=0;i<mid;i++)
+        {
+            part1[i]=input[i];
+        }
+        int k=0;
+        for(int i=mid;i<input.length;i++){
+            part2[k]=input[i];
+            k++;
+        }
+        mergeSort(part1);
+        mergeSort(part2);
+        merge(input,part1,part2);
+    }
+    private static void merge(int[] input,int part1[],int part2[]){
+
+        int i=0,j=0,k=0;
+        while(i<part1.length && j<part2.length){
+            if(part1[i]<part2[j])
+            {
+                input[k]=part1[i];
+                k++;
+                i++;
+            }
+            else {
+                input[k]=part2[j];
+                k++;
+                j++;
+            }
+        }
+        while(i<part1.length)
+        {
+            input[k]=part1[i];
+            k++;
+            i++;
+        }
+        while(j<part2.length){
+            input[k]=part2[j];
+            k++;
+            j++;
+        }
+
+
+		
+	}
+}

RECURSION 2/QUICK SORT.txt

@@ -0,0 +1,72 @@
+/*
+	To apply the method explained in the hint video, we have to add two more parameters in the function call. This can be done by calling a helper function from given function. The helper function can have three parameters: array, start index, end index.  
+	
+	Skeleton code to achieve this:
+	public class Solution {
+		public static void quickSort(int[] input, int startIndex, int endInedx) {
+			// your code goes here
+		}
+	
+		public static void quickSort(int[] input) {
+			quickSort(input, 0, input.length - 1);
+		}
+	
+	}
+	
+*/
+
+
+public class Solution {
+	
+	public static void quickSort(int[] input) {
+		/* Your class should be named Solution
+		 * Don't write main().
+		 * Don't read input, it is passed as function argument.
+		 * No need to print or return the output.
+		 * Taking input and printing output is handled automatically.
+		 */
+        quickSort(input,0,input.length-1);
+    }
+    public static void quickSort(int[] input,int sI,int eI){
+    //base case
+       if(sI>=eI)
+           return;
+        
+        int pivotPos=partition(input,sI,eI);
+        quickSort(input,sI,pivotPos-1);
+        quickSort(input,pivotPos+1,eI);
+    }
+    public static int partition(int input[],int sI,int eI)
+    {
+        int pivot=input[sI];
+        int count=0;
+        for(int i=sI+1;i<=eI;i++)
+        {
+            if(input[i]<=pivot)
+                count++;
+        }
+        int pivotPos=sI+count;
+        int temp=input[sI];
+        input[sI]=input[pivotPos];
+        input[pivotPos]=temp;
+        int i=sI;
+        int j=eI;
+        while(i<pivotPos && j>pivotPos)
+        {
+            if(input[i]<=input[pivotPos])
+                i++;
+            else if(input[j]>input[pivotPos])
+                j--;
+            else
+            {
+                int temp_=input[i];
+                input[i]=input[j];
+                input[j]=temp_;
+                i++;j--;
+                
+            }
+        }
+        return pivotPos;
+    }
+	
+}

RECURSION 2/REMOVE DUPLICATES RECURSIVELY.txt

@@ -0,0 +1,14 @@
+public class Solution {
+
+	public static String removeConsecutiveDuplicates(String s) {
+		// Write your code here
+			 if(s.length()<=1)
+            return s;
+        String smallans=removeConsecutiveDuplicates(s.substring(1));
+        if(smallans.charAt(0)==s.charAt(0))
+            return smallans;
+        else
+            return s.charAt(0)+smallans;
+	}
+
+}

RECURSION 2/REMOVE X.txt

@@ -0,0 +1,18 @@
+
+public class solution {
+
+	// Return the changed string
+	public static String removeX(String input){
+		// Write your code here
+        if(input.length()==0)
+            return input;
+
+        if(input.charAt(0)=='x')
+            return removeX(input.substring(1));
+
+        else
+            return input.charAt(0)+removeX(input.substring(1));
+
+
+	}
+}