Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- package exersise;
- import java.util.Arrays;
- public class Tema09 {
- public static void separate(int[] arr, int even[],int odd[]) {
- int indexEven = 0;
- int indexOdd = 0;
- for( int i = 0; i < arr.length; i++) {
- if(arr[i] % 2 == 0 ) {
- even[indexEven] = arr[i];
- indexEven++;
- }else {
- odd[indexOdd] = arr[i];
- indexOdd++;
- }
- }
- }
- public static void BubbleSort(int[] ARR){
- int j, Buff;
- boolean swap;
- do{
- swap = false;
- for (j = 0; j < ARR.length - 1; j++) {
- if(ARR[j] > ARR[j + 1]){
- swap = true;
- Buff = ARR[j];
- ARR[j] = ARR[j + 1];
- ARR[j + 1] = Buff;
- }
- }
- }while(swap);
- }
- public static void InsertionSort(int[] arr)
- {
- int n = arr.length;
- for (int i = 1; i < n; ++i)
- {
- int inversion = arr[i];
- int j = i - 1;
- while (j >= 0 && arr[j] < inversion)
- {
- arr[j + 1] = arr[j];
- j = j - 1;
- }
- arr[j + 1] = inversion;
- }
- }
- public static void main(String[] args) {
- int arr [] = {13,6,7,8,1,4};
- int oddS = 0;
- int evenS = 0;
- for( int i = 0; i < arr.length; i++) {
- if(arr[i] % 2 == 0 ) {
- evenS++;
- }else {
- oddS++;
- }
- }
- int even[] = new int[evenS];
- int odd[] = new int[oddS];
- separate(arr,even,odd);
- System.out.println("BEFORE SORTING :" + Arrays.toString(even));
- System.out.println("BEFORE SORTING :" + Arrays.toString(odd));
- BubbleSort(even);
- InsertionSort(odd);
- System.out.println("AFTER SORTING :" + Arrays.toString(even));
- System.out.println("AFTER SORTING :" + Arrays.toString(odd));
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement