FIX SHELL SORT K'3

package kelompok1;
import java.util.Scanner;
public class ShellSort {
    public static void main(String[] args) {
        Scanner input = new Scanner (System.in);
        System.out.print("Masukkan jumlah data: ");
        int [] data=new int [input.nextInt()];
        for(int i=0;i<data.length;i++){
            System.out.print("Masukkan data ke-"+(i+1)+" : ");
            data[i]=input.nextInt();
        }
        System.out.println("Data sebelum diurut: ");
        for(int i=0;i<data.length;i++){
            System.out.print(data[i]+" ");
        }
        int jarak=data.length;
        boolean end;
        while (jarak>1){
            jarak/=2;
            end=false;
            while (end==false){
                end=true;
                for(int j=0;j<data.length-jarak;j++){
                    if (data[j]>data[j+jarak]){
                        int tukar=data[j];
                        data[j]=data[j+jarak];
                        data[j+jarak]=tukar;
                        for(int i=0;i<data.length;i++){
                        System.out.print(+data[i]+" ");
                        end=false;
                        }
                        System.out.println(" ");
                    }
                }
            }
        }
        System.out.println("Data setelah diurut: ");
        for(int i=0;i<data.length;i++){
            System.out.print(" "+data[i]);
        }
    }
}