Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 580149
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 13, 20262026-05-13T14:26:32+00:00 2026-05-13T14:26:32+00:00

I have a program that has an array of pointers such as: INTLIST* myArray[countOfRows];

  • 0

I have a program that has an array of pointers such as:

INTLIST* myArray[countOfRows];

each myArray pointer points to a linked list, basically it becomes an M*N matrix.

So for example:

3 2 1
2 1 0
1 9 8

So myArray[0] is a linked list with 3->2->1 and myArray[1] is a linked list with 2->1->0.. and so on. I have a function that prints the matrix which basically does this:

for(int i = 0; i<countOfRows; i++)
   list_print(myArray[i]);

And then my list_print function is like so:

 void list_print(INTLIST* list)
  { /* This function simply prints the linked list out */
     INTLIST* temp=NULL;  //temp pointer to head of list

     /* loops through each node of list printing its datum value */
     for(temp=list; temp!=NULL; temp=temp->next)
        {
           printf("%d ", temp->datum);         //print datum value
        }
     printf("\n");
  }

This is all great and working fine, (I know i could optimize and clean up and I promise to do so). Now my next question is I need to write this matrix out to a text file. So I tried this:

 char* outputFileName = "out.txt";
 FILE* ofp;

 ofp=fopen(outputFileName, "w");

 if(ofp == NULL) 
 {
        printf("Cannot open writeable file!");
        return -1;
 }

 for(i=0; i<fileLineCount; i++)
  {
     fprintf(ofp, list_print(aList[i]);
  } 

But I take it its not that simple. Can anyone show me how to print this out to a text file…

Thanks

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-13T14:26:32+00:00Added an answer on May 13, 2026 at 2:26 pm

    Use the fprintf function in your list_print function using a FILE * parameter as shown in the example:

    void list_print(INTLIST* list, FILE *fp)
      { /* This function simply prints the linked list out */
         INTLIST* temp=NULL;  //temp pointer to head of list
    
         /* loops through each node of list printing its datum value */
         for(temp=list; temp!=NULL; temp=temp->;next)
            {
               fprintf(fp, "%d ", temp->datum);         //print datum value
            }
         fprintf(fp, "\n");
      }
    

    Would be done like this:

    int main(){
       FILE *fp;
       fp = fopen("data.txt", "w");
       for(i=0; i<fileLineCount; i++)
       {
          list_print(alist[i], fp);
       }
       fclose(fp);
    }
    

    Or

    If you wish to retain the binary dump of the linked list from memory to disk (this is the simple way of explaining it), top off my head:

    for(i=0; i<fileLineCount; i++)
    {
         fwrite(alist[i], sizeof(alist[i]), 1, ofp);
    }
    

    Then when reading from it,

    for(i=0; i<fileLineCount; i++)
    {
         fread(&alist[i], sizeof(alist[i]), 1, ofp);
    }
    

    Edit: I was hesitant to include the above, but paxdiablo pointed out a flaw in my fread(...) and fwrite(...) code above, and realized he is right. When doing the binary write of the linked list, the memory addresses references in the linked-list will be invalid when read in the next time. Thanks paxdiablo!

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Ask A Question

Stats

  • Questions 379k
  • Answers 379k
  • Best Answers 0
  • User 1
  • Popular
  • Answers
  • Editorial Team

    How to approach applying for a job at a company ...

    • 7 Answers
  • Editorial Team

    How to handle personal stress caused by utterly incompetent and ...

    • 5 Answers
  • Editorial Team

    What is a programmer’s life like?

    • 5 Answers
  • Editorial Team
    Editorial Team added an answer I think you are trying to use the auto-increment column… May 14, 2026 at 9:36 pm
  • Editorial Team
    Editorial Team added an answer What you are seeing here is called "slicing". Casting an… May 14, 2026 at 9:36 pm
  • Editorial Team
    Editorial Team added an answer Make sure the two submit buttons have names. I.E: <input… May 14, 2026 at 9:36 pm

Trending Tags

analytics british company computer developers django employee employer english facebook french google interview javascript language life php programmer programs salary

Top Members

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.