Thread: flow chart

It's not recursive, and technically a ball which rebounds 5% less than last time is like Zeno's arrow: It never comes to rest.

Code:

int main() {
	float h = 100.0f;
	int i = 1;
	while (h>0.0f) {
		h -= h*0.05;
		cout << i++ << ":" << h <<endl;
	}
	return 0;
}

Originally Posted by MK27

It's not recursive, and technically a ball which rebounds 5% less than last time is like Zeno's arrow: It never comes to rest.

Theoretically yes, practically no because there are limits to all computer numbers!

Okay, perhaps we can alter reality to better suit your assignment.

Altho, has Cipher says, computer numbers are not infinitely regressive, so eventually you will reach a height which does not change. However, that will not be zero.

So you need to decide whether a non-zero height can be close enough to "at rest", or what. I guess hovering a billionth of a unit off the ground is more or less at rest.