一道时间复杂度为O(N)空间复杂度为O(1)的排序问题

import java.util.Arrays;

public class Main {
    public static void oneSort(int[] array) {
        for(int i = 0; i < array.length; i++) {
            if(array[i] == i+1)
                continue;
            int tmp = array[array[i] - 1];
            array[array[i] - 1] = array[i];
            array[i] = tmp;
        }
    }
    public static void main(String[] args) {
        int[] array = {5, 3, 2, 1, 4};
        Main.oneSort(array);
        System.out.println(Arrays.toString(array));
    }
}