You are given an array of size N. Rearrange the given array in-place such that all the negative numbers occur before positive numbers.(Maintain the order of all -ve and +ve numbers as given in the original array).
The first line consists of an integer T denoting the number of test cases. T testcases follow. Each test case contains two lines of input. The first line contains the size of the array denoted by N. Then in the next line are N space separated elements of the array.
For each test case, print the array after rearranging with spaces between the elements of the array.
1 <= T <= 100
1 <= N <= 107
-1018 <= Elements of array <= 1018
-3 3 -2 2
2 -4 7 -3 4
-3 -2 3 2
-4 -3 2 7 4
Testcase 1: In the given array, negative numbers are -3, -2 and positive numbers are 3, 2.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.