Merge pull request #243 from abhishektripathi66/codespace-solid-space-dollop-7p99x4q66443w575

adding the sorting of array in different ways

Author: abhishektripathi66

src/codingquestions/problemsonsorting/quicksort/SortArrayWithThreeTypes.java

@@ -0,0 +1,83 @@
+package codingquestions.problemsonsorting.quicksort;
+
+import java.util.Arrays;
+
+public class SortArrayWithThreeTypes {
+
+    public static void main(String[] args) {
+        int[] arr = {0,1,2,1,1,2};
+        Sort0s1s2s(arr);
+        System.out.println(Arrays.toString(arr));
+        int[] arr1 = {2,1,2,20,10,20,1};
+        Sort3Way(arr1,2);
+        System.out.println(Arrays.toString(arr1));
+        int[] arr2 = {10,5,6,3,20,9,40};
+        int[] range ={5,10};
+        SortaroundRange(arr2,range);
+        System.out.println(Arrays.toString(arr2));
+
+    }
+    // Dutch National Flag Algorithm is the efficient Solution
+    public static void Sort0s1s2s(int[] arr){
+        int low=0,high=arr.length-1,mid=0;
+        while(mid<=high){
+            if(arr[mid]==0){
+                arr[mid]=arr[low];
+                arr[low]=0;
+                low++;mid++;
+            }
+            else if(arr[mid]==1){
+                mid++;
+            }
+            else{
+                int temp = arr[mid];
+                arr[mid]=arr[high];
+                arr[high]=temp;
+                high--;
+            }
+        }
+    }
+
+    public static void Sort3Way(int[] arr,int pivot){
+        int low=0,high=arr.length-1,mid=0;
+        while(mid<=high){
+            if(arr[mid]<pivot){
+                int temp = arr[mid];
+                arr[mid]=arr[low];
+                arr[low]=temp;
+                low++;mid++;
+            }
+            else if(arr[mid]==pivot){
+                mid++;
+            }
+            else{
+                int temp = arr[mid];
+                arr[mid]=arr[high];
+                arr[high]=temp;
+                high--;
+            }
+        }
+    }
+
+    public static void SortaroundRange(int[] arr,int[] range){
+        int low=0,high=arr.length-1,mid=0;
+        while(mid<=high){
+            if(arr[mid]<range[0]){
+                int temp = arr[mid];
+                arr[mid]=arr[low];
+                arr[low]=temp;
+                low++;mid++;
+            }
+            else if(arr[mid]>=range[0]  && arr[mid]<=range[1]){
+                mid++;
+            }
+            else{
+                int temp = arr[mid];
+                arr[mid]=arr[high];
+                arr[high]=temp;
+                high--;
+            }
+        }
+    }
+    
+}

src/codingquestions/problemsonsorting/quicksort/SortArrayWithTwoTypes.java

@@ -0,0 +1,57 @@
+package codingquestions.problemsonsorting.quicksort;
+
+import java.util.Arrays;
+
+public class SortArrayWithTwoTypes {
+
+    public static void main(String[] args) {
+        int[] arr = {-12,18,-10,15};
+        sortPositiveAndNegative(arr);
+        System.out.println(Arrays.toString(arr));
+        int[] arr1 = {15,14,13,12};
+        sortEvenandOdd(arr1);
+        System.out.println(Arrays.toString(arr1));
+        int[] arr2 = {0,1,1,1,0,0,1,0,0,0,1,1,1,0,0,0,1,0,1,0,1,0};
+        sortBinaryArray(arr2);
+        System.out.println(Arrays.toString(arr2));
+    }
+
+    public static void sortPositiveAndNegative(int[] arr){
+        int i=-1,j=arr.length;
+        while(true){
+            do{i++;}while(arr[i]<0);
+            do{j--;}while(arr[j]>=0);
+            if(i>=j) return;
+            int temp = arr[i];
+            arr[i]=arr[j];
+            arr[j]=temp;
+        }
+    }
+
+    public static void sortEvenandOdd(int[] arr){
+        int i=-1,j=arr.length;
+        while(true){
+            do{i++;}while(arr[i]%2==0);
+            do{j--;}while(arr[j]%2!=0);
+            if(i>=j) return;
+            int temp = arr[i];
+            arr[i]=arr[j];
+            arr[j]=temp;
+
+        }
+    }
+
+    public static void sortBinaryArray(int[] arr){
+        int i=-1,j=arr.length;
+        while(true){
+            do{i++;}while(arr[i]==0);
+            do{j--;}while(arr[j]%2==1);
+            if(i>=j) return;
+            int temp = arr[i];
+            arr[i]=arr[j];
+            arr[j]=temp;
+
+        }
+    }
+    
+}