C and Pointers

1, the scalar parameter passed to the function is called by the value of the
2. The array arguments passed to the function behave as if they were called by the address.
3. ADT can limit the scope of functions and data definitions---black box design
3. Restricting access to the module is implemented using the use of the static keyword to restrict access to functions and data that are not interfaces
4. Two conditions of recursion: 1, there is a qualification of 2, and each recursion becomes more and more close to this restriction condition.
5.* (* (matrix+1) +5) * (Matrix + 1) is matrix[1] then the original is * (Matrix[1] + 5) matrix[1] A sub-array is selected, so its type is a pointer to shaping. We add 5 to this pointer and then perform an indirect access operation. So this expression can also be written matrix[1][5]
6.int (*P) [10] line pointer
7 memset (buffer, 0, SIZE);
8, the bit segment wraps the odd-length data together, saving the storage space.
9. Union is to refer all members to the same location in memory
*calloc (size_t num_elements,size_t element_size);
ReAlloc (void *ptr,size_t new_size)
The main difference between malloc and calloc is that the latter initializes it to 0 before returning a pointer to memory.
11: New node added to linked list
NewNode, fwd = next;
This, fwd = NewNode;
NewNode->BWD = this!=rootp? This:null;
(Next!) =NULL?NEXT:ROOTP)-BWD = Newnnode;
272---274 page note about the simplification of double-linked list insertion
The meaning of "xyz" +1 is to calculate the value of "pointer value plus 1". The result is a pointer to the second character in the string: Y
* "xyz" means X
The 13:srand function produces a pseudo-random number. Srand ((unsigned int) time (0))
14: Processor Time <time.h> clock function returns the time consumed from the start of the program to the execution of the processor
clock_t clock (void);
15: Stack definition: The user does not have the risk of calling these two functions incorrectly when using a stack of static array types, because they do not exist in that module
16:A) Any one of the logical operators has a lower precedence than any one of the relational operators
b) The shift operator has a lower precedence than the arithmetic operator, but is higher than the relational operator

C and Pointers