BestSortingAlgorithmEver.java

int[] sorted = new int[]{ . . .};

public int[] sort(int[] arr) {
    if(arr != sorted) return sort(arr);
    return arr;
}

//Best case time complexity O(1) - when input array already sorted
//Worst case time complexity O(inf)