From 0755d27b0549a7f2727079a4155125d30938ae2f Mon Sep 17 00:00:00 2001 From: Jidong Xiao Date: Mon, 18 Sep 2023 22:02:10 -0400 Subject: [PATCH] adding 1st animation --- lectures/06_memory/README.md | 2 ++ 1 file changed, 2 insertions(+) diff --git a/lectures/06_memory/README.md b/lectures/06_memory/README.md index 430a694..77675bb 100644 --- a/lectures/06_memory/README.md +++ b/lectures/06_memory/README.md @@ -78,6 +78,8 @@ similar to the examples covered in the pointers lecture except that there is no other than the pointer variable. - Dynamic allocation of primitives like ints and doubles is not very interesting or significant. What’s more important is dynamic allocation of arrays and class objects. +- play this [animation](https://jidongxiao.github.io/CSCI1200-DataStructures/animations/dynamic_memory/example1/index.html). + ## 6.3 Exercises - [Leetcode problem 56: Merge Intervals](https://leetcode.com/problems/merge-intervals/). Solution: [p56_mergeintervals.cpp](../../leetcode/p56_mergeintervals.cpp)