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 7501491
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 29, 20262026-05-29T20:33:10+00:00 2026-05-29T20:33:10+00:00

I need to implement a very large matrix, say NxN in Standard C. The

  • 0

I need to implement a very large matrix, say NxN in Standard C. The matrix must store a truth table, that is

matrix[i][j] = [true|false]

I know I could simply use a int matrix, or boolean type if using C99, but was looking for the most lightweight solution in terms of memory.

  • 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-29T20:33:14+00:00Added an answer on May 29, 2026 at 8:33 pm

    The most lightweight solution in terms of memory is saving eight boolean in a char:

    unsigned char getBit(char byte, unsigned short bit){
        assert(bit < 8);
        return byte&(1<<bit);
    }
    

    Then you can store a N x 8M matrix by saving the bytes in each row. If many of those bytes are empty then you should use a sparse matrix format, for example compressed spares row.

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

Sidebar

Related Questions

I need some suggestions for how to implement a very basic mechanism that logs
I need to store a very large number of files to a MySQL database.
Say I need some very special multiplication operator. It may be implemented in following
We need to implement a simple state machine in C . Is a standard
I need to read from a dataset which is very large, highly interlinked, the
In my 2D game I need textures that may be arbitrarily large, can be
I'm writing a program which will need to do a very large number of
I have a very large 60+ question form that the user can start to
I have a relatively large set of data that lends itself very naturally to
Here is a hypotetical scenario. I have very large number of user names (say

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.