下列程序（m转换为n进制）的时间复杂度是多少，为什么？

Question

SeqStack* convertToType(int number, int type) {

SeqStack* stack = new SeqStack;
stack->top = -1;
while (number != 0) {
    int rest = number % type;
    if (stack->top < 99) {
        stack->data[++stack->top] = rest;
    }
    else {
        cout << "out of memery";
    }
    number = (number - rest) / type;
}
return stack;

}