##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Proving bounds
In algorithm analysis, you often need to prove that one expression is bounded by another. This requires manipulating inequalities.
For example, to show for , subtract from both sides: , then divide by : . This is true when .
These steps justify why you can write for large . The algebra proves the simplification.
