Skip to content
Home
Post Code
Jass (Warcraft III)
Wurst
GUI (Warcraft III)
Galaxy (StarCraft II)
GUI (StarCraft II)
C++
Java
Delphi
Text
Search Code
Compare Code
Uploads
Draw
Create New Drawing
View Drawings
Graph
Log in
[code][b]/[/b][b]*[/b][b]*[/b] [b]*[/b] [b]*[/b] Beschreibung [b]*[/b] Gibt Fibonacci Reihe bis [color=FFFF77]100[/color] aus [b]*[/b] @version [color=FFFF77]1[/color].[color=FFFF77]0[/color] vom [color=FFFF77]02[/color].[color=FFFF77]03[/color].[color=FFFF77]2012[/color] [b]*[/b][b]/[/b] public class fibonacci [b]{[/b] public [color=7777FF][b]static[/b][/color] [color=7777FF][b]void[/b][/color] main[b]([/b]String[b][[/b][b]][/b] args[b])[/b] [b]{[/b] System.out.println[b]([/b][color=77FF77]"Hier sehen sie die Fibonacci-Reihe von 1-100:"[/color][b])[/b]; for [b]([/b][color=AA77FF]int[/color] n[b]=[/b][color=FFFF77]1[/color];n<[b]=[/b][color=FFFF77]11[/color];n[b]+[/b][b]+[/b][b])[/b] [b]{[/b] System.out.println[b]([/b]fibonacci[b]([/b]n[b])[/b][b])[/b]; [b]}[/b] [b]}[/b] [color=7777FF][b]static[/b][/color] [color=AA77FF]int[/color] fibonacci[b]([/b][color=AA77FF]int[/color] n[b])[/b] [b]{[/b] [color=7777FF][b]if[/b][/color] [b]([/b]n<[b]=[/b][color=FFFF77]2[/color][b])[/b] [b]{[/b] [color=7777FF][b]return[/b][/color] [color=FFFF77]1[/color]; [b]}[/b] [color=7777FF][b]else[/b][/color] [b]{[/b] [color=7777FF][b]return[/b][/color] fibonacci[b]([/b]n[b]-[/b][color=FFFF77]1[/color][b])[/b][b]+[/b]fibonacci[b]([/b]n[b]-[/b][color=FFFF77]2[/color][b])[/b]; [b]}[/b] [b]}[/b] [b]}[/b] [/code]
select language
jass
java
delphi
C++
php
GSL
> galaxy
visualBasic
wurst
Text
Markdown
select style
default
> bbcode - default
Jasscraft
jasscraft html
visual
lightweight
lightweightNr
goto line:
Compare with:
text copy window
edit this code
post new code
/** * * Beschreibung * Gibt Fibonacci Reihe bis 100 aus * @version 1.0 vom 02.03.2012 */ public class fibonacci { public static void main(String[] args) { System.out.println("Hier sehen sie die Fibonacci-Reihe von 1-100:"); for (int n=1;n<=11;n++) { System.out.println(fibonacci(n)); } } static int fibonacci(int n) { if (n<=2) { return 1; } else { return fibonacci(n-1)+fibonacci(n-2); } } }