Dynamic Memory with Malloc - Everything you Need to Know

[@codebreakthrough]

🌟Be notified of new C/C++ course: calcur.tech/c-cpp-newsletter

[@Dulge]

Quick notes is that this memory is allocated on rhe heap and the heap is much slower than the stack where your local variables and data is stored. Using dynamic memory is powerful when we working with huge classes or structs or when we need our data to have a longer lifetime even when out of scope. Its also very useful when we need to have a buffer for the user input.

[@ElementResources-rp8ox]

Really nice examples in this video...well done and thank you!

[@goaheadskinit]

Thank you for your explanation. Really helpful.

[@itzikovadia851]

Thanks u very helpfull and clearly lesson

[@m4daruba309]

Thank you very much. Very helpful.

[@tixerz9591]

helped me alot. thanks.

[@byskawica1919]

You could also use this altogether : ” int* x = malloc(sizeof(int) *4); *(x + n) = y; // n is the list index and y is the assigned value.”

[@TheBuilder]

good job

[@andrewcomtois6542]

very helpful

[@kermitdafrog8]

Do you use calloc at all?

[@Brad_Script]

the size_t specifier in printf is "%zu" not "%lu", "%lu" will not be correct on all systems (long unsigned on windows is 32 bit but 64 bit on Linux)

[@tixerz9591]

now i have the idea to make dynamic lists like cpp vectors in c

[@bilos125]

good

[@typingcat]

Dang, 8 years changes the voice and the face. Unrecognisable. (I came from a 8-year-old database video).

[@reenamola2162]

first