darecoder
diff --git a/‎.idea/workspace.xml
Copy file name to clipboardExpand all lines: .idea/workspace.xml
+80-25Lines changed: 80 additions & 25 deletions b/‎.idea/workspace.xml
Copy file name to clipboardExpand all lines: .idea/workspace.xml
+80-25Lines changed: 80 additions & 25 deletions
diff --git a/‎out/production/Crux/META-INF/Crux.kotlin_module
Copy file name to clipboard
-16 Bytes b/‎out/production/Crux/META-INF/Crux.kotlin_module
Copy file name to clipboard
-16 Bytes
diff --git a/‎out/production/Crux/com/company/Lecture12/EditDistance.class
Copy file name to clipboard
8 Bytes b/‎out/production/Crux/com/company/Lecture12/EditDistance.class
Copy file name to clipboard
8 Bytes
diff --git a/‎src/com/company/Lecture11/MergeSort.java
Copy file name to clipboardExpand all lines: src/com/company/Lecture11/MergeSort.java
+1-6Lines changed: 1 addition & 6 deletions b/‎src/com/company/Lecture11/MergeSort.java
Copy file name to clipboardExpand all lines: src/com/company/Lecture11/MergeSort.java
+1-6Lines changed: 1 addition & 6 deletions
diff --git a/‎src/com/company/Lecture11/QuickSort.java
Copy file name to clipboardExpand all lines: src/com/company/Lecture11/QuickSort.java
+2-8Lines changed: 2 additions & 8 deletions b/‎src/com/company/Lecture11/QuickSort.java
Copy file name to clipboardExpand all lines: src/com/company/Lecture11/QuickSort.java
+2-8Lines changed: 2 additions & 8 deletions
@@ -7,14 +7,10 @@ public static void main(String[] args) {
         int[] nums = {3,8,1,9,2};
         nums = mergeSort(nums);
         System.out.println(Arrays.toString(nums));
-
     }
 
     public static int[] mergeSort(int[] nums){
-        if(nums.length < 2){
-            return nums;
-        }
-
+        if(nums.length < 2) return nums;
         int mid = nums.length/2;
 
         int[] first = Arrays.copyOfRange(nums,0,mid);
@@ -30,7 +26,6 @@ public static int[] merge(int[] first, int[] second){
         int i=0,j=0,k=0;
         int[] res = new int[first.length+second.length];
 
-
         while(i < first.length && j < second.length){
             if(first[i] < second[j]){
                 res[k++] = first[i++];
 
@@ -24,20 +24,14 @@ public static void quicksort(int[] nums,int start, int end){
     }
 
     public static int pivot(int[] nums,int start,int end){
-//        int p = start;
-//
-//        ArrayIntro.swap(nums,p,end);
-
-        int p = end;
         int j=start;
-
         for (int i = start; i <= end; i++) {
-            if(nums[i] < nums[p]) {
+            if(nums[i] < nums[end]) {
                 ArrayIntro.swap(nums, i, j);
                 j++;
             }
         }
-        ArrayIntro.swap(nums,p,j);
+        ArrayIntro.swap(nums, end,j);
         return j;
     }
 }
Original file line number	Diff line number	Diff line change
`@@ -24,20 +24,14 @@ public static void quicksort(int[] nums,int start, int end){`
`24`	`24`	`}`
`25`	`25`
`26`	`26`	`public static int pivot(int[] nums,int start,int end){`
`27`		`-// int p = start;`
`28`		`-//`
`29`		`-// ArrayIntro.swap(nums,p,end);`
`30`		`-`
`31`		`- int p = end;`
`32`	`27`	`int j=start;`
`33`		`-`
`34`	`28`	`for (int i = start; i <= end; i++) {`
`35`		`- if(nums[i] < nums[p]) {`
	`29`	`+ if(nums[i] < nums[end]) {`
`36`	`30`	`ArrayIntro.swap(nums, i, j);`
`37`	`31`	`j++;`
`38`	`32`	`}`
`39`	`33`	`}`
`40`		`- ArrayIntro.swap(nums,p,j);`
	`34`	`+ ArrayIntro.swap(nums, end,j);`
`41`	`35`	`return j;`
`42`	`36`	`}`
`43`	`37`	`}`