Timeline for Finding the n th term in Fibonacci series

12 events

when toggle format	what		by	license	comment
Jun 9, 2017 at 6:13	comment	added	CMouse		I am still getting my solution rated as `poor` and I cannot understand why ! @Peilonrayz @Milind
Jun 8, 2017 at 10:23	vote	accept	CMouse
Jun 8, 2017 at 10:22	answer	added	CocoCrisp		timeline score: 2
Jun 8, 2017 at 9:45	comment	added	Peilonrayz♦		@Milind Answers should go in answers, not comments.
Jun 8, 2017 at 9:04	review	Close votes
Jun 8, 2017 at 14:16
Jun 8, 2017 at 8:57	comment	added	CocoCrisp		The code looks fine to me apart from the fact that it can throw an exception. The function fib()``powLF() are giving you complexity of `log(n)` plus the execution time of the function `sum_digits()` is 479 ns per loop which is perfectly fine.
Jun 8, 2017 at 8:57	answer	added	Neil		timeline score: -2
Jun 8, 2017 at 8:47	history	edited	CMouse	CC BY-SA 3.0	deleted 89 characters in body
Jun 8, 2017 at 8:43	comment	added	CMouse		Code works as required for smaller integers but for integers greater than 4 digits it throws exception.
Jun 8, 2017 at 8:41	comment	added	Toby Speight		Does the code work as required? You say it throws an exception - you should probably do something about that before this code is ready for review. You could either avoid it by rejecting out-of-range inputs, or fix your code to handle larger values.
Jun 8, 2017 at 8:34	review	First posts
Jun 8, 2017 at 8:41
Jun 8, 2017 at 8:30	history	asked	CMouse	CC BY-SA 3.0