Selection Sort in Java, ways I can improve the code?

public static void main(String[] args) {
    int arr[]={234,151,123,4,5342,76,48};
    int arrLength = arr.length;
    for(int i=0;i<arrLength-1;i++){
        int min=i;
        for (int k=i+1;k<arrLength;k++){
            if(arr[k]<arr[min]){
                min = k;
            }
        }
        if (i != min) {
            int temp=arr[i];
            arr[i]=arr[min];
            arr[min]=temp;
        }
    }
    for (int j=0;j<arrLength;j++) {
        System.out.println(arr[j]+" ");
    }
}

Looks like you are using the bubblesort algorithm which is very slow. If you want to improve your code, i would recommend to use an algorithm like ripplesort or quicksort.

Slight improvement should be like this :

int arrayLength = arr.length;  
// Then use it in conditional statement of for loop.

So that it won't invoke length property of Array every time in loop. For small number of loops it doesn't impact much but it will help to reduce the time when loops are more or number of iteration of loop are more.

1. The value of the local variable min is not used

2. k <= arr.length-1

-->

k < arr.length

Use this

class Selection {
    public static void main(String[] args) {
        int arr[]={234,151,123,4,5342,76,48}; /* arr[0] to arr[n-1] is the array to sort */
        int lowest, i, j;
        for(i = 0 ; i < arr.length-1; i++) {  /* advance the position through the entire array */
            lowest = i;                       /* assume the min is the first element */
            for(j = i+1 ; j < arr.length; j++) { /* if this element is less, then it is the new minimum */ 
                if(arr[j] < arr[lowest]) {
                    lowest = j;                  /* found new minimum; remember its index */
                }
            }
            if(lowest != i) {                   /* lowest is the index of the minimum element. Swap it with the current position */
                int temp = arr[i];
                arr[i] = arr[lowest];
                arr[lowest] = temp;
            }
        }
        for (int k = 0; k <= arr.length-1 ; k++) {
        System.out.println(arr[k] + " ");
        }
    }
}

This is the selection sort algorithm you asked.

Here is original Selection sort implementation. The implementation in question in not using min to perform the swap operation.

public static void sort(int[] arr) {
        int min=-1;

        for (int i = 0; i < arr.length; i++) {
            min = i;
            for (int j = i + 1; j < arr.length; j++) {
                if (arr[min] > arr[j]) {
                    min = j;
                }
            }
            if (min != i) {
                int temp = arr[min];
                arr[min] = arr[i];
                arr[i] = temp;
            }
        }
}

public class JavaApplication55 {

    public static void main(String[] args) {

        int[] array ={234,435,567,768,123,456,789,789,5670,6789};
     for(int j =0;j< array.length;j++){  
        for(int i =j+1;i < array.length;i++ ){
        int temp;

            if(array[j]>array[i]){

            temp =array[j];
            array[j] =array[i];

            array[i] =temp;

            }

            else{}


        }}





        for(int k =0;k< array.length;k++){

            System.out.println(array[k]);

        }

    }
enter code here

}