JamesFlare/CSCI-1200
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

adding the missing semi-colons

Browse Source
This commit is contained in:
Jidong Xiao
2023-09-11 23:04:29 -04:00
parent 17dc203b20
commit f61213a062
1 changed files with 4 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
lectures/04_pointers/README.md
View File

@@ -141,6 +141,7 @@ int i;
for ( i=0; i<n; ++i ) for ( i=0; i<n; ++i )
a[i] = sqrt( double(i) ); a[i] = sqrt( double(i) );
``` ```
<!--both double(i) and (double)i would work, they are the same.-->
- Remember: the size of array a is fixed at compile time. STL vectors act like arrays, but they can grow and - Remember: the size of array a is fixed at compile time. STL vectors act like arrays, but they can grow and
shrink dynamically in response to the demands of the application. shrink dynamically in response to the demands of the application.
@@ -172,7 +173,7 @@ the start of the array. In this example, a+n is the memory location 80 bytes aft
slot). We could equivalently have used the test p != a+n slot). We could equivalently have used the test p != a+n
- In the assignment: - In the assignment:
```cpp ```cpp
*p = sqrt( p-a ) *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 *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.
@@ -192,11 +193,11 @@ double *p;
p = a; p = a;
int i; int i;
for ( i=0; i<n; ++i ){ for ( i=0; i<n; ++i ){
*(p+i) = sqrt( (double(i) ) *(p+i) = sqrt( double(i) );
}; };
``` ```
This second approach also "nicely mimics the subscript notation used in the for loop above, which highlights that fundamentally array subscripts are just pointer arithmetic." - comments by our mentor Eleanor Olson, :smile:. This second approach also "nicely mimics the subscript notation used in the (original) for loop above, which highlights that fundamentally array subscripts are just pointer arithmetic." - comments by our mentor Eleanor Olson, :smile:.
## 4.9 Sorting an Array ## 4.9 Sorting an Array