Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I often here people talk about Big O which measures algorithms against each other
Does this measure clock cycles or space requirements.
If people want to contrast algorithms based on memory usage what measure would they use
If someone says “This algorithm runs in O(n) time”, he’s talking about speed. If someone says “This algorithm runs in O(n) space”, he’s talking about memory.
If he just says “This algorithm is O(n)”, he’s usually talking about speed (though if he says it during a discussion about memory, he’s probably talking about memory).
If you’re not sure which one someone’s talking about, ask him.