Note
space for my second brain- {1} 240611100301Different types of arrays
- {1a} 240611103553Static arrays are created at compile-time
- {1b} 250101052312Dynamic arrays are created at runtime
- {1b1} 250130073757Difference between static and dynamic arrays
- {1b2} 250130081822Dynamically allocated memory must be freed manually
- {1b2a} 250131121405Ruby automatically reclaims unused memory
- {1c} 250101173519Jagged Arrays
- {1d} 240610152201Arrays store data of the same type
- {1d1} 250201111442Ruby arrays can hold multiple data types
- {1d1a} 250201115105Use void* to simulate Ruby-like arrays in C
- {1e} 250203120334When to use an array?
- {2} 240610164501Data structures are use-case dependent
- {3} 241026090000A linked list is a linear data structure composed of nodes
- {3a} 250204123024Losing the head pointer causes a memory leak
- {3b} 250205072700Different types of linked lists
- {3b1} 241113121417A singly linked list allows only one-way traversal
- {3b2} 241114123800A doubly linked list allows two-way traversal
- {3b3} 241202181900A circular linked list loops back to the head, forming a cycle