About the current code challenge

[xuesong jin]

There is a very simple solution for the current code challenge: X=Exp(log(Y)/n) where X is the nth root of Y. I do not think the code challeng solution will be so simple. Otherwise, there are no point to raise this issue as a challenge. Could someone give any comment on it? Or the host of code challenge give a explaination on what he want to challeng us in detail?
Have a nice day!

[BruceAmmons]

There is another active thread regarding the current challenge for finding the Nth root. Search for Coding Challenge to find it. Several people agree with you.

Bruce

[BruceAmmons]

I just realized that it is very difficult to locate these topics using the search.

The thread is: http://forums.ni.com/ni/board/message?board.id=170&message.id=103030

Bruce

[altenbach]

Well, your solution is actually way too complicated! 😮
Even simpler is something like the attached image ... x^(1/n).

Apparently, the problem will be reposted with clearer conditions. See the other thread Dennis mentioned.

[altenbach]

(sorry, forgot the image)

--click here for the other thread---

This code takes 450ns on my machine (1GHz PIII) for the example data set (x=78125, n=7), which can be used as convenient benchmark to compare platforms. My best solution so far without any orange wires is about 4x slower (1.7 microseconds) and there is still some slack in the code. (Notice that with this restriction, everything in the logaritmic palette is off-limits, because these always produce orange output.)