if (condition)
{
}
else {
}
if (condition) {
} else {
}
#include <iostream>
typedef struct {
int n;
double values[12];
} DATA;
int main() {
DATA data;
std::cout << data.n << ", " << data.values[3] << std::endl;
memset(&data, 0, sizeof(data)); //set all fields to zero
std::cout << data.n << ", " << data.values[3] << std::endl;
std::cout << "Press enter..." << std::endl;
std::cin.get();
}
Consider n nested for loops in Python:
for i_1 in range(n):
for i_2 in range(n):
for i_3 in range(n):
...
for i_n in range(n):
doSomething()
The recursive way would be:
def nForLoops(n, depth = 0):
if depth > n-1: doSomething()
else:
for i in range(n):
nForLoops(n, depth + 1)
A simple iterative function could be written using the observation that doSomething() is called n^n times:
def nForLoops2(n, counter = 0):
while counter < pow(n, n):
counter += 1
doSomething()
TODO: How could we write it iteratively using stack data structure?
Java's Math.round(0.5) and C++'s std::round(0.5) result in the value of 1 while Python 3 round(0.5) results in zero because while Java and C++ use round up, Python 3 uses round half to even.
