How do I implement insertion sort in Java?

How do I implement insertion sort in Java?

To implement insertion sort in Java, you can use a simple loop to iterate through the array and insert elements in the correct position.

Can you show me a code example?

Sure! Here's a basic implementation:

public class InsertionSort {
    public static void sort(int[] array) {
        for (int i = 1; i < array.length; i++) {
            int key = array[i];
            int j = i - 1;
            while (j >= 0 && array[j] > key) {
                array[j + 1] = array[j];
                j--;
            }
            array[j + 1] = key;
        }
    }
}

What is the time complexity of insertion sort?

The time complexity of insertion sort is O(n^2) in the worst case, but it can be O(n) in the best case when the array is already sorted.

Are there any optimizations I can apply?

Yes, you can optimize insertion sort by using binary search to find the correct position for the key, reducing the number of comparisons.