@Dave
Because he wants to optimize it
if we can get the boundary of running time, we'll get the faster
algorithm
haxxpop
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com
997 is a prime number, so the calculation must be (1!+2!+...+996!) mod
997
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
@Dave
I like this. use mem just O(1) , my algo use O(N). Thxx
haxxpop
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks
@jai gupta
why is this work??
I think it just calculates (N+1)! %n
haxxpop
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email
I like Your algorithm; it's the same as I think.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
