{"id":7192,"date":"2025-10-11T00:01:29","date_gmt":"2025-10-11T07:01:29","guid":{"rendered":"https:\/\/c-for-dummies.com\/blog\/?p=7192"},"modified":"2025-10-18T10:00:07","modified_gmt":"2025-10-18T17:00:07","slug":"the-ever-expanding-pointer-array","status":"publish","type":"post","link":"https:\/\/c-for-dummies.com\/blog\/?p=7192","title":{"rendered":"The Ever-Expanding Pointer Array"},"content":{"rendered":"

Perhaps the most difficult part of learning C is understanding and coding pointers. Even when you have a grip on things, it helps to keep fresh and practice new and utterly obnoxious ways to play with pointers.
\n
\nFirst, I’m creating a new rule rising from a post I made on LinkedIn<\/a>. The feedback I’ve received from fellow C programmers is to always initialize your pointers variables to NULL. In fact, one coder said to initialize all<\/em> of your variables, no matter what the data type.<\/p>\n

I like this idea. In fact, in many programming languages, all variables are initialized to zero or some default value like NULL; strings are declared as empty.<\/p>\n

Second, I was trying to figure out a way to incrementally expand an array of pointers. Not just a construction like an array of strings, but a pointer that holds the addresses of allocated buffers. This goal proved to be an interesting mind game that I believe I can attempt only while sober.<\/p>\n

To start, here is sample code, the base upon which I built my monster:<\/p>\n

2025_10_11-Lesson.c<\/a><\/h3>\n
\r\n#include <stdio.h>\r\n#include <stdlib.h>\r\n#include <time.h>\r\n\r\n\/* allocate storage for ten integers *\/<\/span>\r\nint *ten(void)\r\n{\r\n    int *iptr = NULL;\r\n\r\n    iptr = malloc( sizeof(int) * 10 );\r\n\r\n    return(iptr);\r\n}\r\n\r\nint main()\r\n{\r\n    int *tenint = NULL;\r\n    int x;\r\n\r\n    \/* seed the randomizer *\/<\/span>\r\n    srand( (unsigned)time(NULL) );\r\n\r\n    \/* get the storage *\/<\/span>\r\n    tenint = ten();\r\n    if( tenint==NULL )\r\n    {\r\n        fprintf(stderr,\"Unable to allocate\\n\");\r\n        exit(1);\r\n    }\r\n    puts(\"Storage for 10 integers allocated\");\r\n\r\n    \/* assign the values *\/<\/span>\r\n    for( x=0; x<10; x++ )\r\n        *(tenint+x) = rand() % 10 + 10;\r\n\r\n    \/* output the results *\/<\/span>\r\n    for( x=0; x<10; x++ )\r\n        printf(\"%d\\n\",*(tenint+x) );\r\n\r\n    \/* clean-up *\/<\/span>\r\n    free(tenint);\r\n    return 0;\r\n}<\/pre>\n
The ten()<\/em> function allocates storage for ten integers. Variable iptr<\/code> is initialized to NULL, which is my new thing. The function does no error-checking, returning either a valid address for allocated storage or NULL for some kind of booboo.<\/p>\n
In the main()<\/em> function, int<\/em> pointer tenint<\/code> holds an address for integer storage. It’s initialized to NULL: int *tenint = NULL;<\/code><\/p>\n
The randomizer is seeded: srand( (unsigned)time(NULL) );<\/code><\/p>\n
The ten()<\/em> function is called with the value returned stored in variable tenint<\/code>. A check is made to confirm proper allocation; upon failure, the program exits.<\/p>\n
Upon success, a for<\/em> loop allocates random values from 10 through 19 to the ten integer-sized cubbies in memory, stored in pointer tenint<\/code>:<\/p>\n
for( x=0; x<10; x++ )
\n    *(tenint+x) = rand() % 10 + 10;<\/code><\/p>\n
The expression *(tenint+x)<\/code> references each subsequent integer-sized cubby stored at address tenint<\/code>. The result of tenint+x<\/code> is calculated by using pointer math: each value of x<\/code> increases the offset by an integer-sized chunk in memory. The *<\/code> (dereferencing) operator refers to the value at the location, which is where the random integer is stored.<\/p>\n
The next for<\/em> loop outputs the stored values. Then storage is freed and the program ends.<\/p>\n
Here’s a sample run:<\/p>\n
Storage for 10 integers allocated
\n11
\n16
\n15
\n14
\n15
\n16
\n10
\n15
\n17
\n12<\/code><\/p>\n
Each run generates a different set of integers. Nothing guarantees that values aren’t repeated or in any specific order.<\/p>\n
This code represents only the base. My goal is to add another stick of ten integers, and then another one after that. The program keeps adding batches of ten integers and manages them all. This process begins starting with next week’s Lesson<\/a>.<\/p>\n","protected":false},"excerpt":{"rendered":"
Managing a buncha pointers. Continue reading →<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[2],"tags":[],"class_list":["post-7192","post","type-post","status-publish","format-standard","hentry","category-main"],"_links":{"self":[{"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/7192","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=7192"}],"version-history":[{"count":4,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/7192\/revisions"}],"predecessor-version":[{"id":7214,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/7192\/revisions\/7214"}],"wp:attachment":[{"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=7192"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=7192"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=7192"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}