Sort.java

package masiv;

import java.util.Arrays;

public class Sort {

	public static void main(String[] args) {
	

		int [] data={1,10,5,7,6};
		int [] data1={0};
		int [] data2={};
		int [] data3={0,0,15,25,16};
		int [] data4={-3,25,2}; 
		int [] data5={10,9,8,7,6,5,4,3,2,1,0};
		int [] data6={1,2,3};
		
		System.out.println("All tray sort");
		
		sort(data);
		sort(data1);
		sort(data2);
		sort(data3);
		sort(data4);
		sort(data5);
		sort(data6);
		
		System.out.println("All arrays sort");
		System.out.println(Arrays.toString(data));
		System.out.println(Arrays.toString(data1));
		System.out.println(Arrays.toString(data2));
		System.out.println(Arrays.toString(data3));
		System.out.println(Arrays.toString(data4));
		System.out.println(Arrays.toString(data5));
		System.out.println(Arrays.toString(data6));
	}
	static void swap(int[]data,int k)
	{	
		for(int i=0,temp; i<data.length-k; i++)
		{
			if(data[i]>data[i+1])
			{
			  temp=data[i];
			  data[i]=data[i+1];
			  data[i+1]=temp;
			}
		}
	}
	static void sort(int []data)
	{
		if(data==null || data.length<=1)
			return;
	
		for(int i=0,k=1;i<data.length-1;i++,k++)
		{
			if(masivSortRight(data))
				return;
			swap(data,k);
			System.out.println(Arrays.toString(data));
		}
	}
	
	static boolean masivSortRight(int[]data)
	{
		for(int i=0; i<data.length-1; i++)
		{
			if(data[i+1]<data[i])
				return false;
		}
		return true;
	}

}