Space Complexity  Many algorithms only need enough space to hold the input data  Procedure add-all (L) Only needs enough space to store L  Others, because the problem is more difficult, use supplementary data  EX: Binary Search Trees  Still others use extra memory to be faster  EX: Dynamic Programming Fibonacci sequence
{}