So, this problem question isn't very difficult. However, I am interested in more ways to prove lower bounds on complexity. As far as I know, there are a few w

So, this problem question isn't very difficult. However, I am interested in more ways to prove lower bounds on complexity. As far as I know, there are a few ways to do this: 1) Time >= Size Of Output (As done here) 2) Time >= Number of bits of information (As in the case of showing that sorting takes O(n*log[n]) if all you can do is compare elements). Are there other ways to find lower bounds?