How to implement insertion sort in Java

Implementation method: 1. Create a Java sample file; 2. Use the sort method to insert the sorting algorithm; 3. Use a for loop to traverse the array and insert each element into the correct position in the sorted partial array; 4. Sort the array in the main method; 5. Output the result.

Operating system for this tutorial: Windows 10 system, Dell G3 computer.

Insertion sort algorithm can be implemented in Java using the following code:

public class InsertionSort {
    public static void sort(int[] arr) {
        int n = arr.length;
        for (int i = 1; i < n; i++) {
            int key = arr[i];
            int j = i - 1;
            while (j >= 0 && arr[j] > key) {
                arr[j + 1] = arr[j];
                j--;
            }
            arr[j + 1] = key;
        }
    }
    public static void main(String[] args) {
        int[] arr = {5, 2, 8, 3, 9, 1};
        sort(arr);
        for (int num : arr) {
            System.out.print(num + " ");
        }
    }
}

In the above example , the sort method implements the insertion sort algorithm. The algorithm iterates through the array, inserting each element into the correct position in the sorted partial array. Finally, the array is sorted and the results are output in the main method.

The above is the detailed content of How to implement insertion sort in Java. For more information, please follow other related articles on the PHP Chinese website!