-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathPositiveNegativeSort.java
More file actions
48 lines (45 loc) · 1.25 KB
/
Copy pathPositiveNegativeSort.java
File metadata and controls
48 lines (45 loc) · 1.25 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
48
import java.util.Scanner;
public class PositiveNegativeSort {
//METHOD TO PRINT ARRAY
static void display(int a[]){
for(int i=0; i<a.length; i++){
System.out.print(a[i] + " ");
}
}
//METHOD TO SWAP ELEMENTS
static void swapElements(int a[], int i, int j){
int temp= a[i];
a[i]= a[j];
a[j]= temp;
}
//METHOD TO SORT POSITIVE, NEGATIVE ELEMENTS OF ARRAY
static void positiveNegativeSort(int a[]){
int left=0, right=a.length-1;
while(left<right){
if(a[left]<0){
left++;
}
else if(a[right]>0){
right--;
}
else{
swapElements(a, left, right);
left++;
right--;
}
}
}
public static void main(String[] args) {
Scanner sc= new Scanner(System.in);
//INPUT ARRAY SIZE AND ELEMENTS
System.out.print("Enter array size: ");
int size= sc.nextInt();
int arr[]= new int[size];
System.out.print("Enter " + size + " numbers: ");
for(int i=0; i<arr.length; i++){
arr[i]= sc.nextInt();
}
positiveNegativeSort(arr);
display(arr);
}
}