Content deleted Content added
Scottcraig (talk | contribs) |
Groupthink (talk | contribs) →Efficiency and Scalability: Scale and Scalability (sounds like a Jane Austen novel) |
||
Line 172:
::::Well, I guess I'm overruled. I have always learned that problems have complexity, and algorithms have scalability. But you can interchange them if you want. And if you want to introduce a new definition for "efficiency", go ahead. [[User:Scottcraig|Scottcraig]] ([[User talk:Scottcraig|talk]]) 23:44, 14 January 2008 (UTC)
:::::Please correct me if I'm wrong, but I get the sense that you're approaching this from an informal IT angle rather than a formal CS angle. I also get the sense that you're confusing the notions of "scale" and "scalability". While it is true that an algorithm's run-time (or space) will "scale up" as n increases (except of course for an O(1) algorithm) that's ''not'' the same thing as [[scalability]]. You should also realize that using complexity-notation to define efficiency is hardly a "new definition" – it's been around since the 1950's. [[User:Groupthink|Groupthink]] ([[User talk:Groupthink|talk]]) 00:06, 15 January 2008 (UTC)
| |||