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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 26, 20262026-05-26T15:14:46+00:00 2026-05-26T15:14:46+00:00

supposing to have two arrays a[N],b[N] containing only 0 and 1 values, is there

  • 0

supposing to have two arrays a[N],b[N] containing only 0 and 1 values, is there a way to calculate c = a || b without a loop like the following (in C)?

#define N 10
char a[N];
char b[N];
char c[N];


// suppose to do some operations on a and b so that 
// for each i a[i] == 0 or a[i] == 1
// and the same for b

// this is the loop i would want to avoid
int i;
for(i=0;i<N;i++)
     c[i] = a[i] || b[i];

I would want to calculate the result of (a || b) directly comparing the two memory areas, but i don’t know if it’s possible.
thank you very much for your attention.

  • 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-26T15:14:47+00:00Added an answer on May 26, 2026 at 3:14 pm

    Since bitwise or is an operation that has to be applied to a single value, I don’t think there is. Is there a particular reason you want to avoid the loop? If it’s a hassle, making a function out of it is easy.

    Edit: The question has now changed to logical OR, but I don’t think the answer is much different.

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

Sidebar

Related Questions

Supposing I have two different languages for Localizable.strings and a single target. There's any
MVC newbie question re binders. Supposing I have two strongly typed partial actions that
I have two entities with an 1-N relation, like this : table_a ------- id
Supposing that I have two TextBlock elements, one being a label for the second,
What is the recommended way of handling the following type of situations: Supposing I
Supposing I have the following LambdaExpression: var itemParam = Expression.Parameter(typeof(Thing), thing); var someValue =
Supposing I have two collections, posts and comments. post = { _id: 1, language:
supposing that I have two tables with same 3 columns: ID (int, identity), text
Supposing I have the following list: A | B | C | D or
Supposing I have a list/tuple like this: MyLocation = 'DE' ( ('Pencils', 'Artists Pencils',

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.