Kit Shambley
Tuesday, August 9, 2011
Question dealing with running time for an algorithm.?
An algorithm takes 0.5 ms for an input size of 100. How long does it take for an input size of 500 if the running time is O(N log N)? The O represents Big-O notation.
No comments:
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment