hi evrybody

i try to solve any assigments "Introduction to Computer Science and Programming 6.00" and want feedback. help us.
thanks

Question

hi evrybody

i try to solve any assigments "Introduction to Computer Science and Programming 6.00" and want feedback. help us.
thanks

lopus · Answer

ps0: https://gist.github.com/jhonny111s/10928620 ps1a: https://gist.github.com/jhonny111s/10928696 ps1b: https://gist.github.com/jhonny111s/10928777 ps2_0: https://gist.github.com/jhonny111s/11010567

lopus · Answer

ps2a: https://gist.github.com/jhonny111s/11012179

anonymous · Answer

There are much faster ways to find primes and check for prime than the method implemented in ps1. check out http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes for an example. Do your solutions work for all example cases in the problem set?

lopus · Answer

#seandisanti, yes works in all cases fine. thank you for you recommendation

anonymous · Answer

No problem, i'm always happy to help if i'm able.  Don't forget to go through and check out the posted solutions on OCW after you're happy with your own. Often times you can see another approach you may not have thought of.

lopus · Answer

ps2b: https://gist.github.com/jhonny111s/11390160 i need that sombody test this code. thank

anonymous · Answer

Just glancing at it, it looks like a problem that lends itself to recursion. For more specific help could you please move it to a new question with a title relevant to the issue at hand?  That just helps people who may be looking for guidance on the same problem