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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 15, 20262026-06-15T15:35:22+00:00 2026-06-15T15:35:22+00:00

We have the code: int arr[3][4]; So arr is: An array of 3 elements,

  • 0

We have the code:

int arr[3][4];

So arr is:

  1. An array of 3 elements, and every element is an array of 4 int.

  2. An array of 4 elements, and every element is an array of 3 int.

which one is right and why? How does it work with higher dimensional array? I suppose this is concerning operator precedence and associativity.

  • 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-06-15T15:35:23+00:00Added an answer on June 15, 2026 at 3:35 pm

    Your first interpretation is correct.

    Such declarations are best parsed using the Right Left rule, which you can read here and here

    $8.3.4 from the C++ draft Standard:
    …

    Example: consider int x[3][5]; Here x is a 3 × 5 array of integers.

    …

    Note: It follows from all this that arrays in C++ are stored row-wise
    (last subscript varies fastest) and that the first subscript in the
    declaration helps determine the amount of storage consumed by an array
    but plays no other part in subscript calculations. —end note ]

    Note C++ does not have operator[][]. It has only operator[]

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

Sidebar

Related Questions

I have this code: val arr: Array[Int] = ... val largestIndex = { var
I have the following piece of code in C++. int arr[] = {1, 2,
When you have code: for(int i = 0; i<N; i++) { array[i] += N
I have the following code: #include <stdlib.h> #include <stdio.h> #define SIZE 100 int* arr;
I have the following code which works fine... int testarr[3][3] = { {1,1,1}, {1,0,1},
I have the following code : int *edges[500]; char arr[] = {'c','d'}; edges[0] =
i have the following code int arr[5]; printf(Input values:); for (i=0;i<5;i++) scanf(%d,&arr[i]); pthread_create(&thread1, NULL,
Here is the code I have so far: public static int mode(int[][] arr) {
I have a piece of code which will find out the repeating elements in
I have the following piece of code, which is an implementation of an array

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.