On Wednesday 10 September 2008, Rene de Visser wrote: > Any comments? Yes. Please look into computational complexity and Big O notation.
http://en.wikipedia.org/wiki/Computational_complexity "Computational complexity theory, as a branch of the theory of computation in computer science, investigates the problems related to the amounts of resources required for the execution of algorithms (e.g., execution time), and the inherent difficulty in providing efficient algorithms for specific computational problems." "The space complexity of a problem is a related concept, that measures the amount of space, or memory required by the algorithm. An informal analogy would be the amount of scratch paper needed while working out a problem with pen and paper. Space complexity is also measured with Big O notation." http://en.wikipedia.org/wiki/Big_O_notation - Bryan ________________________________________ http://heybryan.org/ Engineers: http://heybryan.org/exp.html irc.freenode.net #hplusroadmap ------------------------------------------- agi Archives: https://www.listbox.com/member/archive/303/=now RSS Feed: https://www.listbox.com/member/archive/rss/303/ Modify Your Subscription: https://www.listbox.com/member/?member_id=8660244&id_secret=114414975-3c8e69 Powered by Listbox: http://www.listbox.com
