public long radix_sort(int []x){
		Calendar befor=Calendar.getInstance();
		linkedList []x1=new linkedList[10];
		linkedList []x2=new linkedList[10];
		linkedList []put;
		linkedList []pull;
		int max=findMax(x);
		int signif=1;
		signif=(String.valueOf(max)).length();
		put=x1;
		for(int i=0;i<x.length;i++)
		{
			if(put[x[i]%10]==null)
				put[x[i]%10]=new linkedList();
			put[x[i]%10].addLast(x[i]);
		}
		put=x2;
		pull=x1;
	
		for(int k=2;k<=signif;k++){
			for(int p=0;p<pull.length;p++){
				if(pull[p]!=null){
					while(pull[p].getFirst()!=null){
						int temp=(Integer)pull[p].getFirst();
						if(put[(temp%(int)Math.pow(10, k))/(int)Math.pow(10, k-1)]==null)
							put[(temp%(int)Math.pow(10, k))/(int)Math.pow(10, k-1)]=new linkedList();
						put[(temp%(int)Math.pow(10, k))/(int)Math.pow(10, k-1)].addLast(temp);
						pull[p].removeFirst();
						
					}
				}
				
			}
			if(pull==x1) {pull=x2;put=x1;}
			else {pull=x1;put=x2;}	
			
		}int end=x.length-1; 
		for(int y=0;y<pull.length;y++)
			if(pull[y]!=null){
				while(pull[y].getFirst()!=null){
					x[end--]=(Integer)pull[y].getFirst();
					pull[y].removeFirst();
				}
			}
		Calendar after=Calendar.getInstance();
		return (after.getTimeInMillis()-befor.getTimeInMillis());					
	}