Create a flowchart that will generate the fibonacci numbers. your flowchart should let the user enter a beginning number of the sequence that the user wants to see. The flowchart should be able to check if the inputs are valid.The flowchart should not accept 0 or negative numbers should this occur display message saying ''INVALID INPUT'' and terminate the flowchart otherwise proceed with the generation of the fibonacci sequence.

create a flowchart determine whether an inputted value is negative or positive

package com.gpt;

import javax.swing.JOptionPane;

/*
This program computes Fibonacci numbers using a recursive
method.
*/
public class Fibonacci
{
public static void main(String[] args)
{
String input = JOptionPane.showInputDialog("Enter n: ");
int n = Integer.parseInt(input);

for (int i = 1; i {
int f = fib(i);
System.out.println("fib(" + i + ") = " + f);
}
System.exit(0);

}

/**
Computes a Fibonacci number.
@param n an integer
@return the nth Fibonacci number
*/
public static int fib(int n)
{
if (n return 1;
else
return fib(n - 1) + fib(n - 2);
}
}

program days;
uses crt;
var
m,n:integer;
begin
clscr;
write('enter number of day');
readln(n);
m:=n mod 7;
case m of
1:write('sunday');
2:write('monday');
3:write('tuesday');
4:write('wednesday');
5:write('thursday');
6:write('friday');
7:write('saturday');
end;
end.

create a flowchart that will print the sum of all even numbers from 1 to 100

Fibonacci sequence is the series of numbers 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ...
At first type Fibonacci equation in Y editor with condition x>=0 and then graphing it. See captured images with enlarged form of graph

Try this site, I think it gives you the best answer:

http://www.scribd.com/doc/10396888/Flowchart-of-Fibonacci-Number-Display-and-Summation

I'm assuming one of two things, either

A) You need help for a programming class?

or

B) You're just curious?

Either way

#include <iostream>
#include <algorithm>
using std::swap;
using std::cout;
using std::endl;
// Function f returns n'th Fibonacci number
// It uses Algorithm 2C: non-recursive loop
unsigned int f(unsigned int x) {
unsigned int x1=1;
for(unsigned int i=1,x2=1;i<=x;i++) {
x1+=x2;
swap(x1,x2);
}
return x1;
}
// Function f_print prints out n'th Fibonacci number
void f_print(int n) {
cout << n << "th Fibonacci number is " << f(n) << endl;
}
// main is the entry point in C++
int main() {
f_print(46);
}

Ok! Here's a snippit from some code I wrote in beginning c++ classes. However, don't just cut and paste it. Know how it works since it's important in algorithm examination!

Just tested it, compiles and runs perfectly on GCC 4.0.1 on my mac, as well as my linux boxen. Windows may take some changes to output data.

/***********************************************
* Steven Parker
* Calculating Fib Sequence
* after two starting values, each number is the
* sum of the two preceding numbers
***********************************************/
#include <iostream>
using namespace std;

int main() {
int whentostop = 20; //How many values of sequence to calculate
int fib[whentostop]; //Hold fib numbers

for (int i=0; i < whentostop; i++) {
if (i == 0)
fib[0] = 0;
else if (i == 1)
fib[1] = 1;
else
fib[i] = fib[i-1] + fib[i-2];

cout << "Fibonacci[" << i << "]: " << fib[i] << endl;
}
return 0;
}