public static void cycleSort(int arr[], int n){
		 	for (int cycle_start = 0; cycle_start <= n - 2; cycle_start++){
	            int item = arr[cycle_start];
	            int pos = cycle_start;
	            for (int i = cycle_start + 1; i < n; i++)
	                if (arr[i] < item)
	                    pos++;
	            		if (pos == cycle_start)
	            			continue;
	            		while (item == arr[pos])
	            						pos += 1;
	            if (pos != cycle_start){
	                int temp = item;
	                item = arr[pos];
	                arr[pos] = temp;

	            }while(pos != cycle_start){
	                pos = cycle_start;
	                for (int i = cycle_start + 1; i < n; i++)
	                    if (arr[i] < item)
	                        pos += 1;
	                while (item == arr[pos])
	                    pos += 1;
	                if (item != arr[pos]) {
	                    int temp = item;
	                    item = arr[pos];
	                    arr[pos] = temp;
	                }
	            }
	        }
	    }

case 5:
		        int pagMas[]=new int [masivs1.length*masivs1[0].length];
		        int[][] a=new int[masivs1.length][masivs1[0].length];
		        int skaititajs=0;
		        for(int i=0;i<masivs1.length;i++){
		        	for(int j=0;j<masivs1[i].length;j++){
		        		pagMas[skaititajs]=masivs1[i][j];
		        		skaititajs++;
		        	}
		        }
		        int n =pagMas.length;
		        cycleSort(pagMas, n);
		        		skaititajs=0;
		    	        for (int i = 0; i < masivs1.length; i++){
		    	        	for(int j=0;j<masivs1[i].length;j++){
		    	        		a[i][j]=pagMas[skaititajs];
		    	        		skaititajs++;
		    	        		System.out.print(a[i][j]+"\t");
		    	        	}
		    	        	System.out.println();
		    	    }
		        	 break;