Jump to content

JiMM

Members
  • Posts

    93
  • Joined

  • Last visited

Posts posted by JiMM

  1. Another thing that would be usefull is either the data collected or a picture of the ACTUAL data, not a crayon depiction. What is the amplitude and time scale of the data for all three graphs? We cannot guess why it is not working if we also have to guess what it actually is doing. :beer:

  2. QUOTE (TobyD @ Jun 9 2008, 04:59 PM)

    This is fun stuff. Thanks for posting the link. I'm up to number 9! WooHoo!

    That's exactly where I am!

    QUOTE

    I requested that it be added when I signed up and right away the admin replied that he had added it. He said something about me getting my friends to request it as well so he must have received more than one email
    :shifty:

    I sent an email the first time I went to the web site :thumbup:

  3. Holy Mackerel! I am stunned by how fast the Coding Chalenge winner did this. Of course it was obvious that clever math tactics would be necessary to minimize time, but .... just WOW. I got less than 1ms with that VI on my PC. AMAZING! :worship: I am not worthy!!!!!!

  4. QUOTE (JDave @ Jun 4 2008, 06:32 PM)

    Math efficiency is going to be a large part of keeping the speed down. A slow mathematical algorithm will be slow no matter have programmatically efficient you make it.

    Oh, there is no doubt that knowing tricks of the mathematical trade will help solve those problems more efficiently. As is seen by the version thatn only looks to the smaller primes for divisibility. But I was not looking to set records. I am meerly looking for insights from better LV programmers as to how I can optimize my use of arrays, loops etc. Trying to polish my toolbox, and improve my ability to use it :thumbup:

    I don't know if my wife would appreciate me starting up. It does look fun though.

    It is interesting to both solve the problem, and then say "how can I do this better?" At work I to often get in the mode of solve the problem and move on. If it works, the boss doesn't care (or notice) if it's elegant, or efficient.

  5. The first posted version was in LV8. I now have two revised versions. The first (Euler3_Take2.vi) fixes blatent errors in my first attempt - like I eliminated testing of even numbers (DUH!). That dropped execution to ~2.3 minutes. The third version (Euler3_VJT.vi) uses a theory that to test N for primality you only need to check for divisibility by all of the primes up to N/2. Not the route I was really looking for because it relies on number theory rather than programming efficiency, but interesting to try. That one dropped execution time to 1.2 minutes. And used up my lunch hour rather than a night :D The attached VIs are in LV7.1.

  6. Antoine,

    Thank you for introducing me to this fascinating challenge. My wife would not thank you :D I would be interested in any suggestions to improve my code. I can get the job done, but I am sure that my LV coding skills can only go up. Attached is my solution to the Euler project chalenge #3. I would love to hear any suggestions as to how to improve it's efficiency. I am not looking for fancy mathematical insights (won't help future projects). I have a solution, it's just slow (~4.5 minutes). What I am interested to learn is how to improve the code using more efficient LabVIEW practices. Thanks for any insights!

×
×
  • Create New...

Important Information

By using this site, you agree to our Terms of Use.