Skip to content

Instantly share code, notes, and snippets.

View jasongorman's full-sized avatar

Jason Gorman jasongorman

View GitHub Profile
public class FibonacciGenerator {
public int getNumberAtPosition(int positionInSequence){
if(positionInSequence > 1){
return getNumberAtPosition(positionInSequence - 1) +
getNumberAtPosition(positionInSequence - 2);
}
return positionInSequence;
}
if(length < 8 || false){
throw new IllegalArgumentException();
}
if(length < 8 && length > 50){
throw new IllegalArgumentException();
}
@Test
public void cannotRequestSequencesShorterThanEight() throws Exception {
try
{
new FibonacciGenerator().getSequenceOfLength(7);
fail();
}
catch(Exception e)
{
if(length < 8 && length > 50){
throw new RuntimeException();
}
if(length < 8){
throw new RuntimeException();
}
public class FibonacciGenerator {
public int getNumberAtPosition(int positionInSequence){
if(positionInSequence > 1){
return getNumberAtPosition(positionInSequence - 1) +
getNumberAtPosition(positionInSequence - 2);
}
return positionInSequence;
}
if(length < 8 || false){
throw new IllegalArgumentException();
}
public class FibonacciGenerator {
public int getNumberAtPosition(int positionInSequence){
if(positionInSequence > 1){
return getNumberAtPosition(positionInSequence - 1) +
getNumberAtPosition(positionInSequence - 2);
}
return positionInSequence;
}
public class FibonacciGenerator {
public int getNumberAtPosition(int positionInSequence){
if(positionInSequence > 1){
return getNumberAtPosition(positionInSequence - 1) +
getNumberAtPosition(positionInSequence - 2);
}
return positionInSequence;
}