forked from JCarlosR/Sorting-Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathOddEvenSort.java
More file actions
47 lines (41 loc) · 1.29 KB
/
OddEvenSort.java
File metadata and controls
47 lines (41 loc) · 1.29 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
import java.util.Scanner;
public class OddEvenSort {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
System.out.print("Enter the number of elements : ");
int n = sc.nextInt();
int arr[] = new int[n];
System.out.println("Enter " + n + " elements :");
for (int i = 0; i < n; i++)
arr[i] = sc.nextInt();
oddEvenSort(arr);
System.out.println("\nThe sorted array : ;");
for (int i = 0; i < n; i++)
System.out.print(arr[i] + " ");
System.out.println();
}
static void oddEvenSort(int array[]) {
boolean sorted = false;
while (!sorted) {
sorted = true;
for (int i = 1; i < array.length - 1; i += 2) {
if (array[ i ] > array[ i + 1 ]) {
swap( array , i , i + 1 );
sorted = false;
}
}
for (int i = 0; i < array.length - 1; i += 2) {
if (array[ i ] > array[ i + 1 ]) {
swap( array , i , i + 1 );
sorted = false;
}
}
}
}
private static void swap(int[] array, int i, int j) {
int temp;
temp = array[ i ];
array[ i ] = array[ j ];
array[ j ] = temp;
}
}