Just started programming and c++, memory was the first topic that I would first struggle to understand and get my head around and this video really helped :) thank you so much
Don't know if you are trolling or for real.. Universities exist to guarantee a certain quality standard, if you have a degree there is a guarantee that you meet those standards and know specific things.. There is no standard for people who learn online, they might be geniuses, but could also be "garbage" programmers.. ;)
@@DonSanchezDK but as an employer you can make interviews or tests ,if the employee pass ....that is a proof he know things necessary for the job...so there goes the purpose of college !
I've been reading Dr. Bjarne Stroustrup's book on Programming and referring to your videos often. I must say that I wouldn't probably be able to go through that complex book if it weren't for your clear, really lucid explanation of concepts. Thank you so much!
i got the clear idea of what is heap and how to handle new/delete operators and that too dangling pointers and garbage collection. Thanks for this lecture.
This was the best educational video of explaining pointer and dynamic memory. Everything about pointer and dynamic memory is so much clearer now. Cheers !
Zoran Jovanov Not really. It was replaced for a reason. Imagine having two functions, void Func(string* aStr) and an overloaded version called void Func(int aNum). If I call Func(0) or Func(NULL), Func(int aNum) will be called. But if we call Func(nullptr), then Func(string* aStr) will be called, which we want as we're dealing with pointers.
NULL is just constant of 0 difference is NULL is defined with #define and nullptr is a const variable it was replace just to tell you that you are assigning it to pointer and to avoid some memory leaks :)
Thank you so much for the tutorial. Dynamic Memory Allocation has been kind of a plateau in my C++ learning, and you explained it very concisely. Very well done.
The stack memory is managed by the program/compiler Dangling pointer = pointer that points to something that no longer exists. you can assign a dangling pointer the value NULL or 0 When a function exits its memory on the stack is deleted.
Thanks for the video its NUTS & BOLTS :). I am trying to learn how to make a program and everyone says C++ is powerful because of memory management, but now that I am learning it they keep getting away from the nuts and bolts and pretty soon everyone is talking about packaging everything into things already programmed in other things... boxes within boxes and which box to use... Before too long I don't even know what nuts and bolts are actually in the boxes or anything from anything. So thanks
History In 1955, Soviet computer scientist Kateryna Yushchenko invented the Address programming language that made possible indirect addressing and addresses of the highest rank - analogous to pointers. This language was widely used on the Soviet Union computers. However, it was unknown outside the Soviet Union and usually Harold Lawson is credited with the invention, in 1964, of the pointer.[2] In 2000, Lawson was presented the Computer Pioneer Award by the IEEE "[f]or inventing the pointer variable and introducing this concept into PL/I, thus providing for the first time, the capability to flexibly treat linked lists in a general-purpose high-level language".[3] His seminal paper on the concepts appeared in the June 1967 issue of CACM entitled: PL/I List Processing. According to the Oxford English Dictionary, the word pointer first appeared in print as a stack pointer in a technical memorandum by the System Development Corporation. en.wikipedia.org/wiki/Pointer_(computer_programming)#History
I removed a comment by mistake. Apologies to the user that left the nice comment. I had replied "Thanks!" to your comment under my other account and wanted to reply under my ReelLearning account. Deleting my comment, deleted your comment, for some reason.
At 4:36 I am confused you said that you were dereferencing the pointer p when you were changing its value. Does the asterisk mean "dereference", I thought to "dereferencing" was only when you were getting the value of whats being pointed at, not reassigning its value. I'm not trying to be difficult I just don't know.
So if int* p = new int; creates a pointer on the stack and space for an int on the heap, does the following allocate an int on the stack instead? int x = 5; int* p = &x; Or is x still created on the heap?
+Lambda x is on the stack in your example, assuming it is being declared inside a function. If declared globally (outside a function) it would be in what the video calls the "static" area. Stack memory is only guaranteed to be valid for the life of the function so pointers to stack memory should not be returned from the function.
I'm actually kinda scared to start practicing on pointers... I don't really understand them to well...much reading up on to do. But the last example you did with the function sparked a question. If you close the program, then what happens to the garbage? Does it get deleted? Cleared?
When you start your program - OS allocates some memory for it, then your application messes with memory that it is given(storing everything it needs - text, globals, heap, and stack). After it terminates, OS is responsible for cleaning up the mess, so memory will be freed
1. Theoretically - yes, practically - not really. The address that contains garbage is still occupied, so nothing will be written there by the program or OS automatically unless you use a delete operator to tell that the memory address is now available for use (it doesn't really mean that the value is deleted, it might still be there it just marks the address as available and might or might not be used again). The only way to replace the value guaranteed is to get the address, and to do so you have to manually increment memory addresses and check whats in there, but another problem rises - how would you know what is a garbage value? For example 53453453453 can mean garbage or actual value, it can be an integer that fits entirely in a single memory address or can only be a portion of a large object that continues in the next address. That leads to your next question 2. This one is even more complicated, since it depends on implementation of memory management in OS, in general heap is not guaranteed to be contiguous, however more than often you will see the opposite if you write a program to demonstrate it (the program is tiny and will terminate quick so the whole heap will be within certain range). Also all(?) modern OS use virtual memory technique, meaning that the memory used by a process is different from actual physical addresses where stuff is stored, and on top of all that paging and swapping are used to move memory around. Hope that helps a little bit, also note that I am not a C++ guru and might be wrong on something. Please read more about terms I used in my answer to get a better undestanding
You dont have to start with pointers, they are not needed at all until well into mid-tier knowledge. When you need to move beyond the memory limit of a stack you will know 100% enough.
I didn't get the part that was talking about creating garbage . there were 2 ways of creating garbage right ? One forgetting to delete . The other was defining a local pointer and when the program goes out of that loop or function then the memory will be occupied on the heap yet . What should we do to avoid this now ?? Ans pls 🙏🙏🙏
In both cases, an area of memory became garbage because the pointer that was used to access it was no longer available. In the first case, the pointer was used to point to a new variable, and the initial address was lost (overwritten); in the second case, the pointer was allocated on the stack as part of the function then discarded when the function terminated. The result was the same in that the memory area allocated to the variable declared with the "new" statement was no longer accessible. In both cases, the solution is to free that memory with a "delete" statement while the pointer is still available: before reassigning it, or before the function terminates.
this video explains alot. however, as a beginning, I still have a few questions.1. Variables stored in the stack DO have variable names and variables stored in the heap DO NOT have variable names, correct?2. What is the advantage/disadvantage of storing variables in the stack vs. in the heap?3. This is probably a stupid question, but why is it necessary to have a stack and a heap? Why can they not be considered one and the same? Then pointers would not be necessary?
Great explanation. Is it possible to find size of the reserved memory for a specific variable in heap? For stack, it is sizeof() but what would be the case for heap????
my cpp dll is creating a dynamic array, and the call from exe is getting back the pointer pointing to the dynamic array. The problem is that the returning pointer is null every time. Even though the pointer is pointing to a array in the dll. How can we solve this problem.
Soo, if I make normal variables I do not need to delete them right? And I think it is hard to understand when I should make variables on the heap and when not to. It's easier to always do 'normal' variables.
Just a doubt, in the function x() when you don't use delete to deallocate memory in spite of being empty (because you just did new int, instead of new int(10)), it's not the same as if it wasn't allocated and that way stay free?, or exist some mechanism that prevents use that section of memory due to the lack of a delete statement for the same pointer that was declared with the new operator?, for the rest,it was completely pleasant to watch, thank you for share knowledge!, greetings from Perú.
I ran an example of what you explained at 09:13 and the address of the pointer is the same. Only the value changed. Did I do something wrong or maybe the explanation was wrong? Here's my code: int *p = new int; *p = 3; cout
Your code is fine. Your computer probably picked the same memory location because nothing else used it in the time that your code ran. Memory locations are not picked at random.
Super clean and easy explanation. Absolute masterpiece if anyone wants to understand pointers, dynamic memory allocation, stack and heap.
Just started programming and c++, memory was the first topic that I would first struggle to understand and get my head around and this video really helped :) thank you so much
I have never seen anyone explain this more clearly in my life. You are amazing!
at 6:48 he crack me up every time.
Describing all the code I've ever written.
hahahahahahhaha
This video is 7 years old and it is the best explanation I've yet encountered on this topic. Thanks.
i ‘ve watched many best tutorials but this one made my way clear that i won’t ever forget how stuffs are allocated in the memory. Thanks sir
thanks man, hats off sir.
I wonder why we pay our universities and end up learning free on RUclips😒
Because there are stupid people out there want paper signed by University
@@Guest-gy9vp hell yeah
Why job market wants that fucking papr signed by fucking garbage university
It's because you guys never concentrate during your lecture.
Don't know if you are trolling or for real.. Universities exist to guarantee a certain quality standard, if you have a degree there is a guarantee that you meet those standards and know specific things.. There is no standard for people who learn online, they might be geniuses, but could also be "garbage" programmers.. ;)
@@DonSanchezDK but as an employer you can make interviews or tests ,if the employee pass ....that is a proof he know things necessary for the job...so there goes the purpose of college !
DUDE I literally got a 100 on my exam because it was based off of memory diagram questions. Thank you!
Nice 👍🙂
@Abhinav Rao LMAO
@Abhinav Rao bruh moment
@Abhinav Rao do u think people should work infront of the computer 24/7 to use their programming knowledge?
@Harsita's Kitchen do you code while cooking?
Very informative! Really liked your drawing of the 'heap' and the 'stack'. Made it much easier to understand what is going on.
Your efforts are paying off for more than 10 years. This video helped me a lot. Thanks !
I've been reading Dr. Bjarne Stroustrup's book on Programming and referring to your videos often. I must say that I wouldn't probably be able to go through that complex book if it weren't for your clear, really lucid explanation of concepts. Thank you so much!
the best 13 minutes of my life
i got the clear idea of what is heap and how to handle new/delete operators and that too dangling pointers and garbage collection. Thanks for this lecture.
I was debating dropping my major until i found your videos, thanks for the help/motivation!
This was the best educational video of explaining pointer and dynamic memory. Everything about pointer and dynamic memory is so much clearer now. Cheers !
Since C++11 You should not set a pointer to NULL, but rather to "nullptr".
+Peterolen or use 0 and use it in c++1002059
=0 isjust fine anyway.
Zoran Jovanov Not really. It was replaced for a reason. Imagine having two functions, void Func(string* aStr) and an overloaded version called void Func(int aNum).
If I call Func(0) or Func(NULL), Func(int aNum) will be called. But if we call Func(nullptr), then Func(string* aStr) will be called, which we want as we're dealing with pointers.
NULL is just constant of 0 difference is NULL is defined with #define and nullptr is a const variable it was replace just to tell you that you are assigning it to pointer and to avoid some memory leaks :)
Scias
yes but i ment only when u delete pointer so it wont be dangling =0 is just fine.
Thank you so much for the tutorial. Dynamic Memory Allocation has been kind of a plateau in my C++ learning, and you explained it very concisely. Very well done.
Woww😲 had been struggling with this topic for months.. well explained..Tysm.. you're awesom!!!
Those illustrations were SOOOOO helpful. Thanks!
finally understood the concept...this video helped me a lot...
One of the best explained topic I ever seen
best pointer explanation ever :D
The best video I've ever watched about pointers
Taking reference from your videos and C++ Primer both, best learning combo ever!
Excellent explanation with the graphics. Please make more videos. Thank you
Thank you so much. I watched a few of your videos today, and I found them very helpful. Clear and concise, really impressive!
He is so simple in explaining complex concepts. thank you
This is a great video, the drawings really help to make the concepts and idea take concrete form for a begginer
Such an amazing amazing amazing amazing amazing amazing tutorial...hats off
Thank you very much.
You really helped me. May God guide you and increase your knowledge .
Excellent for someone working closer to the hardware and memory!! Great video. Keep it up
best c++ fundamental videos on youtube
This helps me to understand the operations of 'new' and 'delete' . Thanks.
Excellent video. You really capture the big ideas well.
Thanks for the video! It's a lot easier to program codes in c++ using memory allocation with your explanation visuals in mind! Thanks a lot! :D
The stack memory is managed by the program/compiler
Dangling pointer = pointer that points to something that no longer exists.
you can assign a dangling pointer the value NULL or 0
When a function exits its memory on the stack is deleted.
Thanks for the video its NUTS & BOLTS :). I am trying to learn how to make a program and everyone says C++ is powerful because of memory management, but now that I am learning it they keep getting away from the nuts and bolts and pretty soon everyone is talking about packaging everything into things already programmed in other things... boxes within boxes and which box to use... Before too long I don't even know what nuts and bolts are actually in the boxes or anything from anything. So thanks
Thank you so much bro! Your drawing and interpretation of heap & stack made me understand the whole thing :D
I love the drawings!
You helped me understand what a stack frame is! Thanks!
Wow. explained in such simple terms. Thank you so much.
Thank you so much for offering high quality tutorials!
+Forever Alone Studying for the CS final? lol
What?
+Ferris Bueller yes, this is part of my last assignment and will make up most of the final
I love your tutorials. You explain thing soooooooooooo clear. Thank you soooooooooooooooooooooooo much.
History
In 1955, Soviet computer scientist Kateryna Yushchenko invented the Address programming language that made possible indirect addressing and addresses of the highest rank - analogous to pointers. This language was widely used on the Soviet Union computers. However, it was unknown outside the Soviet Union and usually Harold Lawson is credited with the invention, in 1964, of the pointer.[2] In 2000, Lawson was presented the Computer Pioneer Award by the IEEE "[f]or inventing the pointer variable and introducing this concept into PL/I, thus providing for the first time, the capability to flexibly treat linked lists in a general-purpose high-level language".[3] His seminal paper on the concepts appeared in the June 1967 issue of CACM entitled: PL/I List Processing. According to the Oxford English Dictionary, the word pointer first appeared in print as a stack pointer in a technical memorandum by the System Development Corporation.
en.wikipedia.org/wiki/Pointer_(computer_programming)#History
Thank you so much! I finally understand why pointers are useful! I have been facepalming over them ever since I first read about them.
You are incredible! Great presentation! Keep it up!
Holly shit you explaint it like no other, literally 15 min and I understand it all now! Thank you!! :D
The "garbage", i guess is called "memory leak". Good video!
thank you so much I never get to understand pointer as I did this time, thank you again
Very informative video! Keep it up.
Thanks for such an easy explanation
I HAVE A QUESTION!
this is my code:
____________________________________________________________
int *p = new int(3);
cout
got it. thank you
4:31 That voice crack though haha
great job! thanks so much for making this video :) helped me with my homework
I removed a comment by mistake. Apologies to the user that left the nice comment. I had replied "Thanks!" to your comment under my other account and wanted to reply under my ReelLearning account. Deleting my comment, deleted your comment, for some reason.
Thank you! You really explained it well and it helps me a lot in studying :)
This was a great explanation. Thank you!
a legendary explanation. thank you sir.
Yea nullptr uses in C++ from the book. Very good video very clear. Better than the book.
This was crystal clear .Thanks
very clear clarification. Thanks man
very precise and informative!!~ thank you so much!!
At 4:36 I am confused you said that you were dereferencing the pointer p when you were changing its value. Does the asterisk mean "dereference", I thought to "dereferencing" was only when you were getting the value of whats being pointed at, not reassigning its value. I'm not trying to be difficult I just don't know.
So if int* p = new int; creates a pointer on the stack and space for an int on the heap, does the following allocate an int on the stack instead?
int x = 5;
int* p = &x;
Or is x still created on the heap?
+Lambda x is on the stack in your example, assuming it is being declared inside a function. If declared globally (outside a function) it would be in what the video calls the "static" area.
Stack memory is only guaranteed to be valid for the life of the function so pointers to stack memory should not be returned from the function.
+lockbert99 Cheers, thanks for clarifying that for me.
Very informative video! Thank you so much!
Rockstar should learn this...
I'm actually kinda scared to start practicing on pointers...
I don't really understand them to well...much reading up on to do. But the last example you did with the function sparked a question. If you close the program, then what happens to the garbage? Does it get deleted? Cleared?
When you start your program - OS allocates some memory for it, then your application messes with memory that it is given(storing everything it needs - text, globals, heap, and stack). After it terminates, OS is responsible for cleaning up the mess, so memory will be freed
1. Theoretically - yes, practically - not really. The address that contains garbage is still occupied, so nothing will be written there by the program or OS automatically unless you use a delete operator to tell that the memory address is now available for use (it doesn't really mean that the value is deleted, it might still be there it just marks the address as available and might or might not be used again). The only way to replace the value guaranteed is to get the address, and to do so you have to manually increment memory addresses and check whats in there, but another problem rises - how would you know what is a garbage value? For example 53453453453 can mean garbage or actual value, it can be an integer that fits entirely in a single memory address or can only be a portion of a large object that continues in the next address. That leads to your next question
2. This one is even more complicated, since it depends on implementation of memory management in OS, in general heap is not guaranteed to be contiguous, however more than often you will see the opposite if you write a program to demonstrate it (the program is tiny and will terminate quick so the whole heap will be within certain range). Also all(?) modern OS use virtual memory technique, meaning that the memory used by a process is different from actual physical addresses where stuff is stored, and on top of all that paging and swapping are used to move memory around.
Hope that helps a little bit, also note that I am not a C++ guru and might be wrong on something. Please read more about terms I used in my answer to get a better undestanding
You dont have to start with pointers, they are not needed at all until well into mid-tier knowledge.
When you need to move beyond the memory limit of a stack you will know 100% enough.
I loved your explanation. Thank you!
OOOOHHH MYYY GAAAADD! Pointer's too simple now that I learned it from u
Short and informative, thank you!
I didn't get the part that was talking about creating garbage . there were 2 ways of creating garbage right ? One forgetting to delete . The other was defining a local pointer and when the program goes out of that loop or function then the memory will be occupied on the heap yet . What should we do to avoid this now ?? Ans pls 🙏🙏🙏
In both cases, an area of memory became garbage because the pointer that was used to access it was no longer available. In the first case, the pointer was used to point to a new variable, and the initial address was lost (overwritten); in the second case, the pointer was allocated on the stack as part of the function then discarded when the function terminated. The result was the same in that the memory area allocated to the variable declared with the "new" statement was no longer accessible. In both cases, the solution is to free that memory with a "delete" statement while the pointer is still available: before reassigning it, or before the function terminates.
this video explains alot. however, as a beginning, I still have a few questions.1. Variables stored in the stack DO have variable names and variables stored in the heap DO NOT have variable names, correct?2. What is the advantage/disadvantage of storing variables in the stack vs. in the heap?3. This is probably a stupid question, but why is it necessary to have a stack and a heap? Why can they not be considered one and the same? Then pointers would not be necessary?
so can I write
int *p = new int;
*p=5;
p = NULL;
and skip ( delete p ; ) line like that ?
Great explanation. Is it possible to find size of the reserved memory for a specific variable in heap? For stack, it is sizeof() but what would be the case for heap????
Awesome explanation
What happens if u store p on a vector, then creates a new p and stores it in the vector, can u access both?
Thanks man, really good explanation!
Wow great video! I completely get it now :) Doing a quick review, haven't touched this material in a while haha
my cpp dll is creating a dynamic array, and the call from exe is getting back the pointer pointing to the dynamic array. The problem is that the returning pointer is null every time. Even though the pointer is pointing to a array in the dll.
How can we solve this problem.
Great explanation.
4:31 boi hit puberty for a sec
excellent explanation!
So if heap memory cant cause only program polution by garbage and other problems why are we using it?
Newbie here, why would you use a variable in the heap and not the stack?
Amazing explanation. Thanks
What is the point of making a variable 'on the heap' as opposed to in the function (stack).
Variables don't actually use any memory. They're neither allocated on heap nor stack.
really nice article about memory
Agree, finally understood the concept
Why does 'delete' not actually delete p?
Like the entire variable?
Otherwise, isn't the memory for that int still wasted?
Soo, if I make normal variables I do not need to delete them right? And I think it is hard to understand when I should make variables on the heap and when not to. It's easier to always do 'normal' variables.
This is great man thanks a lot
very great explaination. thank you
6:28 its also called memory leakage right
Just a doubt, in the function x() when you don't use delete to deallocate memory in spite of being empty (because you just did new int, instead of new int(10)), it's not the same as if it wasn't allocated and that way stay free?, or exist some mechanism that prevents use that section of memory due to the lack of a delete statement for the same pointer that was declared with the new operator?, for the rest,it was completely pleasant to watch, thank you for share knowledge!, greetings from Perú.
outstanding sir.
Would it be more appropriate to call it a “memory leak” than “garbage”?
I don't get why we need to do this. Why not just work with variables?
Thank you for explaining it so well!!!
I LOVE YOU! YOU SAVED MY LIFE !
I finally understand this concept
I ran an example of what you explained at 09:13 and the address of the pointer is the same. Only the value changed. Did I do something wrong or maybe the explanation was wrong? Here's my code:
int *p = new int;
*p = 3;
cout
Your code is fine. Your computer probably picked the same memory location because nothing else used it in the time that your code ran. Memory locations are not picked at random.