LabVIEW
Find Best Array size for n elements
@kashiruvana wrote:
Ooh, I like that. That's a good solution. (If I could mark it, I would!)
There are quite a few suggestions above, so we don't really know what you are replying to.
Of course you can also make my solution "all blue" (the orange square root is somewhat a blemish:)). I am sure there are even better, more faster converging integer square roots, just try it. 😄
@altenbach wrote:
@kashiruvana wrote:
Ooh, I like that. That's a good solution. (If I could mark it, I would!)
There are quite a few suggestions above, so we don't really know what you are replying to.
Of course you can also make my solution "all blue" (the orange square root is somewhat a blemish:)). I am sure there are even better, more faster converging integer square roots, just try it. 😄
Other than this being "all blue," are there any advantages to this approach:
Over this one:
All I see is that as NumElements increases, the processing time will increase with the while loop while the time of the selection will be relatively constant.
I would go with my q&r solution (the one with the sqrt). Easier to read than using all these compare and select nodes. Performance does not matter here.
