diff --git a/labs/lab08-64bit/index.html b/labs/lab08-64bit/index.html index 78826baa..33987395 100644 --- a/labs/lab08-64bit/index.html +++ b/labs/lab08-64bit/index.html @@ -164,6 +164,6 @@
Once you have completed the in-lab, submit linearSearch.s, testLinearSearch.cpp, and your Makefile
Recall that C++ arrays are stored contiguously in memory. This means that if you know the start address of the array &a, and the size of the elements that are being stored, you can find the address of an element at any index i with &a[i] = &a + <size_of_elements>*i (if the array is one-dimensional). Use this fact along with the memory addressing slide from lecture to access array elements in assembly.
Recall that C++ arrays are stored contiguously in memory. This means that if you know the start address of the array &a, and the size of the elements that are being stored, you can find the address of an element at any index i with &a[i] = &a + <size_of_elements>*i (if the array is one-dimensional). Use this fact along with the memory addressing slide from lecture to access array elements in assembly.