From 9de5f2280fbb025d12c13a16bb21b7b51a517572 Mon Sep 17 00:00:00 2001 From: Jidong Xiao Date: Mon, 11 Sep 2023 21:46:41 -0400 Subject: [PATCH] fixing error in link --- lectures/04_pointers/README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/lectures/04_pointers/README.md b/lectures/04_pointers/README.md index fc6e6a0..0156ad1 100644 --- a/lectures/04_pointers/README.md +++ b/lectures/04_pointers/README.md @@ -172,11 +172,11 @@ slot). We could equivalently have used the test p != a+n *p = sqrt( p-a ) ``` *p-a* is the number of array locations (not number of types, although each slot is 8 bytes) between p and the start. **This is an integer**. The -square root of this value is assigned to *p. +square root of this value is assigned to \*p. - Note that there may or may not be unused memory between your array and the other local variables. Similarly, the order that your local variables appear on the stack is not guaranteed (the compiler may rearrange things a bit in an attempt to optimize performance or memory usage). A buffer overflow (attempting to access an illegal array index) may or may not cause an immediate failure – depending on the layout of other critical program memory. -- play this [animation](https://jidongxiao.github.io/CSCI1200-DataStructures/animations/pointers/example_arrays_1/index.html). +- play this [animation](https://jidongxiao.github.io/CSCI1200-DataStructures/animations/pointers/example_arrays_2/index.html). ## 4.9 Sorting an Array