As gurukulki said, it’s stored on the heap. However, your post suggested a misunderstanding probably due to some well-intentioned person propagating the myth that “primitives always live on the stack”. This is untrue. Local variables have their values on the stack, but not all primitive variables are local… For example, consider this: public class Foo … Read more
Your array is allocated on the heap, and the ints are not boxed. The source of your confusion is likely because people have said that reference types are allocated on the heap, and value types are allocated on the stack. This is not an entirely accurate representation. All local variables and parameters are allocated on … Read more
vector<Type> vect; will allocate the vector, i.e. the header info, on the stack, but the elements on the free store (“heap”). vector<Type> *vect = new vector<Type>; allocates everything on the free store. vector<Type*> vect; will allocate the vector on the stack and a bunch of pointers on the free store, but where these point is … Read more
Automatic tells me something about the lifetime of an object: specifically that it is bound automatically to the enclosing scope, and will be destroyed automatically when that scope exits. Dynamic tells me that the lifetime of an object is not controlled automatically by the compiler, but is under my direct control. Stack is an overloaded … Read more
A static two-dimensional array looks like an array of arrays – it’s just laid out contiguously in memory. Arrays are not the same thing as pointers, but because you can often use them pretty much interchangeably it can get confusing sometimes. The compiler keeps track properly, though, which makes everything line up nicely. You do … Read more
In Visual Studio the default stack size is 1 MB i think, so with a recursion depth of 10,000 each stack frame can be at most ~100 bytes which should be sufficient for a DFS algorithm. Most compilers including Visual Studio let you specify the stack size. On some (all?) linux flavours the stack size … Read more
1) You check feof() first, then do a fscanf(), and then don’t check its return value (or re-check feof() at the very least. (You might have been right at the end of the file prior to the fscanf() call, or the configuration file might be malformed, but you wouldn’t detect this with your code.) 2) … Read more