SPACE: O(1) TIME : O(n^2) worst-case BEST SCENARIOS: nearly sorted (b/c O(n) time) or small problem set (b/c low memory overhead) What this looks like: Step 1 - i = 0: [4, 8, 1, 0] Change nothing since j > 0 (see algo below for `j`) Step 2 - i = 1: [4, 8, 1, 0] 8 > 4, continue Step 3 - i = 2: [4, 8
(int[] list)
source not stored for this graph (policy: none)
no outgoing calls