I realize that each time I have to deal with the Big-O notation I am questioning myself why complexity in time or space share the same formal notation/letter. It is always confusing when I read examples in books because authors don't always give precision about whether the given result is a time or space complexity.
So, when you see that an algorithm has a O(n) complexity, you don't know much. You have to say: this algorithm has a O(n) time complexity.
IHMO I think it would be much more useful to use two separated letters like O(n) and T(1) for instance.
Is there such convention when talking about algorithm complexity?