salma-emara / aps105-book Goto Github PK

In Chapter 8.1 What is dynamic memory allocation?, section 8.1.2Ppractice Problem. Step 2: Think of a solution!

In second paragrah, "We compare element at indexA in a with the element at indexB at b: a[index] < b[indexB]. We copy a[indexA] to the merged array if a[index] is less than b[indexB], else we copy b[indexB]."

A few a[indexA] was typed as a[index].

Small typo under section 1.4.3:

% is an escape character too used specify the format of the variable to be printed.

Hi!

Found a typo in the first paragraph:
"you can also download the .c file of the program by clicking on file name in text. Foe example, download hello-world.c if you want to edit ... "

Great ebook!

For chapter 9.1.2 about 2D array,

I tried using one pointer won't work in my codes in C,
for example for
int array[4][4];
to get array[1][2]
I tried *(array + 1 * 4 + 2) won't work
but rather a two-pointer stuff ((array+1)+2) worked for my code

FYI, I didn't use malloc to initialize the 2D array

As I tried something else, and find that in my professor Anderson's notes, he multiply the (1 * 4 + 2) by the size of 'int', however, that still didn't work for my code, I think.

I could be wrong though, please let me know if I understand it wrong.

Best regards,
William Wen

Hi,

Found a typo in the last sentence "how is data is represented in the computer memory and how to perform operations on this data."