it's the futureRénà wrote:its a double major in photography and programming
photographic programming
Turbo c++WhattayaBrian wrote:You're working with a compiler where ints are 8 bytes?
Oops! Sorry, I was writing that explanation after just having been playing around with a double array. No, my ints are 4 bytes.WhattayaBrian wrote:You're working with a compiler where ints are 8 bytes?
Code: Select all
#include <iomanip>
//at the beginning,
//and then
cout << fixed << setprecision(2)
//before spitting out the conversionsCode: Select all
std::cout << "Input: " << input << std::endl;at 35 the calls are more than the triple than the numberWhattayaBrian wrote:It's preferable to simply use "break;" where you have "goto end;"
The suffix for unsigned long long is "ULL", not "LL".
Functions do not need a semicolon at the end of their scope-finishing brace.
Since you're new to recursion, you may not quite understand why it starts to get slow around 36. May I suggest adding a simple:
...to the beginning of your fibo function? It will make it very clear just how many calls you're doing.Code: Select all
std::cout << "Input: " << input << std::endl;
...
Except that won't work. Go ahead and try it, and you'll realize that you'll never finish. Printing that many values would take a very, very long time.
Instead, make a global unsigned called "calls", initialize it to 0, and "++calls;" at the beginning of your function. Then, once it's done, print out its value.
You've now seen first-hand why people invented memoization.
Code: Select all
int gNum = 1;
class Foo
{
private:
int mNum;
public:
int func1()
{
return gNum;
}
virtual int func2()
{
return gNum;
}
int func3()
{
mNum = 1;
return mNum;
}
virtual int func4()
{
mNum = 1;
return mNum;
}
int func5()
{
int lNum = 1;
return lNum;
}
virtual int func6()
{
int lNum = 1;
return lNum;
}
};
int main()
{
Foo * test = nullptr;
// #1
//test->func1();
// #2
//test->func2();
// #3
//test->func3();
// #4
//test->func4();
// #5
//test->func5();
// #6
//test->func6();
return 0;
}
<- Go team Yeah Doctor Shemp.!
<- That's everyone being nice to me. ^^
Code: Select all
switch(key)
{
case SDLK_d: //move ball right
pos_x_init += 0.01;
break;
case SDLK_a: //move ball left
pos_x_init -= 0.01;
break;
case SDLK_w: //move ball up
pos_y_init += 0.01;
break;
case SDLK_s: //move ball down
pos_y_init -= 0.01;
break;
}Code: Select all
else if ((pos_y + radius > 1.0) && (last_pos_y + radius <= 1.0)) //If top of ball is above table top and ball was below table last time checked
{
//And if the ball is not past either edge of the table
if (pos_x < 1.5 && pos_x > -1.5)
{
//Then reverse the ball's velocity and steal some kinetic energy
vel_y = -vel_y * 0.9; //Energy lost to "Elastic Collision"
//and set its top on the table
pos_y = 1.0 - radius;
//Energy is also lost to "Rolling Friction"
if (vel_x > 0)
vel_x = vel_x - 0.01 * mass * dt;
else if (vel_x < 0)
vel_x = vel_x + 0.01 * mass * dt;
}
}
