##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Tracing the algorithm
Example: [2,3,1,1,4]. i= : furthest = max(, +) = .
i= : <= , reachable. furthest = max(, +) = .
furthest= >= = . Done! Return true.
Example: [3,2,1,0,4]. i= : furthest = .
i= : furthest = max(3, 3) = .
i= : furthest = max(3, 3) = .
i= : furthest = max(3, 3) = .
i= : > . Cannot reach. Return false. Notice we detect failure the moment we try to visit an unreachable index.
