Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.Arrays;
- import java.util.Scanner;
- class Scratch
- {
- private static int[] even;
- private static int[] odd;
- public static void evenOddArray(int[] arr)
- {
- int n = arr.length;
- int[] array = arr;
- int evenSize = 0;
- int oddSize = 0;
- for (int i = 0; i < n; i++)
- {
- if (array[i] % 2 == 0)
- evenSize++;
- else
- oddSize++;
- }
- // odd and even arrays with size
- even = new int[evenSize];
- odd = new int[oddSize];
- //separating odd and even array
- int j = 0, k = 0;
- for (int i = 0; i < n; i++)
- {
- if (array[i] % 2 == 0)
- even[j++] = array[i];
- else
- odd[k++] = array[i];
- }
- }
- public static void bubbleSort(int arr[])
- {
- int n = arr.length;
- for (int i = 0; i < n - 1; i++) {
- for (int j = 0; j < n - i - 1; j++)
- {
- if (arr[j] > arr[j + 1])
- {
- int temp = arr[j];
- arr[j] = arr[j + 1];
- arr[j + 1] = temp;
- }
- }
- }
- }
- public static void insertionSort(int arr[])
- {
- int n = arr.length;
- for (int i = 1; i < n; ++i)
- {
- int temp = arr[i];
- int j = i - 1;
- while (j >= 0 && arr[j] < temp)
- {
- arr[j + 1] = arr[j];
- j = j - 1;
- }
- arr[j + 1] = temp;
- }
- }
- public static void main(String[] args)
- {
- Scanner scan = new Scanner(System.in);
- int n = scan.nextInt(); // size of array
- int array[] = new int[n]; // array with N size
- for(int i = 0; i < n; i++)
- {
- array[i] = scan.nextInt();
- }
- evenOddArray(array); //separate array
- bubbleSort(even); //sort even array
- System.out.println(Arrays.toString(even));
- insertionSort(odd); //sort odd array
- System.out.println(Arrays.toString(odd));
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement