Master Through Active Recall

Time Complexity: O(1) allocation, O(n) traversal. Space: O(n) on heap.

#include <stdio.h>
#include <stdlib.h>

int main() {
    int *arr = (int *)malloc(5 * sizeof(int));
    if (!arr) return 1;
    for(int i = 0; i < 5; i++) *(arr + i) = (i + 1) * 10;
    for(int i = 0; i < 5; i++) printf("%d ", *(arr + i));
    free(arr);
    return 0;
}

• Pointer stores hexadecimal address of another variable (* dereference, & address-of)
• Dynamic allocation via malloc(), calloc(), realloc(), and free() in <stdlib.h>
• Dangling pointers occur when referencing deallocated heap memory
• Pointer arithmetic: ptr + 1 advances by sizeof(data_type) bytes