Sorting 1

/*
Move all negative numbers to beginning and positive to end with constant extra space. 
An array contains both positive and negative numbers in random order. 
Rearrange the array elements so that all negative numbers appear before all positive numbers.
*/

import java.util.*;
class Test2{
	public static void main(String args[]){
		Scanner sc= new Scanner(System.in);
		System.out.print("Enter the number of elements in the array: ");
		int n=sc.nextInt(), i,k, temp;
		System.out.print("Enter the elements in the array: ");
		int a[]=new int [n];
		for(i=0; i<n; i++)
			a[i]=sc.nextInt();
		
		for(i=0; i<n-1; i++){
			for(k=i+1;k<n; k++){
				if(a[i]>a[k]){
					temp=a[i];
					a[i]=a[k];
					a[k]=temp;
				}
			}
		}
		for(i=0; i<n; i++)
			System.out.print(a[i]+" ");
	}
}