DaniWeb Forum Index > Software Development > C++

C++ RSS

array indexing vs pointer arithmetic

Please support our C++ advertiser: Intel Parallel Studio Home

•

Join Date: Nov 2008

Posts: 81

Reputation: minas1 is an unknown quantity at this point

Solved Threads: 8

minas1

Offline

Junior Poster in Training

array indexing vs pointer arithmetic

Nov 9th, 2008

 Help with Code Tags 
 C++ Syntax (Toggle Plain Text) 
int x[5];
x[4] = 10;
*(x + 4) = 10;
int x[5];
x[4] = 10;
*(x + 4) = 10;

Array indexing has a cleaner syntax but (as I've read) pointer arithmetic is faster. My question is, is it worth to use pointer arithmetic? Is there a noticeable difference?

Last edited by minas1; Nov 9th, 2008 at 7:55 am.

•

Join Date: Oct 2008

Posts: 1,977

Reputation: ddanbe has much to be proud of

Solved Threads: 288

ddanbe

Offline

Posting Virtuoso

Re: array indexing vs pointer arithmetic

Nov 9th, 2008

•

Array indexing has a cleaner syntax

You said it yourself! So why bother and make your life difficult. When you come back later to your code it will be more easy to understand then if you used pointer arithmetic. If you have a good C++ compiler he would translate both options the same way!

Last edited by ddanbe; Nov 9th, 2008 at 8:28 am.

Today is a gift, that's why it is called "The Present".
Make love, no war. Cave ab homine unius libri.
Danny

•

Join Date: Nov 2008

Posts: 81

Reputation: minas1 is an unknown quantity at this point

Solved Threads: 8

minas1

Offline

Junior Poster in Training

Re: array indexing vs pointer arithmetic

Nov 9th, 2008

Alright, thanks!

•

Join Date: Sep 2004

Posts: 7,752

Reputation: Narue has a reputation beyond repute

Solved Threads: 740

Narue

Offline

Code Goddess

Re: array indexing vs pointer arithmetic

Nov 9th, 2008

>but (as I've read) pointer arithmetic is faster
Prove it. In your example, the two are quite likely compiled to exactly the same machine code. Array subscripting is literally syntactic sugar for the equivalent pointer offset calculation. A more likely example is this:

 Help with Code Tags 
 C++ Syntax (Toggle Plain Text) 
int x[N];
int *p = x;
 
for ( int i = 0; i < N; i++ )
  process ( x[i] );
 
for ( int i = 0; i < N; p += i )
  process ( *p );
int x[N];
int *p = x;

for ( int i = 0; i < N; i++ )
  process ( x[i] );

for ( int i = 0; i < N; p += i )
  process ( *p );

The latter could very well be faster (though I would question why you're worried about such micro-optimizations) due to the fact that the body of the loop is only performing a dereference rather than an addition and a dereference.

My advice is not to worry about it. Use whichever more clearly displays your intentions.

Last edited by Narue; Nov 9th, 2008 at 10:32 am.

I'm here to prove you wrong.

•

Join Date: Jul 2008

Posts: 2,001

Reputation: ArkM has much to be proud of

Solved Threads: 343

ArkM

Offline

Postaholic

Re: array indexing vs pointer arithmetic

Nov 9th, 2008

From the C++ Standard:

•

The expression E1[E2] is identical (by definition) to *((E1)+(E2)).

Sometime pointer arithmetics code is evidently cleaner than "subsripted" one:

 Help with Code Tags 
 C++ Syntax (Toggle Plain Text) 
int countDigits(const char* str)
{
    int n = 0;
    if (str)
    while (int c = *str++)
        if (c >= '0' && c <= '9')
            ++n;
    return n;
}
int countDigits(const char* str)
{
    int n = 0;
    if (str)
    while (int c = *str++)
        if (c >= '0' && c <= '9')
            ++n;
    return n;
}

Sometimes we have no choice: as usually (but not always) pointer arithmetics code is faster than "subscripted" one on embedded systems where we (often) must save on every microsecond...

It's a far-fetched problem. It's not a language problem...