calculateur de complexité de l'espace en ligne
void f1(int n){
while(n>1){
b *=b;
n /=2;
}
free(malloc(b * sizeof(int)));
}
Glamorous Giraffe
void f1(int n){
while(n>1){
b *=b;
n /=2;
}
free(malloc(b * sizeof(int)));
}int sum(int n) {
if (n <= 0) {
return 0;
}
return n + sum(n-1);
}function modifiedMinus(k1, k2)
{
dif = k1 –k2
diff = diff –k2
return diff
}
void postorderTraversal(struct Node* node) {
if (node == NULL)
return;
postorderTraversal(node->left);
postorderTraversal(node->right);
cout << node->data << "->";
}