In SX Microcontrollers, SX/B Compiler and SX-Key Tool, wbahn wrote:

Glad that helped, Nick.
 

BTW, the HTH are not my initials (but I can sure see why it looked that way). It's net shorthand for "hope that helps". 

 

The O(something) is called "Big-O" notation. It relates to fields such as Analysis and Design of Algorithms, Computational Complexity, and others. The 'O' is for "order". Saying that something is O(n) means that it scales linearly with the size of the problem. In your case, if you double then number of bits in the gray code word, then you double the amount of effort/time to convert it to binary. For most meaningful problems, O(n) solutions are considered quite nice - it's actually pretty seldom we can do that good. 

 

Technically, O() describes the behavior as the size of the problem grows to very large values and doesn't always apply too well to small versions of the problem.

 

If something is O(log(n)) it means that (for large n) when you square the size of the problem, the amount of effort only doubles. That is, indeed, powerful juju - when you can find a way to pull it off.

 

Cheers!

 

Bill

---------- End of Message ----------


You can view the post on-line at:
http://forums.parallax.com/forums/default.aspx?f=7&p=1&m=146196#m146912

Need assistance? Send an email to the Forum Administrator at forumadmin@parallax.com

The Parallax Forums are powered by dotNetBB Forums, copyright 2002-2006 (http://www.dotNetBB.com)