import java.util.Scanner;
public class fibonacci{
public static void main(String[] args){
int n=0;
int fib = n+1;
Scanner X=new Scanner(System.in);
System.out.print("Enter # of the term: ");
n = X.nextInt();
for (int i=3; i<=n; i++)
{
i = i-1 + i-2;
}
System.out.print("Term is: "+n);
}
}

I know the algorithm is wrong, but I just can't seem to figure it out correctly.
I'm trying to construct the fibonacci algorithm without recursion and arrays.
If anyone could give me suggestions or pointers, it would be much appreciated.

import java.util.Scanner;
public class Fibonacci {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.println("Enter no. of term: ");
int n = scanner.nextInt();
int prevNo = 0;
int no = 1;
int fibo = 0;
for(int i = 1; i<=n; i++){
fibo = prevNo + no;
prevNo = no;
no = fibo;
}
System.out.println(n + "th term = " + fibo);
}
}

I'm going to develop new pos system. So I need to choice right database for that. My software work in network.
System going to be handle one thousand transactions per ...