Question

Hello this is my java sorting algorithm program i need all of my errors corrected so I can run it. thank you!!

import java.util.Scanner;
   public class SortingAlogs {
public static void main(String[]args){
int array [] = {9,11,15,34,1};
Scanner KB = new Scanner(System.in);
int ch;
while (true) {
System.out.println("1 Bubble sort\n2 Insertion sort\n3 Selection sort\n");
ch = KB.nextInt();
if (ch==1)
   bubbleSort(array);
if (ch==2)
   insertion(array);
if (ch==3)
   Selection(array);
if (ch==4)
break;
   print(array);
   System.out.println();
}
   }
public static void insertionSort(int array[]) {
   int n=array.length;
   for (int i =1; i<n;++i){
int key=array[i];
int j=i-1;
/*
* Move elements of array [0..i-1], that are greater than key, to one position
* ahead of their current position */
  
   while (j>=0 && array [j]>key){
array[j+1]=array[j];
j=j-1;
}
   array[j+1]=key;
}
}

public static void insertionSort(int array[]){

   int n = array.length;
   for (int i=1; i<n; ++i){
int key = array[i];
int j=i-1;
/*
* Move elements of array [0..i-1], that are greater than key, to one
position ahead of their current position */
   while (j>=0 && array[j]>key){
array[j+1]=array[j];
j=j-1;
}
array[j+1]=key;
   }
}

private static void print(int[]aArray){
for (int i=0; i<aArray.length;i++)
   System.out.print(aArray[i]+",");
}
static void selectionSort(int array[]){
   int n = array.length;
//One by one move bondary of unsorted subarray

int min_idx=i;
for (int j=i+1; j<n;j++)
   if(array[j]<array[min_idx])
min_idx=j;
//to swap the minimum element with the first element
   int temp=array[min_idx];
   array[min_idx]=array[i];
   array[i]=temp;

public static void bubbleSort(int array[]){
int n = array.length;
for(int i=0;i<n-1;i++){
   for(int j=0;j<n-i-1;j++)
if(array[j]>array[j+1]){
//swap temp and array[i]
int temp=array[j];
array[j]=array[j+1];
array[j+1]=temp;

}
}
}
}

Answer 1

import java.util.Scanner;

public class SortingAlogs {
    public static void main(String[] args) {
        Scanner KB = new Scanner(System.in);
        int ch;
        while (true) {
            int[] array = {9, 11, 15, 34, 1};
            System.out.println("1 Bubble sort\n2 Insertion sort\n3 Selection sort\n");
            ch = KB.nextInt();
            if (ch == 1)
                bubbleSort(array);
            if (ch == 2)
                insertionSort(array);
            if (ch == 3)
                selectionSort(array);
            if (ch == 4)
                break;
            print(array);
            System.out.println();
        }
    }

    public static void insertionSort(int[] array) {
        int n = array.length;
        for (int i = 1; i < n; ++i) {
            int key = array[i];
            int j = i - 1;
            /*
             * Move elements of array [0..i-1], that are greater than key, to one position
             * ahead of their current position */

            while (j >= 0 && array[j] > key) {
                array[j + 1] = array[j];
                j = j - 1;
            }
            array[j + 1] = key;
        }
    }

    private static void print(int[] aArray) {
        for (int i = 0; i < aArray.length; i++)
            System.out.print(aArray[i] + ",");
    }

    public static void selectionSort(int[] array) {
        int n = array.length;
        //One by one move bondary of unsorted subarray

        for (int i = 0; i < array.length; i++) {
            int min_idx = i;
            for (int j = i + 1; j < n; j++)
                if (array[j] < array[min_idx])
                    min_idx = j;
            //to swap the minimum element with the first element
            int temp = array[min_idx];
            array[min_idx] = array[i];
            array[i] = temp;
        }
    }

    public static void bubbleSort(int[] array) {
        int n = array.length;
        for (int i = 0; i < n - 1; i++) {
            for (int j = 0; j < n - i - 1; j++) {
                if (array[j] > array[j + 1]) {
                    //swap temp and array[i]
                    int temp = array[j];
                    array[j] = array[j + 1];
                    array[j + 1] = temp;
                }
            }
        }
    }
}