René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"Fibonacci sequence should start with [0, 1] and not [1, 1]","articleBody":"# Summary\r\nThe Fibonacci sequence is defined by following statement:\r\n_F(n) = F(n-1) + F(n-2) with F(0) = 0 and F(1) = 1_. For reference, please see [The online encyclopedia of integer sequences](https://oeis.org/A000045) as primary reference, leading to other references with more detailed description.\r\n(Older) books sometimes omit the preceding _0_, but this representation is deprecated.\r\n\r\n## Current status\r\n### fibMemo\r\nWhen calling the function [Fibonacci.fibMemo](https://github.com/TheAlgorithms/Java/blob/e4a9d38ee39767711784f1d5c21029ce2341846f/Dynamic%20Programming/Fibonacci.java#L30), the result of _F(0)_ = _1_. This is incorrect since _F(0) = 0_. Furthermore this leads to the following sequence for the first few integers: _[1, 1, 1, 2, 3, 5, ...]_ for _input=[0, 1, 2, 3, 4, 5, ...]_.\r\n### fibBotUp\r\nWhen calling the function [Fibonacci.fibBotUp](https://github.com/TheAlgorithms/Java/blob/e4a9d38ee39767711784f1d5c21029ce2341846f/Dynamic%20Programming/Fibonacci.java#L53), the program throws an exception when trying to get the value for _F(0)_ from the map. Therefore _F(0)_ is not supported by this implementation.\r\n\r\n## Task\r\nFix both implementation(s) to\r\na) Return correct values for _F(x)_\r\nb) Do not throw exceptions\r\nAcceptance criteria is met when both functions return _[0, 1, 1, 2, 3, 5]_ for _input=[0, 1, 2, 3, 4, 5]_.","author":{"url":"https://github.com/cchexcode","@type":"Person","name":"cchexcode"},"datePublished":"2019-02-20T12:03:04.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":3},"url":"https://github.com/708/Java/issues/708"}