CareerCup

@alex: can u please explain the qquestion?

void * createArray(int dimension[], int size)
{
    if(size == 1){
        void * array = malloc( sizeof(int) *dimension[0]);
        return array;
    }
    void * array = (void *)malloc( sizeof(void *) *dimension[0]);
    
    for(int i = 0; i< dimension[0]; i++){
        array[i] = createArray( & dimension[1], size-1);
    }
    return array;
}

As for the problem of implementing N loops, you can do it in a recursively way.

#include <iostream>
#include<vector>
using namespace std;

int main() {
vector<int> v;
int k;
while(cin>>k)
v.push_back(k);
vector<int>::const_iterator cii;
for(cii=v.begin();cii!=v.end();cii++)
cout<<*cii<<" ";
return 0;
}

If I understand this question correctly, the function is called with N arguments, and the number of arguments is the number of dimensions, and the value of the arguments is the size of each dimension. So ... using C ...

#include <stdarg.h>
int* AllocateArray(int n_args, ...)
{
va_list list;
va_start(list,n_args);

int total = 1;
for (int i = 0; i<=n_args;i++)
total *= va_arg(list,int);

return (int*)malloc(total * sizeof(int));
}