While Loops II

[Sentinel]

Im not a CS major

need help with
// Output: 1 2 6 24 120 ... (n - 1)!
// First n factorials

heres my bad code

{
int i = 1;
while (i < n){
std::cout << i << ' ';
// take the output and multiply that by the next number
// 1 * 2 = 2, 2 * 3 = 6, 6 * 4 = 24, 24 * 5 = 120
i = ? }
std::cout << i << ' ';
}

and second

// Output: 0 2 1 3 2 4 3 5 4 6 5 7 6 8 7 9 8 10
// Goes up by 2 and then down by 1 alternatively

{
int i = 0;
while (i < n){
std::cout << i << ' ';
i = ?

 

[MrChad]

Wow, wouldn't it be nice if there were a forum just for Programming questions?

 

[Whitecloak]

i = i^2 is definitely not a formula for getting factorials.

 

[Kelemvor]

Getting some error message or what do you need help with? Doesn't look like N is defined anywhere on first glance.

 

[Sentinel]

it is defined but the code is about 3 pages long wher it is, i just need the loop to work lol

 

[mitaiwan82]

Originally posted by: Sentinel
Im not a CS major

no sh1t...not a math major either:thumbsdown:

 

[Sentinel]

lol i love you too man

 

[purbeast0]

lol dude first of all .. n^2 does not equal n! . i know you arent' a comp sci major, but that is just plain math that i have known since highschool ...

do nested while loops for the first one.

------------------------
int counter = 1;
int answer = 1;

while (counter != n) {

int timer = counter;

while (timer != 0) {

answer = answer * timer;
timer--;
}

cout << answer << endl;
answer = 1;
counter++;
}
--------------

you can figure out the 2nd one yourself

 

[Sentinel]

maybe im just getting studiper as i get closer to graduating

 

[Gibson486]

There is a special formula for factorials. It is very handy for programming, but i do not know teh formula off teh top of my head.

for the second,

i=0

do {

cout << i;

i=i+2;

cout << i;

i=i-1;

}while (i<=...whatever)

syntax might be wrong, but that is the idea.

 

[Whitecloak]

Originally posted by: Sentinel
maybe im just getting studiper as i get closer to graduating

so you are not an english major either?

 

[George P Burdell]

this would be so much easier with recursion.... in any case, one approach to hard code 0! = 1 and 1! = 1 and enter your loop from n = 2

 

[Sentinel]

lmao, thx for the help as always believe me i enjoy getting a new as*hole everyday