Segregate Even and Odd numbers

Author: zoom2manoj

README.md

@@ -36,6 +36,7 @@ Arrangement Rearrangement :
 6. Rearrange an array in maximum minimum form (O(1) extra space)
 7. Maximum Length Bitonic Subarray | Set 1 (O(n) tine and O(n) space)
 8. Segregate 0s and 1s in an array
+9. Segregate Even and Odd numbers
 
 Graph : 
 1. DFS (Iterative & Recursive)

src/com/array/rearrangement/SegregateEvenandOddnumbers.java

@@ -0,0 +1,58 @@
+package com.array.rearrangement;
+
+public class SegregateEvenandOddnumbers {
+
+	/*
+	Segregate Even and Odd numbers
+	
+	Input  = {12, 34, 45, 9, 8, 90, 3}
+Output = {12, 34, 8, 90, 45, 9, 3} 
+	
+	*/
+	public static void main(String[] arg){
+		
+
+	    int arr[] = {12, 34, 45, 9, 8, 90, 3};
+	    printArray(arr);
+	    segregateEvenOdd(arr);
+	    System.out.println("");
+	    printArray(arr);
+	}
+	
+	private static void segregateEvenOdd(int[] arr) {
+			
+		int left = 0;
+		int right = arr.length-1;
+		
+		while (left<right) {
+			
+			while (arr[left]%2==0&&left<right) {
+				left++;
+			}
+			
+			while (arr[right]%2==1&&left<right) {
+				right--;				
+			}
+			
+			if (left<right) {
+				int temp  = arr[left];
+				arr[left] = arr[right];
+				arr[right] =temp;
+				left++;
+				right--;
+			}
+			
+		}
+		
+		
+		
+	}
+
+	private static void printArray(int[] arr) {
+		
+		for (int i = 0; i < arr.length; i++) {
+			System.out.print(arr[i]+", ");
+		}
+	}
+
+}

src/com/array/rearrangement/Segregate_0sand1s_array.java

@@ -3,7 +3,7 @@
 public class Segregate_0sand1s_array {
 
 	/*
-	 * 
+	 * Time Complexity: O(n)
 	 * Segregate 0s and 1s in an array
 	 * 
 	Input array   =  [0, 1, 0, 1, 0, 0, 1, 1, 1, 0]