Chapter 7 - Pointers

Outline
7.1 7.2 7.3 7.4 7.5 7.6 7.7 7.8 7.9 7.10 7.11 Introduction Pointer Variable Declarations and Initialization Pointer Operators Calling Functions by Reference Using the Const Qualifier with Pointers Bubble Sort Using Call by Reference Pointer Expressions and Pointer Arithmetic The Relationship between Pointers and Arrays Arrays of Pointers Case Study: A Card Shuffling and Dealing Simulation Pointers to Functions

2000 Prentice Hall, Inc. All rights reserved.

7.1

Introduction

Pointers
Powerful, but difficult to master Simulate call-by-reference Close relationship with arrays and strings

2000 Prentice Hall, Inc. All rights reserved.

Pointer Variable Declarations and Initialization Pointer variables

Contain memory addresses as their values count Normal variables contain a specific value (direct 7 reference) Pointers contain address of a variable that has a specific value (indirect reference) countPtr count
7

7.2

Indirection - referencing a pointer value

2000 Prentice Hall, Inc. All rights reserved.

7.2

Pointer Variable Declarations and Initialization (II)

Pointer declarations
* used with pointer variables int *myPtr; Declares a pointer to an int (pointer of type int *) Multiple pointers, multiple * int *myPtr1, *myPtr2; Can declare pointers to any data type Initialize pointers to 0, NULL, or an address 0 or NULL - points to nothing (NULL preferred)

2000 Prentice Hall, Inc. All rights reserved.

7.3

Pointer Operators

& (address operator)

Returns address of operand
int y = 5; int *yPtr; yPtr = &y; //yPtr gets address of y yPtr points to y

yPtr

y 5

yptr 500000 600000 600000

y 5

Address of y is value of yptr

2000 Prentice Hall, Inc. All rights reserved.

7.3

Pointer Operators (II)

* (indirection/dereferencing operator)
Returns a synonym/alias of what its operand points to *yptr returns y (because yptr points to y) * can be used for assignment
Returns alias to an object *yptr = 7; // changes y to 7

Dereferenced pointer (operand of *) must be an lvalue (no constants)

2000 Prentice Hall, Inc. All rights reserved.

7.3

Pointer Operators (III)

* and & are inverses

They cancel each other out
*&yptr -> * (&yptr) -> * (address of yptr)-> returns alias of what operand points to -> yptr &*yptr -> &(*yptr) -> &(y) -> returns address of y, which is yptr -> yptr

2000 Prentice Hall, Inc. All rights reserved.

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24

/* Fig. 7.4: fig07_04.c Using the & and * operators */ #include <stdio.h> int main() { int a; int *aPtr; a = 7; aPtr = &a;

Outline
The address of a is the value 1. Declare variables of aPtr. 2 Initialize variables The * operator returns an alias to what its operand 3. Print points to. aPtr points to a, so *aPtr returns a.

/* a is an integer */ /* aPtr is a pointer to an integer */

/* aPtr set to address of a */

printf( "The address of a is %p" "\nThe value of aPtr is %p", &a, aPtr ); printf( "\n\nThe value of a is %d" "\nThe value of *aPtr is %d", a, *aPtr ); printf( "\n\nShowing that * and & are inverses of " "each other.\n&*aPtr = %p" "\n*&aPtr = %p\n", &*aPtr, *&aPtr ); return 0; }

Notice how * and & are inverses

The address of a is 0012FF88 The value of aPtr is 0012FF88 The value of a is 7 The value of *aPtr is 7 Proving that * and & are complements of each other. &*aPtr = 0012FF88 *&aPtr = 0012FF88 2000 Prentice Hall, Inc. All rights reserved.

Program Output

7.4

Calling Functions by Reference

Call by reference with pointer arguments

Pass address of argument using & operator Allows you to change actual location in memory Arrays are not passed with & because the array name is already a pointer

* operator
Used as alias/nickname for variable inside of function void double(int *number) { *number = 2 * (*number); } *number used as nickname for the variable passed
2000 Prentice Hall, Inc. All rights reserved.

1 2 3 4 5 6

/* Fig. 7.7: fig07_07.c Cube a variable using call-by-reference with a pointer argument */ #include <stdio.h>

Outline

7 void cubeByReference( int * );

8 9 11 12 13 14 15 16 int main() int number = 5; 10 {

/*

Notice how the address of prototype */given number is cubeByReference expects a pointer (an address of a variable).

1. Function prototype - takes a pointer to an int.

1.1 Initialize variables

2. Call function

printf( "The original value of number is %d", number ); cubeByReference( &number ); printf( "\nThe new value of number is %d\n", number );

17
18 } 19

return 0;

3. Define function Inside cubeByReference, *nPtr is used (*nPtr is number).

20 void cubeByReference( int *nPtr ) 21 { 22 23 } *nPtr = *nPtr * *nPtr * *nPtr; /* cube number in main */

The original value of number is 5 The new value of number is 125

Program Output

2000 Prentice Hall, Inc. All rights reserved.

7.5

Using the Const Qualifier with Pointers

const qualifier - variable cannot be changed

Good idea to have const if function does not need to change a variable Attempting to change a const is a compiler error

const pointers - point to same memory location

Must be initialized when declared int *const myPtr = &x;
Type int *const - constant pointer to an int

const int *myPtr = &x;

Regular pointer to a const int

const int *const Ptr = &x;

const pointer to a const int x can be changed, but not *Ptr

2000 Prentice Hall, Inc. All rights reserved.

1 2 3 4

/* Fig. 7.13: fig07_13.c Attempting to modify a constant pointer to non-constant data */

Outline

5 #include <stdio.h>
6 7 8 9 int main() { int x, y;

1. Declare variables 1.1 Declare const pointer to an int. 2. Change *ptr (which is x). 2.1 Attempt to change ptr. 3. Output

10
11 12 13 14 15 16 17 18 19 } return 0; *ptr = 7; ptr = &y;

Changing *ptr is allowed - x is not a constant.

int * const ptr = &x; /* ptr is a constant pointer to an integer. An integer can be modified through ptr, but ptr always points to the same memory location. */

Changing ptr is an error ptr is a constant pointer.

FIG07_13.c: Error E2024 FIG07_13.c 16: Cannot modify a const object in function main *** 1 errors in Compile ***

Program Output

2000 Prentice Hall, Inc. All rights reserved.

7.6

Bubble Sort Using Call-by-reference

Implement bubblesort using pointers

Swap two elements swap function must receive address (using &) of array elements
Array elements have call-by-value default

Using pointers and the * operator, swap can switch array elements

Psuedocode
Initialize array print data in original order Call function bubblesort print sorted array Define bubblesort

2000 Prentice Hall, Inc. All rights reserved.

7.6

Bubble Sort Using Call-by-reference (II)

sizeof
Returns size of operand in bytes For arrays: size of 1 element * number of elements if sizeof(int) = 4 bytes, then
int myArray[10]; printf( "%d", sizeof( myArray ) ); will print 40

sizeof can be used with

Variable names Type name Constant values
2000 Prentice Hall, Inc. All rights reserved.

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32

/* Fig. 7.15: fig07_15.c This program puts values into an array, sorts the values into ascending order, and prints the resulting array. */ #include <stdio.h> #define SIZE 10 void bubbleSort( int *, const int ); int main() { int a[ SIZE ] = { 2, 6, 4, 8, 10, 12, 89, 68, 45, 37 }; int i; Bubblesort gets passed printf( "Data items in original order\n" ); for ( i = 0; i < SIZE; i++ ) printf( "%4d", a[ i ] );

Outline

1. Initialize array 1.1 Declare variables 2. Print array 2.1 Call bubbleSort 2.2 Print array

the

address of array elements (pointers). The name of an array is a pointer.

bubbleSort( a, SIZE ); /* sort the array */ printf( "\nData items in ascending order\n" ); for ( i = 0; i < SIZE; i++ ) printf( "%4d", a[ i ] ); printf( "\n" ); return 0; } void bubbleSort( int *array, const int size ) { 2000 Prentice Hall, Inc. *, All rights void swap( int int reserved. * );

33 34

int pass, j; for ( pass = 0; pass < size - 1; pass++ )

Outline

35
36 37 38 39 40 } 41 42 void swap( int *element1Ptr, int *element2Ptr ) 43 { 44 45 46 47 } int hold = *element1Ptr; *element1Ptr = *element2Ptr; *element2Ptr = hold; if ( array[ j ] > array[ j + 1 ] ) swap( &array[ j ], &array[ j + 1 ] ); for ( j = 0; j < size - 1; j++ )

3. Function definitions

Data items in original order 2 6 4 8 10 12 89 68 Data items in ascending order 2 4 6 8 10 12 37 45

Program Output
45 37

2000 Prentice Hall, Inc. All rights reserved.

7.7

Pointer Expressions and Pointer Arithmetic

Arithmetic operations can be performed on pointers

Increment/decrement pointer (++ or --) Add an integer to a pointer( + or += , - or -=) Pointers may be subtracted from each other Operations meaningless unless performed on an array

2000 Prentice Hall, Inc. All rights reserved.

7.7

Pointer Expressions and Pointer Arithmetic (II)

5 element int array on machine with 4 byte ints

vPtr points to first element v[0] at location 3000. (vPtr = 3000) vPtr +=2; sets vPtr to 3008 vPtr points to v[2] (incremented by 2), but machine has 4 byte ints.

location 3000 3004 v[0] v[1]

3008 v[2]

3012 v[3]

3016 v[4]

pointer variable vPtr

2000 Prentice Hall, Inc. All rights reserved.

7.7

Pointer Expressions and Pointer Arithmetic (III)

Subtracting pointers
Returns number of elements from one to the other.
vPtr2 = v[2]; vPtr = v[0]; vPtr2 - vPtr == 2.

Pointer comparison ( <, == , > )

See which pointer points to the higher numbered array element Also, see if a pointer points to 0

2000 Prentice Hall, Inc. All rights reserved.

7.7

Pointer Expressions and Pointer Arithmetic (IV)

Pointers of the same type can be assigned to each other

If not the same type, a cast operator must be used Exception: pointer to void (type void *)
Generic pointer, represents any type No casting needed to convert a pointer to void pointer void pointers cannot be dereferenced

2000 Prentice Hall, Inc. All rights reserved.

7.8

The Relationship Between Pointers and Arrays

Arrays and pointers closely related

Array name like a constant pointer Pointers can do array subscripting operations

Declare an array b[5] and a pointer bPtr

bPtr = b; Array name actually a address of first element OR bPtr = &b[0] Explicitly assign bPtr to address of first element

2000 Prentice Hall, Inc. All rights reserved.

7.8

The Relationship Between Pointers and Arrays (II)

Element b[n]
can be accessed by *( bPtr + n ) n - offset (pointer/offset notation) Array itself can use pointer arithmetic.
b[3] same as *(b + 3)

Pointers can be subscripted (pointer/subscript notation)

bPtr[3] same as b[3]

2000 Prentice Hall, Inc. All rights reserved.

7.9

Arrays of Pointers

Arrays can contain pointers - array of strings

char *suit[4] = {"Hearts", "Diamonds", "Clubs", "Spades" };

String: pointer to first character char * - each element of suit is a pointer to a char Strings not actually in array - only pointers to string in array
suit[0] suit[1] suit[2] suit[3] H D e i a a r m t o s n \0 d s \0

C
S

l
p

u
a

b
d

s
e

\0
s \0

suit array has a fixed size, but strings can be of any size.
2000 Prentice Hall, Inc. All rights reserved.

7.10 Case Study: A Card Shuffling and Dealing Simulation

Card shuffling program
Use array of pointers to strings Use double scripted array (suit, face)
Ace 0 Hearts Diamonds Clubs Spades 0 1 2 3 deck[2][12] represents the King of Clubs Clubs King 1 Two 2 Three Four Five Six Seven Eight Nine Ten Jack Queen King 3 4 5 6 7 8 9 10 11 12

The numbers 1-52 go into the array - this is the order they are dealt

2000 Prentice Hall, Inc. All rights reserved.

7.10 Case Study: A Card Shuffling and Dealing Simulation

Pseudocode - Top level:
First refinement

Shuffle and deal 52 cards

Initialize the suit array Initialize the face array Initialize the deck array

Third refinement Second refinement For each of the 52 cards Place card number in randomly selected unoccupied slot of deck Choose slot of deck randomly While chosen slot of deck has been previously chosen Choose slot of deck randomly Place card number in chosen slot of deck

Shuffle the deck

Deal 52 cards

For each of the 52 cards Find card number in deck array and print face and suit of card

For each slot of the deck array If slot contains card number Print the face and suit of the card

2000 Prentice Hall, Inc. All rights reserved.

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32

/* Fig. 7.24: fig07_24.c Card shuffling dealing program */ #include <stdio.h> #include <stdlib.h> #include <time.h> void shuffle( int [][ 13 ] ); void deal( const int [][ 13 ], const char *[], const char *[] ); int main() { const char *suit[ 4 ] = { "Hearts", "Diamonds", "Clubs", "Spades" }; const char *face[ 13 ] = { "Ace", "Deuce", "Three", "Four", "Five", "Six", "Seven", "Eight", "Nine", "Ten", "Jack", "Queen", "King" }; int deck[ 4 ][ 13 ] = { 0 }; srand( time( 0 ) ); shuffle( deck ); deal( deck, face, suit ); return 0; } void shuffle( int wDeck[][ 13 ] ) { int row, column, card;

Outline
1. Initialize suit and face arrays 1.1 Initialize deck array 2. Call function shuffle

2.1 Call function deal

3. Define functions

2000 Prentice Hall, rights reserved. for ( card =Inc. 1; All card <= 52; card++ ) {

33 34

do { row = rand() % 4;

35
36 37 38 39 40 } 41 }

column = rand() % 13;

} while( wDeck[ row ][ column ] != 0 );

The numbers 1-52 are Outline randomly placed into the deck array. 3. Define functions

wDeck[ row ][ column ] = card;

42 void deal( const int wDeck[][ 13 ], const char *wFace[], 43 44 { 45 46 47 48 49 50 for ( row = 0; row <= 3; row++ ) for ( card = 1; card <= 52; card++ ) int card, row, column; const char *wSuit[] )

Searches deck for the card number, then prints the face and suit.

51
52 53 54 55 56

for ( column = 0; column <= 12; column++ )

if ( wDeck[ row ][ column ] == card ) printf( "%5s of %-8s%c", wFace[ column ], wSuit[ row ], card % 2 == 0 ? '\n' : '\t' );

57 } 2000 Prentice Hall, Inc. All rights reserved.

Six Ace Ace Queen Ten Ten Ten Four Six Eight Nine Deuce Five Deuce Five King Deuce Ace Three Nine Four Eight Jack Five Four Jack

of of of of of of of of of of of of of of of of of of of of of of of of of of

Clubs Spades Hearts Clubs Hearts Spades Diamonds Diamonds Diamonds Hearts Hearts Spades Clubs Diamonds Spades Diamonds Hearts Clubs Clubs Clubs Hearts Diamonds Diamonds Hearts Clubs Clubs

Seven Ace Queen Seven Deuce Three Four Ten Six Three Three Six Eight Eight King Jack Queen King King Nine Queen Nine Seven Five Jack Seven

of of of of of of of of of of of of of of of of of of of of of of of of of of

Diamonds Diamonds Diamonds Hearts Clubs Spades Spades Clubs Spades Diamonds Hearts Hearts Clubs Spades Clubs Spades Hearts Spades Hearts Spades Spades Diamonds Clubs Diamonds Hearts Spades

Outline

Program Output

2000 Prentice Hall, Inc. All rights reserved.

7.11 Pointers to Functions

Pointer to function
Contains address of function Similar to how array name is address of first element Function name is starting address of code that defines function

Function pointers can be

Passed to functions Stored in arrays Assigned to other function pointers

2000 Prentice Hall, Inc. All rights reserved.

7.11 Pointers to Functions (II)

Example: bubblesort
Function bubble takes a function pointer
bubble calls this helper function this determines ascending or descending sorting

The argument in bubblesort for the function pointer:

bool ( *compare )( int, int ) tells bubblesort to expect a pointer to a function that takes two ints and returns a bool.

If the parentheses were left out:

bool *compare( int, int )
Declares a function that receives two integers and returns a pointer to a bool

2000 Prentice Hall, Inc. All rights reserved.

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32

/* Fig. 7.26: fig07_26.c Multipurpose sorting program using function pointers */ #include <stdio.h> #define SIZE 10 void bubble( int [], const int, int (*)( int, int ) ); int ascending( int, int ); int descending( int, int ); int main() {

Outline

1. Initialize array.

int order, counter, a[ SIZE ] = { 2, 6, 4, 8, 10, 12, 89, 68, 45, 37 }; printf( "Enter 1 to sort in ascending order,\n" "Enter 2 to sort in descending order: " ); scanf( "%d", &order ); printf( "\nData items in original order\n" ); for ( counter = 0; counter < SIZE; counter++ ) printf( "%5d", a[ counter ] ); if ( order == 1 ) { bubble( a, SIZE, ascending ); printf( "\nData items in ascending order\n" ); } else { bubble( a, SIZE, descending ); printf( "\nData items in descending order\n" ); } 2000 Prentice Hall, Inc. All rights reserved.

Notice the function pointer 2. Prompt for parameter. ascending or descending sorting. 2.1 Put appropriate function pointer into bubblesort. 2.2 Call bubble. 3. Print results.

33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64

for ( counter = 0; counter < SIZE; counter++ ) printf( "%5d", a[ counter ] ); printf( "\n" ); return 0; } void bubble( int work[], const int size, int (*compare)( int, int ) ) { int pass, count; void swap( int *, int * ); for ( pass = 1; pass < size; pass++ ) for ( count = 0; count < size - 1; count++ ) if ( (*compare)( work[ count ], work[ count + 1 ] ) ) swap( &work[ count ], &work[ count + 1 ] ); } void swap( int *element1Ptr, int *element2Ptr ) { int temp; temp = *element1Ptr; *element1Ptr = *element2Ptr; *element2Ptr = temp;

Outline

3.1 Define functions. ascending and descending return true or false. bubble calls swap if the function call returns true.

Notice how function pointers are called using the dereferencing operator. The * is not required, but emphasizes that compare is a function pointer and not a function.

2000 Prentice Hall, Inc. All rights reserved.

65 int ascending( int a, int b ) 66 { 67 68 } 69 70 int descending( int a, int b ) 71 { 72 73 } return b > a; /* swap if b is greater than a */ return b < a; /* swap if b is less than a */

Outline

3.1 Define functions.

Enter 1 to sort in ascending order, Enter 2 to sort in descending order: 1 Data items in original order 2 6 4 8 10 12 89 68 Data items in ascending order 2 4 6 8 10 12 37 45

Program Output

45 68

37 89

Enter 1 to sort in ascending order, Enter 2 to sort in descending order: 2 Data items in original order 2 6 4 8 10 12 89 68 Data items in descending order 89 68 45 37 12 10 8 6

45 4

37 2

2000 Prentice Hall, Inc. All rights reserved.