GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — Java/Programs/fibo.java at main · arshcoder13/Java

Expand file tree

/

fibo.java

Copy path
More file actions
More file actions

Latest commit

 

History

History
History
46 lines (32 loc) · 814 Bytes
/

fibo.java

Copy path

File metadata and controls

46 lines (32 loc) · 814 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
import java.util.*;
public class fibo{
public static void main(String[] args) {
// write your code here
int a = 0;
int b=1;
Scanner sc = new Scanner(System.in);
int n= sc.nextInt();
sc.close();
for(int i=0; i<n; i++){
System.out.print(a+" ");
int c = a+b;
a=b;
b=c;
}
// fibbnacci using dynamic programming
public static int fibdp(int n) { // bottom up approach
int storage[]=new int[n+1];
storage[0]=0;
storage[1]=1;
for(int i=2;i<=n;i++) {
storage[i]= storage[i-1]+storage[i-2];
}
return storage[n];
}
public static void main(String[] args) {
int n=44;
System.out.println(fibM(n));
System.out.println(fibdp(n));
System.out.println(fib(n));
}
}
You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.