StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

POint Array in a Array of Structs in a Struct
primarykey
Id
17055824
data
AcceptedAnswerId
0
AnswerCount
1
ClosedDate
CommentCount
4
CommunityOwnedDate
CreationDate
2013-06-12T00:14:39.087
FavoriteCount
0
LastActivityDate
2013-06-12T01:53:38.587
LastEditDate
LastEditorUserId
0
OwnerUserId
2476518
ParentId
0
PostTypeId
1
Score
0
ViewCount
673
LastEditorDisplayName
text
Body
I hope I don't get hammered on this site. I am a novice programmer having much difficulty with this concept. I have been tasked with memoizing the fibonacci sequence. A concept which I think I have a descent grasp on but of course the implementation guidelines are as follows which is what is confusing me. <pre><code>typedef struct Memo { // dynamically allocated HugeInteger array to store our Fibonacci numbers struct HugeInteger *F; // the current length (i.e., capacity) of this array int length; } Memo; typedef struct HugeInteger { // a dynamically allocated array to hold the digits of a huge integer int *digits; // the length of the array (i.e., number of digits in the huge integer) int length; } HugeInteger; </code></pre> Already as you can see the fibonacci numbers will not be simple "int" but rather they will be numbers stored in an int array so for instance int - 134528 will be in an array like so int someNumber[6] = {1,3,4,5,2,8} I have created the memo like so: <pre><code>Memo *createMemo(void) { /* Description: Create and initialize a Memo struct: 1. Dynamically allocate space for a new Memo struct. 2. Within the Memo struct, dynamically allocate an array of INIT_MEMO_SIZE number of HugeInteger structs. INIT_MEMO_SIZE is defined in Fibonacci.h. Note: This is an array of actual structs, not pointers to structs. So, you cannot set the individual elements of this array to NULL, and you cannot free() them. 3. Once the array is created, initialize memo→length appropriately. 4. Make two calls to HugeInit() to initialize F[0] and F[1] (your two Fibonacci base cases) within the Memo struct. 5. For all remaining F[i], initialize the digits field to NULL and the length field to 0 to indicate that F[i] has not yet been memoized. Panic: If any calls to malloc() fail within this function, call panic() (defined in HugeInteger.c) with the following string argument: “ERROR: out of memory in createMemo()\n”. Returns: A pointer to the new Memo struct. */ int i; //Dynamically allocate new Memo Memo *newMemo = malloc(sizeof(Memo)); //Check if malloc failed if(newMemo == NULL) panic("ERROR: out of memory in createMemo()\n"); //Malloc a newMemo->F struct newMemo->F = malloc(sizeof(HugeInteger *) * INIT_MEMO_SIZE); //Check if malloc failed if(newMemo->F == NULL) panic("ERROR: out of memory in createMemo()\n"); //Initialize the length of the Memo newMemo->length = INIT_MEMO_SIZE; //Make two calls to HugeInit to initialize F[0] and F[1] base cases HugeInit(&newMemo->F[0], 0); HugeInit(&newMemo->F[1], 1); //Initialize the rest of F[i] to NULL & length to 0 so I now it's not memoized for(i=2; i<INIT_MEMO_SIZE; i++) { newMemo->F[i].digits = NULL; newMemo->F[i].length = 0; } //Return the newly created Memo return newMemo; } </code></pre> After I create the new Memo I now enter the fibonacci function and this is where my brain fails on me. I implemented my fibonacci function like so: struct HugeInteger *fib(int n, Memo *memo) <pre><code>{ /* Description: Implement a recursive solution that checks whether F(n) has already been memoized and, if so, returns F(n) without making any recursive calls. 1. If n exceeds the bounds of the array in memo, call expandMemo(). For more information on what parameters to pass to expandMemo(), refer to its function description above. 3. In order to compute and memoize F(n), you must call the HugeAdd() function that is defined in HugeInteger.c. The function requires F(n - 1) and F(n - 2) to be memoized already. HugeAdd() will memoize F(n) if you call it correctly (i.e., it will store the result in memo). Returns: The address of the struct within memo that holds F(n). If memo is NULL or n is less than 0, return NULL without performing any recursive calls and without calling expandMemo(). */ int i; //Handle for negative numbers if(n < 0 || memo == NULL) return NULL; //Handle for index out of bounds if(n > memo->length) expandMemo(memo, n); //Check Memory if F[n] already exists and return it if(memo->F[n].digits != NULL) return &memo->F[n]; //return the base cases; if(n < 2) return &memo->F[n]; else { //My thought process was to make two recursive calls and then use the provided HugeAdd function to add the information together. HOWEVER the HugeAdd function is a void function so it does it's thing and returns nothing. basically it takes the two arrays and adds them index by index like you would on paper. The first argument of Huge add is the first HugeInteger to be added, then the second argument is the second HugeInteger to be added, and the third argument is the HugeInteger where you want the result. second problem I see is that temp1 is never being malloc'd or initialized so as the fibonacci series grows temp1 will need to be malloc'd accordingly and then it will need to be filled accordingly. I am lost completely as to how to implement this. HugeInteger *temp1 = fib(n-1, memo); HugeInteger *temp2 = fib(n-2, memo); HugeAdd(&temp1, &temp2, &memo->F[n]); } return &memo->F[n]; } </code></pre> I am completely lost as how to get the fibonacci numbers into their respective array slots and then push them to the HugeAdd function. The functions I have outlined cannot be changed either I can only create auxiliary function to assist. I SIMPLY want insight, I understand I must trek through the depths of programming hell alone just like everyone else, I just want a little guidance so I can stop coding garbage for 6 hours at a time only to get absolutely nowhere. 
Tags
<c><arrays><struct><fibonacci><memoization>
Title
int Array in a Array of Structs in a Struct
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. This table or related slice is empty.
PostTypePostTypeId
1. PTQuestion
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. USFunkyT
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. PO
 singulars
 PostTypePostTypeId
 PTAnswer
VotesPostIdCreationDate
1. This table or related slice is empty.
CommentsPostId

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.