In general, if the array does not exceed 0.1k, I will choose to use the stack
But if I have a slightly larger array, I would choose to use the heap,
In case recursion is used, the stack is probably not enough
char * p = new char [count]
-------------------------------------------------- ----------------------------
Your question should be changed to "how much heap a function can use".
Look at the options when you compile, you can choose the size of the stack space
At the same time, the stack of the same thread is used together, there is no concept of the maximum value that a function can use
It also depends on how much stack space is used before calling this function