private boolean less(T a, T b) { return a.compareTo(b) < 0; } @Override public void sort(IndexedList indexedList) { boolean swapped; int remaining = indexedList.length(); do { swapped = false; for (int i = 0; i < remaining - 2; i++) { swapped = swap(indexedList, i, i + 1) || swapped; } if (!swapped) { break; } swapped = false; for (int j = remaining - 2; j > 0; j--) { swapped = swap(indexedList, j, j + 1) || swapped; } remaining--; } while (swapped); } private boolean swap(IndexedList indexedList, int i, int j) { if (less(indexedList.get(j), indexedList.get(i))) { T t = indexedList.get(i); indexedList.put(i, indexedList.get(j)); indexedList.put(j, t); return true; } return false; }

describe (briefly) the strategy (algorithm) behind the mystery sort. (One or two paragraphs at most.) Elaborate on its asymptotic runtime and space complexity in the best and worst cases. Make sure to note what are the best/worse case scenarios for the mystery sort.