-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathquestion33.c
65 lines (55 loc) · 841 Bytes
/
question33.c
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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
/*
http://practice.geeksforgeeks.org/problems/array-of-alternate-ve-and-ve-nos/0
Arrays
*/
#include <stdio.h>
#include <stdlib.h>
void displayResult(int *arr, int size){
int arr1[50],arr2[50];
int i;
for(i=0; i<50;i++){
arr1[i] = -2000;
arr2[i] = -2000;
}
int j=0,k=0;
for(i=0;i<size;i++){
if(arr[i] >= 0){
arr1[j] = arr[i];
j++;
}
if(arr[i] < 0){
arr2[k] = arr[i];
k++;
}
}
int count = 0;
i=0;
while(count < size){
if(arr1[i] != -2000){
printf("%d ", arr1[i]);
count++;
}
if(arr2[i] != -2000){
printf("%d ", arr2[i]);
count++;
}
i++;
}
printf("\n");
}
int main(){
int cases;
scanf("%d",&cases);
int i;
for(i=0;i<cases;i++){
int n;
scanf("%d",&n);
int j;
int arr[n];
for(j=0;j<n;j++){
scanf("%d",&arr[j]);
}
displayResult(arr, n);
}
return 0;
}