I tried a lot of different things but was not able to do any better. I ended up just implementing my program using a different algorithm. It doesnt seem to be working in all cases yet, but its 2x faster than the old program in the cases its producing the same answer as the old program, and i haven't even done any optimizations yet. Thanks for all the help.
On Friday, July 19, 2013 4:32:04 AM UTC-4, Simon King wrote: > > Hi! > > On 2013-07-14, broken_symlink <[email protected] <javascript:>> wrote: > > I have something that is passing the tests. I thought I would be able to > do > > better by getting rid of the two for loops and using list > comprehensions. > > But, according to kernprof all I managed to do was make things worse. > > Anyway, if at some point you obtain an improvement: The right location > to post code is the Sage trac. > > Best regards, > Simon > > -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/groups/opt_out.
