What's the most elegant way of implementing insertion sort

File: Capture.png (178KB, 663x610px) Image search: [Google]

178KB, 663x610px

What's the most elegant way of implementing insertion sort with Java?

public static int[] doInsertionSort(int[] input){
         
        int temp;
        for (int i = 1; i < input.length; i++) {
            for(int j = i ; j > 0 ; j--){
                if(input[j] < input[j-1]){
                    temp = input[j];
                    input[j] = input[j-1];
                    input[j-1] = temp;
                }
            }
        }
        return input;
    }