i

EXAMPLE
C+ + By
Greg Perry
By
C++
Contents o
ii
C++ By Example
1992 by Que
All rights reserved. Printed in the United States of America. No part of this
book may be used or reproduced, in any form or by any means, or stored
in a database or retrieval system, without prior written permission of the
publisher except in the case of brief quotations embodied in critical articles
and reviews. Making copies of any part of this book for any purpose other
than your own personal use is a violation of United States copyright laws.
For information, address Que, 11711 N. College Ave., Carmel, IN 46032.
Library of Congress Catalog Card Number: 92-64353
ISBN: 1-56529-038-0
This book is sold as is, without warranty of any kind, either express or
implied, respecting the contents of this book, including but not limited to
implied warranties for the books quality, performance, merchantability,
or fitness for any particular purpose. Neither Que Corporation nor its
dealers or distributors shall be liable to the purchaser or any other person
or entity with respect to any liability, loss, or damage caused or alleged to
be caused directly or indirectly by this book.
96 95 94 93 92 8 7 6 5 4 3 2 1
Interpretation of the printing code: the rightmost double-digit number is
the year of the books printing; the rightmost single-digit number, the
number of the books printing. For example, a printing code of 92-1 shows
that the first printing of the book occurred in 1992.
iii
EXAMPLE
C+ + By
Publisher
Lloyd Short
Publishing Manager
Joseph Wikert
Development Editor
Stacy Hiquet
Production Editor
Kezia Endsley
Copy Editor
Bryan Gambrel
Technical Editor
Tim Moore
Editorial Assistants
Rosemarie Graham
Melissa Keegan
Book Design
Scott Cook
Michele Laseau
Production Analyst
Mary Beth Wakefield
Cover Design
Jean Bisesi
Indexer
Johnna VanHoose
Production
Caroline Roop (Book Shepherd)
Jeff Baker, Paula Carroll,
Michelle Cleary, Brook Farling,
Kate Godfrey, Bob LaRoche,
Laurie Lee, Jay Lesandrini,
Cindy L. Phipps, Linda Seifert,
Phil Worthington
Composed in Palatino and MCPdigital typefaces by Prentice Hall Computer Publishing.
Screen reproductions in this book were created by means of the program Collage Plus
from Inner Media, Inc., Hollis, NH.
Contents o
iv
Dedic ation
Dr. Rick Burgess, you shaped my life. Good or bad, Im what I am
thanks to your help. I appreciate the many hours weve shared together.
G.M.P.
v
EXAMPLE
C+ + By
About the Author
Greg Perry has been a programmer and trainer for the past 14 years.
He received his first degree in computer science, then he received a
Masters degree in corporate finance. He currently is a professor of
computer science at Tulsa Junior College, as well as a computer
consultant and a lecturer. Greg Perry is the author of 11 other
computer books, including QBASIC By Example and C By Example. In
addition, he has published articles in several publications, including
PC World, Data Training, and Inside First Publisher. He has attended
computer conferences and trade shows in several countries, and is
fluent in nine computer languages.
Contents o
vi
vii
EXAMPLE
C+ + By
Ac knowledgments
Much thanks to Stacy Hiquet and Joseph Wikert at Prentice Hall
(Que) for trusting me completely with the direction and style of this
book. The rest of my editors: Kezia Endsley, Bryan Gambrel, and the
Technical Editor, Tim Moore, kept me on track so the readers can
have an accurate and readable text.
The Tulsa Junior College administration continues to be sup-
portive of my writing. More importantly, Diane Moore, head of our
Business Services Division, Tony Hirad, and Elaine Harris, are
friends who make teaching a joy and not a job.
As always, my beautiful bride Jayne, and my parents Glen and
Bettye Perry, are my closest daily companions. It is for them I work.
Trademark Ac knowledgments
Que Corporation has made every attempt to supply trademark
information about company names, products, and services men-
tioned in this book. Trademarks indicated below were derived from
various sources. Que Corporation cannot attest to the accuracy of
this information.
AT&T is a registered trademark of American Telephone &
Telegraph Company.
FORTRAN and COBOL are trademarks of International
Business Machines Corporation (IBM).
Turbo BASIC is a registered trademark of Borland
International, Inc.
Turbo C is a registered trademark of Borland International, Inc.
Microsoft QuickC and MS-DOS are registered trademarks of
Microsoft Corporation.
ANSI is a registered trademark of American National Standards
Institute.
Contents o
viii
ix
EXAMPLE
C+ + By
Overview
I Introduc tion to C++
1 Welcome to C++ ...........................................................................11
2 What Is a Program? ......................................................................35
3 Your First C++ Program.............................................................. 51
4 Variables and Literals ..................................................................69
5 Character Arrays and Strings ..................................................... 99
6 Preprocessor Directives ............................................................. 113
7 Simple Input/Output .................................................................133
II Using C++ Operators
8 Using C++ Math Operators and Precedence .......................... 163
9 Relational Operators ..................................................................185
10 Logical Operators .......................................................................207
11 Additional C++ Operators ........................................................ 221
III C++ Construc ts
12 The while Loop ...........................................................................245
13 The for Loop ................................................................................273
14 Other Loop Options ...................................................................295
15 The switch and goto Statements............................................... 311
16 Writing C++ Functions .............................................................. 331
IV Variable Sc ope and Modular
Programming
17 Variable Scope .............................................................................353
18 Passing Values ............................................................................379
19 Function Return Values and Prototypes ................................. 397
20 Default Arguments and Function Overloading..................... 415
V Charac ter Input /Output and
String Func tions
21 Device and Character Input/Output ....................................... 431
22 Character, String, and Numeric Functions ............................. 449
Contents o
x
VI Arrays and Pointers
23 Introducing Arrays .....................................................................473
24 Array Processing.........................................................................493
25 Multidimensional Arrays .......................................................... 519
26 Pointers ........................................................................................541
27 Pointers and Arrays ...................................................................557
VII Struc tures and File Input/Output
28 Structures .....................................................................................583
29 Arrays of Structures ...................................................................605
30 Sequential Files ...........................................................................625
31 Random-Access Files .................................................................645
32 Introduction to Object-Oriented Programming ..................... 661
VIII Referenc es
A Memory Addressing, Binary, and Hexadecimal Review ..... 679
B Answers to Review Questions .................................................. 701
C ASCII Table..................................................................................719
D C++ Precedence Table................................................................729
E Keyword and Function Reference............................................ 733
F The Mailing List Application.................................................... 737
Glossary .......................................................................................747
Index .............................................................................................761
xi
EXAMPLE
C+ + By
Contents
Introduc tion ................................................... 1
Who Should Use This Book .................................................... 1
The Books Philosophy............................................................ 2
Overview of This Book............................................................ 2
Conventions Used in This Book ................................................. 5
Index to the Icons .....................................................................5
Margin Graphics (Book Diagrams) ....................................... 6
Companion Disk Offer ................................................................8
I Introduc tion to C++
1 Welc ome to C++........................................... 11
What C++ Can Do for You........................................................ 12
The Background of C++ ............................................................ 15
C++ Compared with Other Languages................................... 16
C++ and Microcomputers ......................................................... 17
An Overview of Your Computer ............................................. 19
Hardware ................................................................................19
Software ...................................................................................29
Review Questions .......................................................................33
Summary .....................................................................................34
2 What Is a Program? ..................................... 35
Computer Programs ..................................................................36
Program Design ..........................................................................38
Using a Program Editor ............................................................. 40
Using a C++ Compiler ............................................................... 42
Running a Sample Program...................................................... 44
Handling Errors ..........................................................................46
Review Questions .......................................................................48
Summary .....................................................................................49
Contents o
xii
3 Your First C++ Program ............................... 51
Looking at a C++ Program........................................................ 52
The Format of a C++ Program ............................................. 53
Readability Is the Key............................................................ 54
Uppercase Versus Lowercase............................................... 55
Braces and main() ...................................................................56
Comments in C++ ..................................................................57
Explaining the Sample Program .............................................. 60
Review Questions .......................................................................66
Summary .....................................................................................67
4 Variables and Literals ................................. 69
Variables ......................................................................................70
Naming Variables ..................................................................70
Variable Types ........................................................................72
Declaring Variables................................................................73
Looking at Data Types .......................................................... 75
Assigning Values to Variables ............................................. 80
Literals..........................................................................................82
Assigning Integer Literals..................................................... 83
Assigning String Literals....................................................... 85
Assigning Character Literals ................................................ 89
Constant Variables .....................................................................94
Review Questions .......................................................................95
Review Exercises ........................................................................97
Summary .....................................................................................97
5 Charac ter Arrays and Strings ...................... 99
Character Arrays ......................................................................100
Character Arrays Versus Strings ............................................ 103
Review Questions .....................................................................110
Review Exercises ......................................................................111
Summary ...................................................................................111
6 Preproc essor Direc tives ............................ 113
Understanding Preprocessor Directives ............................... 114
The #include Directive ............................................................ 115
The #define Directive .............................................................. 120
xiii
EXAMPLE
C+ + By
Review Questions .....................................................................128
Review Exercises ......................................................................130
Summary ...................................................................................130
7 Simple Input/Output ................................... 133
The cout Operator ....................................................................134
Printing Strings.....................................................................134
The cin Operator ..................................................................144
printf() and scanf() ...................................................................149
The printf() Function................................................................149
Conversion Characters ............................................................ 151
The scanf() Function.................................................................154
Review Questions .....................................................................157
Review Exercises ......................................................................158
Summary ...................................................................................159
II Using C++ Operators
8 Using C++ Math Operators
and Prec edenc e ......................................... 163
C++s Primary Math Operators.............................................. 164
The Unary Operators ........................................................... 165
Division and Modulus......................................................... 167
The Order of Precedence ......................................................... 168
Using Parentheses ................................................................170
The Assignment Statements ................................................... 174
Multiple Assignments ......................................................... 175
Compound Assignments .................................................... 176
Mixing Data Types in Calculations ....................................... 178
Type Casting .........................................................................179
Review Questions .....................................................................182
Review Exercises ......................................................................183
Summary ...................................................................................184
9 Relational Operators ................................. 185
Defining Relational Operators................................................ 186
The if Statement ........................................................................189
The else Statement ....................................................................199
Contents o
xiv
Review Questions .....................................................................203
Review Exercises ......................................................................204
Summary ...................................................................................205
10 Logic al Operators ...................................... 207
Defining Logical Operators..................................................... 207
Logical Operators and Their Uses ......................................... 209
C++s Logical Efficiency...................................................... 211
Logical Operators and Their Precedence .............................. 216
Review Questions .....................................................................217
Review Exercises ......................................................................218
Summary ...................................................................................219
11 Additional C++ Operators .......................... 221
The Conditional Operator ....................................................... 222
The Increment and Decrement Operators ............................ 225
The sizeof Operator ..................................................................230
The Comma Operator .............................................................. 232
Bitwise Operators .....................................................................234
Bitwise Logical Operators................................................... 235
Review Questions .....................................................................242
Review Exercises ......................................................................243
Summary ...................................................................................243
III C++ Construc ts
12 The while Loop .......................................... 245
The while Statement.................................................................246
The Concept of Loops .............................................................. 247
The do-while Loop ...................................................................252
The if Loop Versus the while Loop........................................ 255
The exit() Function and break Statement .............................. 256
Counters and Totals .................................................................260
Producing Totals ..................................................................265
Review Questions .....................................................................268
Review Exercises ......................................................................269
Summary ...................................................................................270
xv
EXAMPLE
C+ + By
13 The for Loop............................................... 273
The for Statement .....................................................................274
The Concept of for Loops ........................................................ 274
Nested for Loops ......................................................................286
Review Questions .....................................................................292
Review Exercises ......................................................................293
Summary ...................................................................................293
14 Other Loop Options ................................... 295
Timing Loops ............................................................................296
The break and for Statements ................................................. 298
The continue Statement ........................................................... 303
Review Questions .....................................................................308
Review Exercises ......................................................................308
Summary ...................................................................................309
15 The switc h and goto Statements .............. 311
The switch Statement ............................................................... 312
The goto Statement ...................................................................321
Review Questions .....................................................................327
Review Exercises ......................................................................328
Summary ...................................................................................328
16 Writing C++ Func tions ............................... 331
Function Basics .........................................................................332
Breaking Down Problems ....................................................... 333
More Function Basics ............................................................... 335
Calling and Returning Functions ........................................... 337
Review Questions .....................................................................349
Summary ...................................................................................350
IV Variable Sc ope and Modular Programming
17 Variable Sc ope .......................................... 353
Global Versus Local Variables................................................ 354
Defining Variable Scope...................................................... 355
Use Global Variables Sparingly ......................................... 362
The Need for Passing Variables ......................................... 363
Automatic Versus Static Variables......................................... 369
Contents o
xvi
Three Issues of Parameter Passing......................................... 374
Review Questions .....................................................................375
Review Exercises ......................................................................375
Summary ...................................................................................377
18 Passing Values .......................................... 379
Passing by Value (by Copy) .................................................... 379
Passing by Address (by Reference)........................................ 385
Variable Addresses .............................................................. 385
Sample Program...................................................................386
Passing Nonarrays by Address.......................................... 391
Review Questions .....................................................................394
Review Exercises ......................................................................395
Summary ...................................................................................396
19 Func tion Return Values and Prototypes ... 397
Function Return Values ........................................................... 398
Function Prototypes .................................................................405
Prototype for Safety ............................................................. 407
Prototype All Functions ...................................................... 407
Review Questions .....................................................................412
Review Exercises ......................................................................412
Summary ...................................................................................413
20 Default Arguments
and Func tion Overloading ......................... 415
Default Argument Lists ........................................................... 416
Multiple Default Arguments .................................................. 417
Overloaded Functions ............................................................. 420
Review Questions .....................................................................426
Review Exercises ......................................................................426
Summary ...................................................................................427
V Charac ter Input /Output
and String Func tions
21 Devic e and Charac ter Input/Output .......... 431
Stream and Character I/O ...................................................... 432
Standard Devices .................................................................434
Redirecting Devices from MS-DOS ................................... 435
xvii
EXAMPLE
C+ + By
Printing Formatted Output to the Printer............................. 436
Character I/O Functions ......................................................... 437
The get() and put() Functions............................................. 438
The getch() and putch() Functions .................................... 444
Review Questions .....................................................................446
Review Exercises ......................................................................447
Summary ...................................................................................448
22 Charac ter, String,
and Numeric Func tions ............................. 449
Character Functions .................................................................450
Character Testing Functions............................................... 450
Alphabetic and Digital Testing .......................................... 450
Special Character-Testing Functions ................................. 453
Character Conversion Functions ....................................... 453
String Functions ........................................................................455
Useful String Functions ....................................................... 456
String I/O Functions ........................................................... 456
Converting Strings to Numbers ......................................... 460
Numeric Functions ...................................................................461
Useful Mathematical Functions ......................................... 461
Trigonometric Functions..................................................... 464
Logarithmic Functions ........................................................ 465
Random-Number Processing ............................................. 465
Review Questions .....................................................................467
Review Exercises ......................................................................468
Summary ...................................................................................469
VI Arrays and Pointers
23 Introduc ing Arrays ..................................... 473
Array Basics...............................................................................474
Initializing Arrays ....................................................................479
Initializing Elements at Declaration Time ........................ 479
Initializing Elements in the Program ................................ 486
Review Questions .....................................................................491
Review Exercises ......................................................................491
Summary ...................................................................................492
Contents o
xviii
24 Array Proc essing ....................................... 493
Searching Arrays ......................................................................494
Searching for Values ................................................................496
Sorting Arrays ...........................................................................501
Advanced Referencing of Arrays........................................... 508
Review Questions .....................................................................515
Review Exercises ......................................................................516
Summary ...................................................................................517
25 Multidimensional Arrays ............................ 519
Multidimensional Array Basics .............................................. 520
Reserving Multidimensional Arrays ..................................... 522
Mapping Arrays to Memory................................................... 524
Defining Multidimensional Arrays ....................................... 526
Tables and for Loops ................................................................530
Review Questions .....................................................................537
Review Exercises ......................................................................538
Summary ...................................................................................538
26 Pointers ...................................................... 541
Introduction to Pointer Variables .......................................... 542
Declaring Pointers ................................................................543
Assigning Values to Pointers ............................................. 545
Pointers and Parameters ..................................................... 546
Arrays of Pointers.....................................................................551
Review Questions .....................................................................553
Summary ...................................................................................555
27 Pointers and Arrays ................................... 557
Array Names as Pointers......................................................... 558
Pointer Advantages ..................................................................560
Using Character Pointers ........................................................ 563
Pointer Arithmetic ....................................................................568
Arrays of Strings .......................................................................574
Review Questions .....................................................................578
Review Exercises ......................................................................579
Summary ...................................................................................580
xix
EXAMPLE
C+ + By
VII Struc tures and File Input/Output
28 Struc tures .................................................. 583
Introduction to Structures ....................................................... 584
Defining Structures ..................................................................587
Initializing Structure Data....................................................... 591
Nested Structures .....................................................................600
Review Questions .....................................................................603
Review Exercises ......................................................................604
Summary ...................................................................................604
29 Arrays of Struc tures .................................. 605
Declaring Arrays of Structures ............................................... 606
Arrays as Members ..................................................................615
Review Questions .....................................................................623
Review Exercises ......................................................................624
Summary ...................................................................................624
30 Sequential Files ......................................... 625
Why Use a Disk?.......................................................................626
Types of Disk File Access ........................................................ 627
Sequential File Concepts ......................................................... 628
Opening and Closing Files ...................................................... 629
Writing to a File ........................................................................635
Writing to a Printer ..................................................................637
Adding to a File ........................................................................638
Reading from a File ..................................................................639
Review Questions .....................................................................642
Review Exercises ......................................................................643
Summary ...................................................................................644
31 Random-Ac c ess Files ................................ 645
Random File Records ............................................................... 646
Opening Random-Access Files............................................... 647
The seekg() Function................................................................649
Other Helpful I/O Functions.................................................. 656
Review Questions .....................................................................658
Review Exercises ......................................................................658
Summary ...................................................................................659
Contents o
xx
32 Introduc tion to Objec t-Oriented
Programming ............................................. 661
What Is a Class? ........................................................................662
Data Members ......................................................................662
Member Functions ............................................................... 662
Default Member Arguments................................................... 670
Class Member Visibility .......................................................... 674
Review Questions .....................................................................676
Review Exercise ........................................................................676
Summary ...................................................................................676
VIII Referenc es
A Memory Addressing, Binary,
and Hexadec imal Review .......................... 679
Computer Memory ..................................................................680
Memory and Disk Measurements ..................................... 680
Memory Addresses .............................................................. 681
Bits and Bytes ............................................................................682
The Order of Bits ......................................................................686
Binary Numbers .......................................................................686
Binary Arithmetic .....................................................................690
Binary Negative Numbers ...................................................... 692
Hexadecimal Numbers ............................................................ 695
Why Learn Hexadecimal? ....................................................... 697
How Binary and Addressing Relate to C++......................... 698
B Answers to Review Questions .................. 701
C ASCII Table ................................................ 719
D C++ Prec edenc e Table .............................. 729
E Keyword and Func tion Referenc e ............ 733
stdio.h ....................................................................................734
ctype.h....................................................................................734
string.h ...................................................................................735
math.h ....................................................................................735
stdlib.h ...................................................................................735
xxi
EXAMPLE
C+ + By
F The Mailing List Applic ation ..................... 737
Glossary ..................................................... 747
Index .......................................................... 761
Contents o
xxii
1
EXAMPLE
C+ + By
Introduc tion
Every day, more and more people learn and use the C++ program-
ming language. I have taught C to thousands of students in my life.
I see many of those students now moving to C++ in their school work
or career. The C++ language is becoming an industry-accepted
standard programming language, using the solid foundation of C to
gain a foothold. C++ is simply a better C than C.
C++ By Example is one of several books in Ques new line of By
Example series. The philosophy of these books is simple: The best
way to teach computer programming concepts is with multiple
examples. Command descriptions, format syntax, and language
references are not enough to teach a newcomer a programming
language. Only by looking at numerous examples and by running
sample programs can programming students get more than just a
feel for the language.
Who Should Use This Book
This book teaches at three levels: beginning, intermediate, and
advanced. Text and numerous examples are aimed at each level. If
you are new to C++, and even if you are new to computers, this book
attempts to put you at ease and gradually build your C++ program-
ming skills. If you are an expert at C++, this book provides a few
extras for you along the way.
Introduction o
2
The Books Philosophy
This book focuses on programming correctly in C++ by teaching
structured programming techniques and proper program design.
Emphasis is always placed on a programs readability rather than
tricks of the trade code examples. In this changing world, pro-
grams should be clear, properly structured, and well-documented,
and this book does not waver from the importance of this philos-
ophy.
This book teaches you C++ using a holistic approach. In addi-
tion to learning the mechanics of the language, you learn tips and
warnings, how to use C++ for different types of applications, and a
little of the history and interesting asides about the computing
industry.
Many other books build single applications, adding to them a
little at a time with each chapter. The chapters of this book are stand-
alone chapters, and show you complete programs that fully demon-
strate the commands discussed in the chapter. There is a program for
every level of reader, from beginning to advanced.
This book contains almost 200 sample program listings. These
programs show ways that you can use C++ for personal finance,
school and business record keeping, math and science, and general-
purpose applications that almost everybody with a computer can
use. This wide variety of programs show you that C++ is a very
powerful language that is easy to learn and use.
Appendix F, The Mailing List Application, is a complete
applicationmuch longer than any of the other programs in the
bookthat brings together your entire working knowledge of C++.
The application is a computerized mailing-list manager. Through-
out the chapters that come before the program, you learn how each
command in the program works. You can modify the program to
better suit your own needs. (The comments in the program suggest
changes you can make.)
Overview of This Book
This book is divided into eight parts. Part I introduces you to
the C++ environment, as well as introductory programming con-
cepts. Starting with Part II, the book presents the C++ programming
3
EXAMPLE
C+ + By
language commands and built-in functions. After mastering the
language, you can use the book as a handy reference. When you
need help with a specific C++ programming problem, turn to the
appropriate area that describes that part of the language to see
numerous examples of code.
To get an idea of the books layout, read the following descrip-
tion of each section of the book:
Part I: Introduc tion to C++
This section explains what C++ is by describing a brief history
of the C++ programming language and presenting an overview of
C++s advantages over other languages. This part describes your
computers hardware, how you develop your C++ programs, and
the steps you follow to enter and run programs. You begin to write
C++ programs in Chapter 3.
Part II: Using C++ Operators
This section teaches the entire set of C++ operators. The rich
assortment of operators (more than any other programming lan-
guage except APL) makes up for the fact that the C++ programming
language is very small. The operators and their order of precedence
are more important to C++ than most programming languages.
Part III: C++ Construc ts
C++ data processing is most powerful due to the looping,
comparison, and selection constructs that C++ offers. This part
shows you how to write programs flowing with control computa-
tions that produce accurate and readable code.
Part IV: Variable Sc ope and
Modular Programming
To support true structured programming techniques, C++
must allow for local and global variables, as well as offer several
Introduction o
4
ways to pass and return variables between functions. C++ is a very
strong structured language that attempts, if the programmer is
willing to listen to the language, to protect local variables by
making them visible only to the parts of the program that need them.
Part V: Charac ter Input/Output and
String Func tions
C++ contains no commands that perform input or output. To
make up for this apparent oversight, C++ compiler writers supply
several useful input and output functions. By separating input and
output functions from the language, C++ achieves better portability
between computers; if your program runs on one computer, it will
work on any other.
This part also describes several of the other built-in math,
character, and string functions available with C++. These functions
keep you from having to write your own routines to perform
common tasks.
Part VI: Arrays and Pointers
C++ offers single and multidimensional arrays that hold mul-
tiple occurrences of repeating data, but that do not require much
effort on your part to process.
Unlike many other programming languages, C++ also uses
pointer variables a great deal. Pointer variables and arrays work
together to give you flexible data storage that allow for easy sorting
and searching of data.
Part VII: Struc tures and File
Input/Output
Variables, arrays, and pointers are not enough to hold the types
of data that your programs require. Structures allow for more
powerful grouping of many different kinds of data into manageable
units.
Your computer would be too limiting if you could not store
data to the disk and retrieve that data back in your programs. Disk
5
EXAMPLE
C+ + By
files are required by most real world applications. This section
describes how C++ processes sequential and random-access files
and teaches the fundamental principles needed to effectively save
data to the disk. The last chapter in this section introduces object-
oriented programming and its use of classes.
Part VIII: Referenc es
This final section of the book includes a reference guide to the
ASCII table, the C++ precedence table, and to keywords and func-
tions in C++. Also in this section are the mailing list application and
the answers to the review questions.
Conventions Used in This
Book
The following typographic conventions are used in this book:
o Code lines, variables, and any text you see on-screen are in
monospace.
o Placeholders on format lines are in i t al i c monospace.
o Filenames are in regular text, all uppercase (CCDOUB.CPP).
o Optional parameters on format lines are enclosed in flat
brackets ([ ] ). You do not type the brackets when you
include these parameters.
o New terms, which are also found in the glossary, are in italic.
Index to the Ic ons
The following icons appear throughout this book:
Level 1 difficulty
Introduction o
6
Level 2 difficulty
Level 3 difficulty
Tip
Note
Caution
Pseudocode
The pseudocode icon appears beside pseudocode, which is
typeset in italic immediately before the program. The pseudocode
consists of one or more sentences indicating what the program
instructions are doing, in English. Pseudocode appears before se-
lected programs.
Margin Graphic s (Book Diagrams)
To help your understanding of C++ further, this book includes
numerous margin graphics. These margin graphics are similar to
flowcharts you have seen before. Both use standard symbols to
represent program logic. If you have heard of the adage A picture
is worth a thousand words, you will understand why it is easier to
look at the margin graphics and grasp the overall logic before
dissecting programs line-by-line.
7
EXAMPLE
C+ + By
Throughout this book, these margin graphics are used in two
places. Some graphics appear when a new command is introduced,
to explain how the command operates. Others appear when new
commands appear in sample programs for the first time.
The margin graphics do not provide complete, detailed expla-
nations of every statement in each program. They are simple instruc-
tions and provide an overview of the new statements in question.
The symbols used in the margin graphics, along with descriptions
of them, follow:
Terminal symbol
( {, }, Ret ur n. . . )
Assignment staement (t ot al =
t ot al + newval ue; ct r = ct r =
1; . . . )
Input/output
( scanf , pr i nt f . . . )
Calling a function
Small circle; loop begin
Large dot; begining and end
of I F- THEN, I F- THEN- ELSE,
and Swi t ch
Input/output of arrays;
assumes implied FOR loop(s)
needed to deal with array I/O
Comment bracket; used for
added info, such as name of a
function
Introduction o
8
The margin graphics, the program listings, the program com-
ments, and the program descriptions in the book provide many
vehicles for learning the C++ language!
Companion Disk Offer
If youd like to save yourself hours of tedious typing, use the
order form in the back of this book to order the companion disk for
C++ By Example. This disk contains the source code for all complete
programs and sample code in this book, as well as the mailing-list
application that appears in Appendix F. Additionally, the answers
to many of the review exercises are included on the disk.
Part I
Introduction to C++
11
EXAMPLE
C+ + By
1
Welc ome to C++
C++ is a recent addition to the long list of programming languages
now available. Experts predict that C++ will become one of the most
widely used programming languages within two to three years.
Scan your local computer bookstores shelves and you will see that
C++ is taking the programming world by storm. More and more
companies are offering C++ compilers. In the world of PCs, both
Borland and Microsoft, two of the leading names of PC software,
offer full-featured C++ compilers.
Although the C++ language is fairly new, having become
popular within the last three years, the designers of C++ compilers
are perfecting this efficient, standardized language that should soon
be compatible with almost every computer in the world. Whether
you are a beginning, an intermediate, or an expert programmer, C++
has the programming tools you need to make your computer do just
what you want it to do. This chapter introduces you to C++, briefly
describes its history, compares C++ to its predecessor C, shows you
the advantages of C++, and concludes by introducing you to hard-
ware and software concepts.
Chapter 1 o W elcom e to C ++
12
What C++ Can Do for You
Imagine a language that makes your computer perform to your
personal specifications! Maybe you have looked for a program that
keeps track of your household budgetexactly as you preferbut
havent found one. Perhaps you want to track the records of a small
(or large) business with your computer, but you havent found a
program that prints reports exactly as youd like them. Possibly you
have thought of a new and innovative use for a computer and you
would like to implement your idea. C++ gives you the power to
develop all these uses for your computer.
If your computer could understand English, you would not
have to learn a programming language. But because it does not
understand English, you must learn to write instructions in a
language your computer recognizes. C++ is a powerful program-
ming language. Several companies have written different versions
of C++, but almost all C++ languages available today conform to the
AT&T standard. AT&T-compatible means the C++ language in ques-
tion conforms to the standard defined by the company that invented
the language, namely, American Telephone & Telegraph, Incorpo-
rated. AT&T realizes that C++ is still new and has not fully matured.
The good people there just completed the AT&T C++ 3.0 standard
to which software companies can conform. By developing a uniform
C++ language, AT&T helps ensure that programs you write today
will most likely be compatible with the C++ compilers of tomorrow.
NOTE: The AT&T C++ standard is only a suggestion. Software
companies do not have to follow the AT&T standard, although
most choose to do so. No typical computer standards commit-
tee has yet adopted a C++ standard language. The committees
are currently working on the issue, but they are probably
waiting for C++ to entrench the programming community
before settling on a standard.
Companies do not have to follow the AT&T C++ 3.0 standard.
Many do, but add their own extensions and create their own version
to do more work than the AT&T standard includes. If you are using
the AT&T C++ standard, your program should successfully run on
any other computer that also uses AT&T C++.
C++ i s currentl y
defi ned by Ameri can
Tel ephone &
Tel egraph,
Incorporated, to
achi eve conformi ty
between versi ons
of C++.
C++ i s cal l ed a
better C than C.
13
EXAMPLE
C+ + By
AT&T developed C++ as an improved version of the C pro-
gramming language. C has been around since the 1970s and has
matured into a solid, extremely popular programming language.
ANSI, the American National Standards Institute, established a
standard C programming specification called ANSI C. If your C
compiler conforms to ANSI C, your program will work on any other
computer that also has ANSI C. This compatibility between comput-
ers is so important that AT&Ts C++ 3.0 standard includes almost
every element of the ANSI C, plus more. In fact, the ANSI C
committee often requires that a C++ feature be included in subse-
quent versions of C. For instance, function prototypes, a feature not
found in older versions of ANSI C, is now a requirement for
approval by the ANSI committee. Function prototypes did not exist
until AT&T required them in their early C++ specification.
C++ By Example teaches you to program in C++. All programs
conform to the AT&T C++ 2.1 standard. The differences between
AT&T 2.1 and 3.0 are relatively minor for beginning programmers.
As you progress in your programming skills, you will want to tackle
the more advanced aspects of C++ and Version 3.0 will come more
into play later. Whether you use a PC, a minicomputer, a mainframe,
or a supercomputer, the C++ language you learn here should work
on any that conform to AT&T C++ 2.1 and later.
There is a debate in the programming community as to whether
a person should learn C before C++ or learn only C++. Because C++
is termed a better C, many feel that C++ is an important language
in its own right and can be learned just as easily as C. Actually, C++
pundits state that C++ teaches better programming habits than the
plain, vanilla C. This book is aimed at the beginner programmer,
and the author feels that C++ is a great language with which to
begin. If you were to first learn C, you would have to unlearn a few
things when you moved to C++. This book attempts to use the C++
language elements that are better than C. If you are new to program-
ming, you learn C++ from the start. If you have a C background, you
learn that C++ overcomes many of Cs limitations.
When some people attempt to learn C++ (and C), even if they
are programmers in other computer languages, they find that
C++ can be cryptic and difficult to understand. This does not have
to be the case. When taught to write clear and concise C++ code in
an order that builds on fundamental programming concepts,
Chapter 1 o W elcom e to C ++
14
programmers find that C++ is no more difficult to learn or use than
any other programming language. Actually, after you start using it,
C++s modularity makes it even easier to use than most other
languages. Once you master the programming elements this book
teaches you, you will be ready for the advanced power for which
C++ was designedobject-oriented programming (OOP). The last
chapter of this book, Introduction to Object-Oriented Program-
ming, offers you the springboard to move to this exciting way of
writing programs.
Even if youve never programmed a computer before, you will
soon understand that programming in C++ is rewarding. Becoming
an expert programmer in C++or in any other computer lan-
guagetakes time and dedication. Nevertheless, you can start
writing simple programs with little effort. After you learn the
fundamentals of C++ programming, you can build on what you
learn and hone your skills as you write more powerful programs.
You also might see new uses for your computer and develop
programs others can use.
The importance of C++ cannot be overemphasized. Over the
years, several programming languages were designed to be the
only programming language you would ever need. PL/I was
heralded as such in the early 1960s. It turned out to be so large and
took so many system resources that it simply became another
language programmers used, along with COBOL, FORTRAN, and
many others. In the mid-1970s, Pascal was developed for smaller
computers. Microcomputers had just been invented, and the Pascal
language was small enough to fit in their limited memory space
while still offering advantages over many other languages. Pascal
became popular and is still used often today, but it never became the
answer for all programming tasks, and it failed at being the only
programming language you would ever need.
When the mass computer markets became familiar with C in
the late 1970s, C also was promoted as the only programming
language you would ever need. What has surprised so many
skeptics (including this author) is that C has practically fulfilled this
promise! An incredible number of programming shops have con-
verted to C. The appeal of Cs efficiency, combined with its portabil-
ity among computers, makes it the language of choice. Most of
15
EXAMPLE
C+ + By
The UNIX operati ng
system was wri tten
al most enti rel y i n C.
todays familiar spreadsheets, databases, and word processors are
written in C. Now that C++ has improved on C, programmers are
retooling their minds to think in C++ as well.
The programmer help-wanted ads seek more and more C++
programmers every day. By learning this popular language, you
will be learning the latest direction of programming and keeping
your skills current with the market. You have taken the first step:
with this book, you learn the C++ language particulars as well as
many programming tips to use and pitfalls to avoid. This book
attempts to teach you to be not just a C++ programmer, but a better
programmer by applying the structured, long-term programming
habits that professionals require in todays business and industry.
The Bac kground of C++
Before you jump into C++, you might find it helpful to know a
little about the evolution of the C++ programming language. C++ is
so deeply rooted in C that you should first see where C began. Bell
Labs first developed the C programming language in the early
1970s, primarily so Bell programmers could write their UNIX oper-
ating system for a new DEC (Digital Equipment Corporation) com-
puter. Until that time, operating systems were written in assembly
language, which is tedious, time-consuming, and difficult to main-
tain. The Bell Labs people knew they needed a higher-level pro-
gramming language to implement their project quicker and create
code that was easier to maintain.
Because other high-level languages at the time (COBOL, FOR-
TRAN, PL/I, and Algol) were too slow for an operating systems
code, the Bell Labs programmers decided to write their own lan-
guage. They based their new language on Algol and BCPL. Algol is
still used in the European markets, but is not used much in America.
BCPL strongly influenced C, although it did not offer the various
data types that the makers of C required. After a few versions, these
Bell programmers developed a language that met their goals well. C
is efficient (it is sometimes called a high, low-level language due to
its speed of execution), flexible, and contains the proper language
elements that enable it to be maintained over time.
Chapter 1 o W elcom e to C ++
16
In the 1980s, Bjourn Stroustrup, working for AT&T, took the C
language to its next progression. Mr. Stroustrup added features to
compensate for some of the pitfalls C allowed and changed the way
programmers view programs by adding object-orientation to the
language. The object-orientation aspect of programming started in
other languages, such as Smalltalk. Mr. Stroustrup realized that C++
programmers needed the flexibility and modularity offered by a
true OOP programming language.
C++ Compared with Other
Languages
If you have programmed before, you should understand a little
about how C++ differs from other programming languages on the
market. C++ is efficient and has much stronger typing than its C
predecessor. C is known as a weakly typed language; variable data
types do not necessarily have to hold the same type of data. (Func-
tion prototyping and type casting help to alleviate this problem.)
For example, if you declare an integer variable and decide to
put a character value in it, C enables you to do so. The data might not
be in the format you expect, but C does its best. This is much different
from stronger-typed languages such as COBOL and Pascal.
If this discussion seems a little over your head at this point,
relax. The upcoming chapters will elaborate on these topics and
provide many examples.
C++ is a small, block-structured programming language. It has
fewer than 46 keywords. To compensate for its small vocabulary,
C++ has one of the largest assortment of operators such as +, - , and &&
(second only to APL). The large number of operators in C++ might
tempt programmers to write cryptic programs that have only a
small amount of code. As you learn throughout this book, however,
you will find that making the program more readable is more
important than saving some bytes. This book teaches you how to
use the C++ operators to their fullest extent, while maintaining
readable programs.
C++s large number of operators (almost equal to the number
of keywords) requires a more judicious use of an operator precedence
C++ requi res more
stri ngent data- type
checki ng than
does C.
17
EXAMPLE
C+ + By
table. Appendix D, C++ Precedence Table, includes the C++
operator precedence table. Unlike most other languages that have
only four or five levels of precedence, C++ has 15. As you learn C++,
you have to master each of these 15 levels. This is not as difficult as
it sounds, but its importance cannot be overstated.
C++ also has no input or output statements. You might want to
read that sentence again! C++ has no commands that perform input
or output. This is one of the most important reasons why C++ is
available on so many different computers. The I/O (input/output)
statements of most languages tie those languages to specific hard-
ware. BASIC, for instance, has almost twenty I/O commands
some of which write to the screen, to the printer, to a modem, and so
forth. If you write a BASIC program for a microcomputer, chances
are good that it cannot run on a mainframe without considerable
modification.
C++s input and output are performed through the abundant
use of operators and function calls. With every C++ compiler comes
a library of standard I/O functions. I/O functions are hardware
independent, because they work on any device and on any computer
that conform to the AT&T C++ standard.
To master C++ completely, you have to be more aware of your
computers hardware than most other languages would require you
to be. You certainly do not have to be a hardware expert, but
understanding the internal data representation makes C++ much
more usable and meaningful.
It also helps if you can become familiar with binary and
hexadecimal numbers. You might want to read Appendix A,
Memory Addressing, Binary, and Hexadecimal Review, for a
tutorial on these topics before you start to learn the C++ language.
If you do not want to learn these topics, you can still become a good
C++ programmer, but knowing what goes on under the hood
makes C++ more meaningful to you as you learn it.
C++ and Mic roc omputers
C was a relatively unknown language until it was placed on the
microcomputer. With the invention and growth of the microcom-
puter, C blossomed into a worldwide computer language. C++
Chapter 1 o W elcom e to C ++
18
extends that use on smaller computers. Most of readers of C++ By
Example are probably working on a microcomputer-based C++
system. If you are new to computers, this section will help you learn
how microcomputers were developed.
In the 1970s, NASA created the microchip, a tiny wafer of sili-
con that occupies a space smaller than a postage stamp. Computer
components were placed on these microchips, hence computers
required much less space than before. NASA produced these
smaller computers in response to their need to send rocket ships to
the moon with on-board computers. The computers on Earth could
not provide split-second accuracy for rockets because radio waves
took several seconds to travel between the Earth and the moon.
Through development, these microchips became small enough so
the computers could travel with a rocket and safely compute the
rockets trajectory.
The space program was not the only beneficiary of computer
miniaturization. Because microchips became the heart of the mi-
crocomputer, computers could now fit on desktops. These micro-
computers cost much less than their larger counterparts, so many
people started buying them. Thus, the home and small-business
computer market was born.
Today, microcomputers are typically called PCs from the wide-
spread use of the original IBM PC. The early PCs did not have the
memory capacity of the large computers used by government and
big business. Nevertheless, PC owners still needed a way to pro-
gram these machines. BASIC was the first programming language
used on PCs. Over the years, many other languages were ported
from larger computers to the PC. However, no language was as
successful as C in becoming the worldwide standard programming
language. C++ seems to be the next standard.
Before diving into C++, you might take a few moments to
familiarize yourself with some of the hardware and software com-
ponents of your PC. The next section, An Overview of Your
Computer, introduces you to computer components that C++
interacts with, such as the operating system, memory, disks, and
I/O devices. If you are already familiar with your computers
hardware and software, you might want to skip to Chapter 2, What
Is a Program?, and begin using C++.
19
EXAMPLE
C+ + By
An Overview of Your
Computer
Your computer system consists of two parts: hardware and
software. The hardware consists of all the physical parts of the
machine. Hardware has been defined as anything you can kick.
Although this definition is coarse, it illustrates that your computers
hardware consists of the physical components of your PC. The
software is everything else. Software comprises the programs and
data that interact with your hardware. The C++ language is an
example of software. You can use C++ to create even more software
programs and data.
Hardware
Figure 1.1 shows you a typical PC system. Before using C++,
you should have a general understanding of what hardware is and
how your hardware components work together.
System Unit
Keyboard
Mouse
Printer
Modem
Monitor
Figure 1.1. A typical PC system.
Disk Drives
Chapter 1 o W elcom e to C ++
20
The System Unit and Memory
The system unit is the large, box-shaped component of the
computer. This unit houses the PCs microprocessor. You might
hear the microprocessor called the CPU, or central processing unit.
The CPU acts like a traffic cop, directing the flow of information
throughout your computer system. The CPU is analogous also to the
human brain. When you use a computer, you are actually interact-
ing with its CPU. All the other hardware exists so the CPU can send
information to you (through the monitor or the printer), and you can
give instructions to the CPU (through the keyboard or the mouse).
The CPU also houses the computers internal memory. Al-
though the memory has several names, it is commonly referred to as
RAM (random-access memory). RAM is where the CPU looks for
software and data. When you run a C++ program, for example, you
are instructing your computers CPU to look in RAM for that
program and carry out its instructions. C++ uses RAM space when
it is loaded.
RAM is used for many things and is one of the most important
components of your computers hardware. Without RAM, your
computer would have no place for its instructions and data. The
amount of RAM can also affect the computers speed. In general, the
more RAM your computer has, the more work it can do and the
faster it can process data.
The amount of RAM is measured by the number of characters
it can hold. PCs generally hold approximately 640,000 characters of
RAM. A character in computer terminology is called a byte, and a
byte can be a letter, a number, or a special character such as an
exclamation point or a question mark. If your computer has 640,000
bytes of RAM, it can hold a total of 640,000 characters.
All the zeros following RAM measurements can become cum-
bersome. You often see the shortcut notation K (which comes from
the metric systems kilo, meaning 1000) in place of the last three
zeros. In computer terms, K means exactly 1024 bytes; but this
number is usually rounded to 1000 to make it easier to remember.
Therefore, 640K represents approximately 640,000 bytes of RAM.
For more information, see the sidebar titled The Power of Two.
The limitations of RAM are similar to the limitations of audio
cassette tapes. If a cassette is manufactured to hold 60 minutes of
A byte i s a si ngl e
character of memory.
21
EXAMPLE
C+ + By
music, it cannot hold 75 minutes of music. Likewise, the total
number of characters that compose your program, the C++ data, and
your computers system programs cannot exceed the RAMs limit
(unless you save some of the characters to disk).
You want as much RAM as possible to hold C++, data, and the
system programs. Generally, 640K is ample room for anything you
might want to do in C++. Computer RAM is relatively inexpensive,
so if your computer has less than 640K bytes of memory, you should
consider purchasing additional memory to increase the total RAM
to 640K. You can put more than 640K in most PCs. There are two
types of additional RAM: extended memory and expanded memory
(they both offer memory capacity greater than 640K). You can access
this extra RAM with some C++ systems, but most beginning C++
programmers have no need to worry about RAM beyond 640K.
The Power of Two
Although K means approximately 1000 bytes of memory, K
equates to 1024. Computers function using on and off states of
electricity. These are called binary states. At the computers
lowest level, it does nothing more than turn electricity on and
off with many millions of switches called transistors. Because
these switches have two possibilities, the total number of states
of these switchesand thus the total number of states of
electricityequals a number that is a power of 2.
The closest power of 2 to 1000 is 1024 (2 to the 10th power). The
inventors of computers designed memory so that it is always
added in kilobytes, or multiples of 1024 bytes at a time. There-
fore, if you add 128K of RAM to a computer, you are actually
adding a total of 131,072 bytes of RAM (128 times 1024 equals
131,072).
Because K actually means more than 1000, you always have a
little more memory than you bargained for! Even though your
computer might be rated at 640K, it actually holds more than
640,000 bytes (655,360 to be exact). See Appendix A, Memory
Addressing, Binary, and Hexadecimal Review, for a more
detailed discussion of memory.
Chapter 1 o W elcom e to C ++
22
The computer stores C++ programs to RAM as you write them.
If you have used a word processor before, you have used RAM. As
you type words in your word-processed documents, your words
appear on the video screen and also go to RAM for storage.
Despite its importance, RAM is only one type of memory in
your computer. RAM is volatile; when you turn the computer off, all
RAM is erased. Therefore, you must store the contents of RAM to a
nonvolatile, more permanent memory device (such as a disk) before
you turn off your computer. Otherwise, you lose your work.
Disk Storage
A disk is another type of computer memory, sometimes called
external memory. Disk storage is nonvolatile. When you turn off your
computer, the disks contents do not go away. This is important.
After typing a long C++ program in RAM, you do not want to retype
the same program every time you turn your computer back on.
Therefore, after creating a C++ program, you save the program to
disk, where it remains until youre ready to retrieve it again.
Disk storage differs from RAM in ways other than volatility.
Disk storage cannot be processed by the CPU. If you have a program
or data on disk that you want to use, you must transfer it from the
disk to RAM. This is the only way the CPU can work with the
program or data. Luckily, most disks hold many times more data
than the RAMs 640K. Therefore, if you fill up RAM, you can store
its contents on disk and continue working. As RAM continues to fill
up, you or your C++ program can keep storing the contents of RAM
to the disk.
This process might sound complicated, but you have only to
understand that data must be transferred to RAM before your
computer can process it, and saved to disk before you shut your
computer off. Most the time, a C++ program runs in RAM and
retrieves data from the disk as it needs it. In Chapter 30, Sequential
Files, you learn that working with disk files is not difficult.
There are two types of disks: hard disks and floppy disks. Hard
disks (sometimes called fixed disks) hold much more data and are
many times faster to work with than floppy disks. Most of your C++
programs and data should be stored on your hard disk. Floppy disks
23
EXAMPLE
C+ + By
are good for backing up hard disks, and for transferring data and
programs from one computer to another. (These removable floppy
disks are often called diskettes.) Figure 1.2 shows two common sizes,
the 5 1/4-inch disk and the 3 1/2-inch disk. These disks can hold
from 360K to 1.4 million bytes of data.
Write-protect notch
Write-protect notch
Figure 1.2. 5 1/4-inch disk and 3 1/2-inch disk.
Before using a new box of disks, you have to format them
(unless you buy disks that are already formatted). Formatting
prepares the disks for use on your computer by writing a pattern of
paths, called tracks, where your data and programs are stored. Refer
to the operating system instruction manual for the correct format-
ting procedure.
Disk drives house the disks in your computer. Usually, the disk
drives are stored in your system unit. The hard disk is sealed inside
the hard disk drive, and you never remove it (except for repairs). In
general, the floppy disk drives also are contained in the system unit,
but you insert and remove these disks manually.
Disk drives have names. The computers first floppy disk drive
is called drive A. The second floppy disk drive, if you have one, is
called drive B. The first hard disk (many computers have only one)
is called drive C. If you have more than one hard disk, or if your hard
disk is logically divided into more than one, the others are named
drive D, drive E, and so on.
Label
Insert this side into drive
Insert this side into drive
Label
Chapter 1 o W elcom e to C ++
24
Disk size is measured in bytes, just as RAM is. Disks can hold
many millions of bytes of data. A 60-million-byte hard disk is
common. In computer terminology, a million bytes is called a
megabyte, or M. Therefore, if you have a 60-megabyte hard disk, it
can hold approximately 60 million characters of data before it runs
out of space.
The Monitor
The television-like screen is called the monitor. Sometimes the
monitor is called the CRT (which stands for the primary component
of the monitor, the cathode-ray tube). The monitor is one place where
the output of the computer can be sent. When you want to look at a
list of names and addresses, you could write a C++ program to list
the information on the monitor.
The advantage of screen output over printing is that screen
output is faster and does not waste paper. Screen output, however,
is not permanent. When text is scrolled off-screen (displaced by
additional text coming on-screen), it is gone and you might not
always be able to see it again.
All monitors have a cursor, which is a character such as a
blinking underline or a rectangle. The cursor moves when you type
letters on-screen, and always indicates the location of the next
character to be typed.
Monitors that can display pictures are called graphics monitors.
Most PC monitors are capable of displaying graphics and text, but
some can display only text. If your monitor cannot display colors, it
is called a monochrome monitor.
Your monitor plugs into a display adapter located in your system
unit. The display adapter determines the amount of resolution and
number of possible on-screen colors. Resolution refers to the number
of row and column intersections. The higher the resolution, the more
rows and columns are present on your screen and the sharper your
text and graphics appear. Some common display adapters are
MCGA, CGA, EGA, and VGA.
25
EXAMPLE
C+ + By
The Printer
The printer provides a more permanent way of recording your
computers results. It is the typewriter of the computer. Your
printer can print C++ program output to paper. Generally, you can
print anything that appears on your screen. You can use your printer
to print checks and envelopes too, because most types of paper work
with computer printers.
The two most common PC printers are the dot-matrix printer
and the laser printer. A dot-matrix printer is inexpensive, fast, and
uses a series of small dots to represent printed text and graphics. A
laser printer is faster than a dot-matrix, and its output is much
sharper because a laser beam burns toner ink into the paper. For
many people, a dot-matrix printer provides all the speed and quality
they need for most applications. C++ can send output to either type
of printer.
The Keyboard
Figure 1.3 shows a typical PC keyboard. Most the keys are the
same as those on a standard typewriter. The letter and number keys
in the center of the keyboard produce their indicated characters on-
screen. If you want to type an uppercase letter, be sure to press one
of the Shift keys before typing the letter. Pressing the CapsLock key
shifts the keyboard to an uppercase mode. If you want to type one
of the special characters above a number, however, you must do so
with the Shift key. For instance, to type the percent sign (%), you
would press Shift-5.
Like the Shift keys, the Alt and Ctrl keys can be used with some
other keys. Some C++ programs require that you press Alt or Ctrl
before pressing another key. For instance, if your C++ program
prompts you to press Alt-F, you should press the Alt key, then press
F while still holding down Alt, then release both keys. Do not hold
them both down for long, however, or the computer keeps repeating
your keystrokes as if you typed them more than once.
The key marked Esc is called the escape key. In many C++
programs, you can press Esc to escape, or exit from, something
you started and then wanted to stop. For example, if you prompt
your C++ compiler for help and you no longer need the help
Chapter 1 o W elcom e to C ++
26
message, you can press Esc to remove the help message from the
screen.
Spacebar
Shift Alt
Function keys
Shift
Slash (/)
Enter Control Escape Backslash (\) Backspace
Spacebar
Shift Alt
Function keys
Shift
Slash (/)
Control Tab Backslash (\) Enter Backspace Escape
Tab
Escape Function keys
Backslash (\)
Backspace
Enter
Shift
Spacebar
Control
Tab
Slash (/) Alt Shift
Figure 1.3. The various PC keyboards.
Numeric keypad
Numeric keypad
Numeric keypad
27
EXAMPLE
C+ + By
The group of numbers and arrows on the far right of the
keyboard is called the numeric keypad. People familiar with a 10-key
adding machine usually prefer to type numbers from the keypad
rather than from the top row of the alphabetic key section. The
numbers on the keypad work only when you press the NumLock
key. If you press NumLock a second time, you disable these number
keys and make the arrow keys work again. To prevent confusion,
many keyboards have separate arrow keys and a keypad used solely
for numbers.
The arrows help you move the cursor from one area of the
screen to another. To move the cursor toward the top of the screen,
you have to press the up arrow continuously. To move the cursor to
the right, you press the right-arrow, and so on. Do not confuse the
Backspace key with the left-arrow. Pressing Backspace moves the
cursor backward one character at a timeerasing everything as it
moves. The left-arrow simply moves the cursor backward, without
erasing.
The keys marked Insert and Delete (Ins and Del on some
keyboards) are useful for editing. Your C++ program editor prob-
ably takes advantage of these two keys. Insert and Delete work on
C++ programs in the same way they work on a word processors
text. If you do not have separate keys labeled Insert and Delete, you
probably have to press NumLock and use the keypad key 0 (for
Insert) and period (for Delete).
PgUp and PgDn are the keys to press when you want to scroll
the screen (that is, move your on-screen text either up or down).
Your screen acts like a camera that pans up and down your C++
programs. You can move the screen down your text by pressing
PgDn, and up by pressing PgUp. (Like Insert and Delete, you might
have to use the keypad for these operations.)
The keys labeled F1 through F12 (some keyboards go only to
F10) are called function keys. The function keys are located either
across the top of the alphabetic section or to the left of it. These keys
perform an advanced function, and when you press one of them,
you usually want to issue a complex command, such as searching for
a specific word in a program. The function keys in your C++
program, however, do not necessarily produce the same results as
they might in another program, such as a word processor. In other
words, function keys are application-specific.
Chapter 1 o W elcom e to C ++
28
CAUTION: Computer keyboards have a key for number 1, so
do not substitute the lowercase l to represent the number 1, as
you might on a typewriter. To C++, a 1 is different from the
letter l. You should be careful also to use 0 when you mean zero,
and O when you want the uppercase letter O.
The Mouse
The mouse is a relatively new input device. The mouse moves
the cursor to any on-screen location. If you have never used a mouse
before, you should take a little time to become skillful in moving the
cursor with it. Your C++ editor (described in Chapter 2, What is a
Program?) might use the mouse for selecting commands from its
menus.
Mouse devices have two or three buttons. Most of the time,
pressing the third button produces the same results as simulta-
neously pressing both keys on a two-button mouse.
The Modem
A PC modem enables your PC to communicate with other
computers over telephone lines. Some modems, called external
modems, sit in a box outside your computer. Internal modems reside
inside the system unit. It does not matter which one you have,
because they operate identically.
Some people have modems so they can share data between
their computer and that of a long-distance friend or off-site co-
worker. You can write programs in C++ that communicate with
your modem.
A modem can be
used to communi -
cate between two
di stant computers.
29
EXAMPLE
C+ + By
A Modem by Any Other Name...
The term digital computer comes from the fact that your com-
puter operates on binary (on and off) digital impulses of
electricity. These digital states of electricity are perfect for your
computers equipment, but they cannot be sent over normal
telephone lines. Telephone signals are called analog signals,
which are much different from the binary digital signals in
your PC.
Therefore, before your computer can transmit data over a
telephone line, the information must be modulated (converted)
to analog signals. The receiving computer must have a way to
demodulate (convert back) those signals to digital.
The modem is the means by which computer signals are
modulated and demodulated from digital to analog and vice
versa. Thus, the name of the device that modulates and demodu-
lates these signals is modem.
Software
No matter how fast, large, and powerful your computers
hardware is, its software determines what work is done and how the
computer does it. Software is to a computer what music is to a stereo
system. You store software on the computers disk and load it in
your computers memory when you are ready to process the soft-
ware, just as you store music on a tape and play it when you want
to hear music.
Programs and Data
No doubt you have heard the phrase, data processing. This is
what computers actually do: they take data and manipulate it into
Chapter 1 o W elcom e to C ++
30
meaningful output. The meaningful output is called information.
Figure 1.4 shows the input-process-output model, which is the foun-
dation of everything that happens in your computer.
Figure 1.4. Data processing at its most elementary level.
In Chapter 2, What Is a Program?, you learn the mechanics of
programs. For now, you should know that the programs you write
in C++ process the data that you input in the programs. Both data
and programs compose the software. The hardware acts as a vehicle
to gather the input and produce the output. Without software,
computers would be worthless, just as an expensive stereo would be
useless without some way of playing music so you can hear it.
The input comes from input devices, such as keyboards, mo-
dems, and disk drives. The CPU processes the input and sends the
results to the output devices, such as the printer and the monitor. A
C++ payroll program might receive its input (the hours worked)
from the keyboard. It would instruct the CPU to calculate the payroll
amounts for each employee in the disk files. After processing the
payroll, the program could print the checks.
MS-DOS
MS-DOS (Microsoft disk operating system) is a system that lets
your C++ programs interact with hardware. MS-DOS (commonly
called DOS) is always loaded into RAM when you turn on your
computer. DOS controls more than just the disks; DOS is there so
your programs can communicate with all the computers hardware,
including the monitor, keyboard, and printer.
Figure 1.5 illustrates the concept of DOS as the go-between
with your computers hardware and software. Because DOS under-
stands how to control every device hooked to your computer, it
stays in RAM and waits for a hardware request. For instance,
printing the words C++ i s f un! on your printer takes many
computer instructions. However, you do not have to worry about all
31
EXAMPLE
C+ + By
those instructions. When your C++ program wants to print some-
thing, it tells DOS to print it. DOS always knows how to send
information to your printer, so it takes your C++ program requests
and does the work of routing that data to the printer.
Figure 1.5. DOS interfaces between hardware and software.
Many people program computers for years and never take the
time to learn why DOS is there. You do not have to be an expert in
DOS, or even know more than a few simple DOS commands, to be
proficient with your PC. Nevertheless, DOS does some things that
C++ cannot do, such as formatting disks and copying files to your
disks. As you learn more about the computer, you might see the
need to better understand DOS. For a good introduction to using
DOS, refer to the book MS-DOS 5 QuickStart (Que).
Chapter 1 o W elcom e to C ++
32
NOTE: As mentioned, DOS always resides in RAM and is
loaded when you start the computer. This is done automati-
cally, so you can use your computer and program in C++
without worrying about how to transfer DOS to RAM. It is
important to remember that DOS always uses some of your
total RAM.
Figure 1.6 shows you the placement of DOS, C++, and your
C++ data area in RAM. This formation is a typical way to represent
RAMseveral boxes stacked on top of each other. Each memory
location (each byte) has a unique address, just as everybodys resi-
dence has a unique address. The first address in memory begins at
0, the second RAM address is 1, and so on until the last RAM
location, many thousands of bytes later.
Figure 1.6. After MS-DOS and a C++ program, there is less RAM for
data.
Your operating system (whether you use MS-DOS, PC DOS,
DR DOS, or UNIX) takes part of the first few thousand bytes of
memory. The amount of RAM that DOS takes varies with each
computers configuration. When working in C++, the C++ system
sits on top of DOS, leaving you with the remainder of RAM for your
program and data. This explains why you might have a total of 512K
of RAM and still not have enough memory to run some programs
DOS is using some of the RAM for itself.
33
EXAMPLE
C+ + By
Review Questions
The answers to each chapters review questions are in Appen-
dix B, aptly named Answers to Review Questions.
1. What is the name of one of the programming languages
from which C was developed?
2. True or false: C++ is known as a better C.
3. In what decade was C++ developed?
4. True or false: C++ is too large to fit on many micro-
computers.
5. Which usually holds more data: RAM or the hard disk?
6. What device is needed for your PC to communicate over
telephone lines?
7. Which of the following device types best describes the
mouse?
a. Storage
b. Input
c. Output
d. Processing
8. What key would you press to turn off the numbers on the
numeric keypad?
9. What operating system is written almost entirely in C?
10. Why is RAM considered volatile?
11. True or false: The greater the resolution, the better the
appearance of graphics on-screen.
12. How many bytes is 512K?
13. What does modem stand for?
Chapter 1 o W elcom e to C ++
34
Summary
C++ is an efficient, powerful, and popular programming lan-
guage. Whether you are new to C++ or an experienced programmer,
C++ is all you need to program the computer to work the way you
want it to.
This chapter presented the background of C++ by walking you
through the history of its predecessor, the C programming lan-
guage. C++ adds to C and offers some of the most advanced
programming language commands that exist today.
The rest of this book is devoted to teaching you C++. Chapter
2, What Is a Program?, explains program concepts so you can
begin to write C++ programs.
35
EXAMPLE
C+ + By
2
What Is a
Program?
This chapter introduces you to fundamental programming con-
cepts. The task of programming computers has been described as
rewarding, challenging, easy, difficult, fast, and slow. Actually, it is
a combination of all these descriptions. Writing complex programs
to solve advanced problems can be frustrating and time-consuming,
but you can have fun along the way, especially with the rich
assortment of features that C++ has to offer.
This chapter also describes the concept of programming, from
a programs inception to its execution on your computer. The most
difficult part of programming is breaking the problem into logical
steps that the computer can execute. Before you finish this chapter,
you will type and execute your first C++ program.
This chapter introduces you to
o The concept of programming
o The programs output
o Program design
o Using an editor
o Using a compiler
Chapter 2 o W hat Is a Program ?
36
o Typing and running a C++ program
o Handling errors
After you complete this chapter, you should be ready to learn
the C++ programming language elements in greater detail.
Computer Programs
Before you can make C++ work for you, you must write a C++
program. You have seen the word program used several times in this
book. The following note defines a program more formally.
NOTE: A program is a list of instructions that tells the computer
to do things.
Keep in mind that computers are only machines. Theyre not
smart; in fact, theyre quite the opposite! They dont do anything
until they are given detailed instructions. A word processor, for
example, is a program somebody wrotein a language such as
C++that tells your computer exactly how to behave when you
type words into it.
You are familiar with the concept of programming if you have
ever followed a recipe, which is a program, or a list of instructions,
telling you how to prepare a certain dish. A good recipe lists these
instructions in their proper order and with enough description so
you can carry out the directions successfully, without assuming
anything.
If you want your computer to help with your budget, keep
track of names and addresses, or compute your gas mileage, it needs
a program to tell it how to do those things. You can supply that
program in two ways: buy a program somebody else wrote, or write
the program yourself.
Writing the program yourself has a big advantage for many
applications: The program does exactly what you want it to do. If you
buy one that is already written, you have to adapt your needs to
those of the author of the program. This is where C++ comes into
37
EXAMPLE
C+ + By
play. With the C++ programming language (and a little studying),
you can make your computer carry out your own tasks precisely.
To give C++ programming instructions to your computer, you
need an editor and a C++ compiler. An editor is similar to a word
processor; it is a program that enables you to type a C++ program
into memory, make changes (such as moving, copying, inserting,
and deleting text), and save the program more permanently in a disk
file. After you use the editor to type the program, you must compile
it before you can run it.
The C++ programming language is called a compiled language.
You cannot write a C++ program and run it on your computer unless
you have a C++ compiler. This compiler takes your C++ language
instructions and translates them into a form that your computer can
read. A C++ compiler is the tool your computer uses to understand
the C++ language instructions in your programs. Many compilers
come with their own built-in editor. If yours does, you probably feel
that your C++ programming is more integrated.
To some beginning programmers, the process of compiling a
program before running it might seem like an added and meaning-
less step. If you know the BASIC programming language, you might
not have heard of a compiler or understand the need for one. Thats
because BASIC (also APL and some versions of other computer
languages) is not a compiled language, but an interpreted language.
Instead of translating the entire program into machine-readable
form (as a compiler does in one step), an interpreter translates each
program instructionthen executes itbefore translating the next
one. The difference between the two is subtle, but the bottom line is
not: Compilers produce much more efficient and faster-running
programs than interpreters do. This seemingly extra step of compil-
ing is worth the effort (and with todays compilers, there is not much
extra effort needed).
Because computers are machines that do not think, the instruc-
tions you write in C++ must be detailed. You cannot assume your
computer understands what to do if some instruction is not in your
program, or if you write an instruction that does not conform to C++
language requirements.
After you write and compile a C++ program, you have to run,
or execute, it. Otherwise, your computer would not know that you
Chapter 2 o W hat Is a Program ?
38
want it to follow the instructions in the program. Just as a cook must
follow a recipes instructions before making the dish, so too your
computer must execute a programs instructions before it can ac-
complish what you want it to do. When you run a program, you are
telling the computer to carry out your instructions.
The Program and Its Output
While you are programming, remember the difference be-
tween a program and its output. Your program contains only
the C++ instructions that you write, but the computer follows
your instructions only after you run the program.
Throughout this book, you often see a program listing (that is,
the C++ instructions in the program) followed by the results
that occur when you run the program. The results are the
output of the program, and they go to an output device such as
the screen, the printer, or a disk file.
Program Design
You must plan your programs before typing them into your
C++ editor. When builders construct houses, for example, they dont
immediately grab their lumber and tools and start building! They
first find out what the owner of the house wants, then they draw up
the plans, order the materials, gather the workers, and finally start
building the house.
The hardest part of writing a program is breaking it into logical
steps that the computer can follow. Learning the C++ language is a
requirement, but it is not the only thing to consider. There is a
method of writing programs, a formal procedure you should learn,
that makes your programming job easier. To write a program you
should:
1. Define the problem to be solved with the computer.
2. Design the programs output (what the user should see).
Desi gn your
programs before you
type them.
39
EXAMPLE
C+ + By
3. Break the problem into logical steps to achieve this output.
4. Write the program (using the editor).
5. Compile the program.
6. Test the program to assure it performs as you expect.
As you can see from this procedure, the typing of your program
occurs toward the end of your programming. This is important,
because you first have to plan how to tell the computer how to
perform each task.
Your computer can perform instructions only step-by-step.
You must assume that your computer has no previous knowledge
of the problem, so it is up to you to provide that knowledge, which,
after all, is what a good recipe does. It would be a useless recipe for
a cake if all it said was: Bake the cake. Why? Because this assumes
too much on the part of the baker. Even if you write the recipe in
step-by-step fashion, proper care must be taken (through planning)
to be sure the steps are in sequence. Wouldnt it be foolish also to
instruct a baker to put the ingredients into the oven before stirring
them?
This book adheres to the preceding programming procedure
throughout the book, as each program appears. Before you see the
actual program, the thought process required to write the program
appears. The goals of the program are presented first, then these
goals are broken into logical steps, and finally the program is
written.
Designing the program in advance guarantees that the entire
program structure is more accurate and keeps you from having to
make changes later. A builder, for example, knows that a room is
much harder to add after the house is built. If you do not properly
plan every step, it is going to take you longer to create the final,
working program. It is always more difficult to make major changes
after you write your program.
Planning and developing according to these six steps becomes
much more important as you write longer and more complicated
programs. Throughout this book, you learn helpful tips for program
design. Now its time to launch into C++, so you can experience the
satisfaction of typing your own program and seeing it run.
Chapter 2 o W hat Is a Program ?
40
Using a Program Editor
The instructions in your C++ program are called the source code.
You type source code into your computers memory by using your
program editor. After you type your C++ source code (your pro-
gram), you should save it to a disk file before compiling and running
the program. Most C++ compilers expect C++ source programs to be
stored in files with names ending in .CPP. For example, the follow-
ing are valid filenames for most C++ compilers:
MYPROG.CPP
SALESACT.CPP
EMPLYEE.CPP
ACCREC.CPP
Many C++ compilers include a built-in editor. Two of the most
popular C++ compilers (both conform to the AT&T C++ 2.1 stan-
dard and include their own extended language elements) are
Borlands C++ and Microsofts C/C++ 7.0 compilers. These two
programs run in fully integrated environments that relieve the
programmer from having to worry about finding a separate pro-
gram editor or learning many compiler-specific commands.
Figure 2.1 shows a Borland C++ screen. Across the top of the
screen (as with Microsoft C/C++ 7.0) is a menu that offers pull-
down editing, compiling, and running options. The middle of the
screen contains the body of the program editor, and this is the area
where the program goes. From this screen, you type, edit, compile,
and run your C++ source programs. Without an integrated environ-
ment, you would have to start an editor, type your program, save the
program to disk, exit the editor, run the compiler, and only then run
the compiled program from the operating system. With Borlands
C++ and Microsoft C/C++ 7.0, you simply type the program into the
editor, thenin one stepyou select the proper menu option that
compiles and runs the program.
41
EXAMPLE
C+ + By
Figure 2.1. Borland Turbo C++s integrated environment.
If you do not own an integrated environment such as Borland
C++ or Microsoft C/C++, you have to find a program editor. Word
processors can act as editors, but you have to learn how to save and
load files in a true ASCII text format. It is often easier to use an editor
than it is to make a word processor work like one.
On PCs, DOS Version 5 comes with a nice, full-screen editor
called EDIT. It offers menu-driven commands and full cursor-
control capabilities. EDIT is a simple program to use, and is a good
beginners program editor. Refer to your DOS manual or a good
book on DOS, such as MS-DOS 5 QuickStart (Que), for more infor-
mation on this program editor.
Another editor, called EDLIN, is available for earlier versions
of DOS. EDLIN is a line editor that does not allow full-screen cursor
control, and it requires you to learn some cryptic commands. The
advantage to learning EDLIN is that it is always included with all
PCs that use a release of DOS prior to Version 5.
Chapter 2 o W hat Is a Program ?
42
If you use a computer other than a PC, such as a UNIX-based
minicomputer or a mainframe, you have to determine which editors
are available. Most UNIX systems include the vi editor. If you
program on a UNIX operating system, it would be worth your time
to learn vi . It is to UNIX what EDLIN is to PC operating systems, and
is available on almost every UNIX computer in the world.
Mainframe users have other editors available, such as the ISPF
editor. You might have to check with your systems department to
find an editor accessible from your account.
NOTE: Because this book teaches the generic AT&T C++
standard programming language, no attempt is made to tie in
editor or compiler commandsthere are too many on the
market to cover them all in one book. As long as you write
programs specific to the AT&T C++, the tools you use to edit,
compile, and run those programs are secondary; your goal of
good programming is the result of whatever applications you
produce.
Using a C++ Compiler
After you type and edit your C++ programs source code, you
have to compile the program. The process you use to compile your
program depends on the version of C++ and the computer you are
using. Borland C++ and Microsoft C/C++ users need only press Alt-
R to compile and run their programs. When you compile programs
on most PCs, your compiler eventually produces an executable file
with a name beginning with the same name as the source code, but
ends with an .EXE file extension. For example, if your source
program is named GRADEAVG.CPP, the PC would produce a
compiled file called GRADEAVG.EXE, which you could execute at
the DOS prompt by typing the name gr adeavg.
43
EXAMPLE
C+ + By
NOTE: Each program in this book contains a comment that
specifies a recommended filename for the source program. You
do not have to follow the file-naming conventions used in this
book; the filenames are only suggestions. If you use a main-
frame, you have to follow the dataset-naming conventions set
up by your system administrator. Each program name in the
sample disk (see the order form at the back of the book) matches
the filenames of the program listings.
UNIX users might have to use the cf r ont compiler. Most cf r ont
compilers actually convert C++ code into regular C code. The C code
is then compiled by the systems C compiler. This produces an
executable file whose name (by default) is A.OUT. You can then run
the A.OUT file from the UNIX prompt. Mainframe users generally
have company-standard procedures for compiling C++ source pro-
grams and storing their results in a test account.
Unlike many other programming languages, your C++ pro-
gram must be routed through a preprocessor before it is compiled.
The preprocessor reads preprocessor directives that you enter in the
program to control the programs compilation. Your C++ compiler
automatically performs the preprocessor step, so it requires no
additional effort or commands to learn on your part.
You might have to refer to your compilers reference manuals
or to your companys system personnel to learn how to compile
programs for your programming environment. Again, learning the
programming environment is not as critical as learning the C++
language. The compiler is just a way to transform your program
from a source code file to an executable file.
Your program must go through one additional stage after
compiling and before running. It is called the linking, or the link
editing stage. When your program is linked, a program called the
linker supplies needed runtime information to the compiled pro-
gram. You can also combine several compiled programs into one
executable program by linking them. Most of the time, however,
Chapter 2 o W hat Is a Program ?
44
your compiler initiates the link editing stage (this is especially true
with integrated compilers such as Borland C++ and Microsoft C/
C++) and you do not have to worry about the process.
Figure 2.2 shows the steps that your C++ compiler and link
editor perform to produce an executable program.
Figure 2.2. Compiling C++ source code into an executable program.
Running a Sample Program
Before delving into the specifics of the C++ language, you
should take a few moments to become familiar with your editor and
C++ compiler. Starting with the next chapter, Your First C++
Program, you should put all your concentration into the C++
programming language and not worry about using a specific editor
or compiling environment.
45
EXAMPLE
C+ + By
Therefore, start your editor of choice and type Listing 2.1,
which follows, into your computer. Be as accurate as possiblea
single typing mistake could cause the C++ compiler to generate a
series of errors. You do not have to understand the programs
content at this point; the goal is to give you practice in using your
editor and compiler.
Listing 2.1. Practicing with the editor.
Comment the program with the program name.
Include the header file iostream.h so the output properly works.
Start of the mai n( ) function.
Define the BELL constant, which is the computers beep.
Initialize the integer variable ct r to 0.
Define the character array f name to hold 20 elements.
Print to the screen What i s your f i r st name?.
Accept a string from the keyboard.
Process a loop while the variable ct r is less than five.
Print the string accepted from the keyboard.
Increment the variable ct r by 1.
Print to the screen the character code that sounds the beep.
Return to the operating system.
/ / Fi l ename: C2FI RST. CPP
/ / Request s a name, pr i nt s t he name f i ve t i mes, and r i ngs a bel l .
#i ncl ude <i ost r eam. h>
mai n( )
{
const char BELL= \ a ; / / Const ant t hat r i ngs t he bel l
i nt ct r =0; / / I nt eger var i abl e t o count t hr ough l oop
char f name[ 20] ; / / Def i ne char act er ar r ay t o hol d name
cout << What i s your f i r st name? ; / / Pr ompt t he user
ci n >> f name; / / Get t he name f r omt he keyboar d
whi l e ( ct r < 5) / / Loop t o pr i nt t he name
Chapter 2 o W hat Is a Program ?
46
{ / / exact l y f i ve t i mes.
cout << f name << \ n;
ct r ++;
}
cout << BELL; / / Ri ng t he t er mi nal s bel l
r et ur n 0;
}
Be as accurate as possible. In most programming languages
and especially in C++the characters you type into a program must
be very accurate. In this sample C++ program, for instance, you see
parentheses, ( ) , brackets, [ ] , and braces, {}, but you cannot use them
interchangeably.
The comments (words following the two slashes, / / ) to the right
of some lines do not have to end in the same place that you see in the
listing. They can be as long or short as you need them to be.
However, you should familiarize yourself with your editor and
learn to space characters accurately so you can type this program
exactly as shown.
Compile the program and execute it. Granted, the first time you
do this you might have to check your reference manuals or contact
someone who already knows your C++ compiler. Do not worry
about damaging your computer: Nothing you do from the keyboard
can harm the physical computer. The worst thing you can do at this
point is erase portions of your compiler software or change the
compilers optionsall of which can be easily corrected by reload-
ing the compiler from its original source. (It is only remotely likely
that you would do anything like this, even if you are a beginner.)
Handling Errors
Because you are typing instructions for a machine, you must be
very accurate. If you misspell a word, leave out a quotation mark, or
make another mistake, your C++ compiler informs you with an
error message. In Borland C++ and Microsoft C/C++, the error
probably appears in a separate window, as shown in Figure 2.3. The
most common error is a syntax error, and this usually implies a
misspelled word.
47
EXAMPLE
C+ + By
Figure 2.3. The compiler reporting a program error.
When you get an error message (or more than one), you must
return to the program editor and correct the error. If you dont
understand the error, you might have to check your reference
manual or scour your programs source code until you find the
offending code line.
Getting the Bugs Out
One of the first computers, owned by the military, refused to
print some important data one day. After its programmers
tried for many hours to find the problem in the program, a
programmer by the name of Grace Hopper decided to check
the printer.
She found a small moth lodged between two important wires.
When she removed the moth, the printer started working
perfectly (although the moth did not have the same luck).
Chapter 2 o W hat Is a Program ?
48
Grace Hopper was an admiral from the Navy and, although
she was responsible for developing many important computer
concepts (she was the author of the original COBOL language),
she might be best known for discovering the first computer
bug.
Ever since Admiral Hopper discovered that moth, errors in
computer programs have been known as computer bugs. When
you test your programs, you might have to debug themget the
bugs (errors) out by correcting your typing errors or changing
the logic so your program does exactly what you want it to do.
After you have typed your program correctly using the editor
(and you get no compile errors), the program should run properly
by asking for your first name, then printing it on-screen five times.
After it prints your name for the fifth time, you hear the computers
bell ring.
This example helps to illustrate the difference between a pro-
gram and its output. You must type the program (or load one from
disk), then run the program to see its output.
Review Questions
The answers to the review questions are in Appendix B,
Answers to Review Questions.
1. What is a program?
2. What are the two ways to obtain a program that does what
you want?
3. True or false: Computers can think.
4. What is the difference between a program and its output?
5. What do you use for typing C++ programs into the
computer?
49
EXAMPLE
C+ + By
6. What filename extension do all C++ programs have?
7. Why is typing the program one of the last steps in the pro-
gramming process?
8. What does the term debug mean?
9. Why is it important to write programs that are compatible
with the AT&T C++?
10. True or false: You must link a program before compiling it.
Summary
After reading this chapter, you should understand the steps
necessary to write a C++ program. You know that planning makes
writing the program much easier, and that your programs instruc-
tions produce the output only after you run the program.
You also learned how to use your program editor and compiler.
Some program editors are as powerful as word processors. Now
that you know how to run C++ programs, it is time to start learning
the C++ programming language.
Chapter 2 o W hat Is a Program ?
50
51
EXAMPLE
C+ + By
3
Your First C++
Program
This chapter introduces you to some important C++ language
commands and other elements. Before looking at the language more
specifically, many people like to walk through a few simple
programs to get an overall feel for what a C++ program involves.
This is done here. The rest of the book covers these commands and
elements more formally.
This chapter introduces the following topics:
o An overview of C++ programs and their structure
o Variables and literals
o Simple math operators
o Screen output format
This chapter introduces a few general tools you need to become
familiar with the C++ programming language. The rest of the book
concentrates on more specific areas of the actual language.
Chapter 3 o Your First C ++ Program
52
Looking at a C++ Program
Figure 3.1 shows the outline of a typical small C++ program.
No C++ commands are shown in the figure. Although there is much
more to a program than this outline implies, this is the general
format of the beginning examples in this book.
Figure 3.1. A skeleton outline of a simple C++ program.
To acquaint yourself with C++ programs as fast as possible,
you should begin to look at a program in its entirety. The following
is a listing of a simple example C++ program. It doesnt do much, but
it enables you to see the general format of C++ programming. The
next few sections cover elements from this and other programs. You
might not understand everything in this program, even after finish-
ing the chapter, but it is a good place to start.
/ / Fi l ename: C3FI RST. CPP
/ / I ni t i al C++ pr ogr amt hat demonst r at es t he C++ comment s
/ / and shows a f ew var i abl es and t hei r decl ar at i ons.
Program goes here
Preprocessor directives
go here
Function name
#i ncl ude <i ost r eam. h>
mai n( )
{
.
.
.
}
Block
53
EXAMPLE
C+ + By
#i ncl ude <i ost r eam. h>
mai n( )
{
i nt i , j ; / / These t hr ee l i nes decl ar e f our var i abl es.
char c;
f l oat x;
i = 4; / / i and j ar e bot h assi gned i nt eger l i t er al s.
j = i + 7;
c = A ; / / Al l char act er l i t er al s ar e
/ / encl osed i n si ngl e quot at i ons.
x = 9. 087; / / x r equi r es a f l oat i ng- poi nt val ue because i t
/ / was decl ar ed as a f l oat i ng- poi nt var i abl e.
x = x * 4. 5; / / Change what was i n x wi t h a f or mul a.
/ / Sends t he val ues of t he var i abl es t o t he scr een.
cout << i << , << j << , << c << , << x << \ n;
r et ur n 0; / / ALWAYS end pr ogr ams and f unct i ons wi t h r et ur n.
/ / The 0 r et ur ns t o t he oper at i ng syst emand
/ / usual l y i ndi cat es no er r or s occur r ed.
}
For now, familiarize yourself with this overall program. See if
you can understand any part or all of it. If you are new to program-
ming, you should know that the computer reads each line of the
program, starting with the first line and working its way down, until
it has completed all the instructions in the program. (Of course, you
first have to compile and link the program, as described in Chap-
ter 2, What Is a Program?.)
The output of this program is minimal: It simply displays four
values on-screen after performing some assignments and calcula-
tions of arbitrary values. Just concentrate on the general format at
this point.
The Format of a C++ Program
Unlike some other programming languages, such as COBOL,
C++ is a free-form language, meaning that programming statements
C++ i s a free- form
l anguage.
Chapter 3 o Your First C ++ Program
54
can start in any column of any line. You can insert blank lines in a
program if you want. This sample program is called C3FIRST.CPP
(you can find the name of each program in this book in the first line
of each program listing). It contains several blank lines to help
separate parts of the program. In a simple program such as this, the
separation is not as critical as it might be in a longer, more complex
program.
Generally, spaces in C++ programs are free-form as well. Your
goal should not be to make your programs as compact as possible.
Your goal should be to make your programs as readable as possi-
ble. For example, the C3FIRST.CPP program shown in the previous
section could be rewritten as follows:
/ / Fi l ename: C3FI RST. CPP I ni t i al C++ pr ogr amt hat demonst r at es
/ / t he C++ comment s and shows a f ew var i abl es and t hei r
/ / decl ar at i ons.
#i ncl ude <i ost r eam. h>
mai n( ) {i nt i , j ; / / These t hr ee l i nes decl ar e f our var i abl es.
char c; f l oat x; i =4; / / i and j ar e bot h assi gned i nt eger l i t er al s.
j =i +7; c= A ; / / Al l char act er l i t er al s ar e encl osed i n
/ / si ngl e quot at i ons.
x=9. 087; / / x r equi r es a f l oat i ng- poi nt val ue because i t was
/ / decl ar ed as a f l oat i ng- poi nt var i abl e.
x=x*4. 5; / / Change what was i n x wi t h a f or mul a.
/ / Sends t he val ues of t he var i abl es t o t he scr een.
cout <<i <<, <<j <<, <<c<<, <<x<<\ n; r et ur n 0; / / ALWAYS
/ / end pr ogr ams and f unct i ons wi t h r et ur n. The 0 r et ur ns t o
/ / t he oper at i ng syst emand usual l y i ndi cat es no er r or s occur r ed.
}
To your C++ compiler, the two programs are exactly the same,
and they produce exactly the same result. However, to people who
have to read the program, the first style is much more readable.
Readability Is the Key
As long as programs do their job and produce correct output,
who cares how well they are written? Even in todays world of fast
computers and abundant memory and disk space, you should still
55
EXAMPLE
C+ + By
care. Even if nobody else ever looks at your C++ program, you might
have to change it at a later date. The more readable you make your
program, the faster you can find what needs changing, and change
it accordingly.
If you work as a programmer for a corporation, you can almost
certainly expect to modify someone elses source code, and others
will probably modify yours. In programming departments, it is said
that long-term employees write readable programs. Given this new
global economy and all the changes that face business in the years
ahead, companies are seeking programmers who write for the
future. Programs that are straightforward, readable, abundant with
white space (separating lines and spaces), and devoid of hard-to-read
tricks that create messy programs are the most desirable.
Use ample white space so you can have separate lines and
spaces throughout your programs. Notice the first few lines of
C3FIRST.CPP start in the first column, but the body of the program
is indented a few spaces. This helps programmers zero in on the
important code. When you write programs that contain several
sections (called blocks), your use of white space helps the readers
eye follow and recognize the next indented block.
Upperc ase Versus Lowerc as e
Your uppercase and lowercase letters are much more signifi-
cant in C++ than in most other programming languages. You can see
that most of C3FIRST.CPP is in lowercase. The entire C++ language
is in lowercase. For example, you must type the keywords i nt , char ,
and r et ur n in programs using lowercase characters. If you use
uppercase letters, your C++ compiler would produce many errors
and refuse to compile the program until you correct the errors.
Appendix E, Keyword and Function Reference, shows a list of
every command in the C++ programming language. You can see
that none of the commands have uppercase letters.
Many C++ programmers reserve uppercase characters for
some words and messages sent to the screen, printer, or disk file;
they use lowercase letters for almost everything else. There is,
however, one exception to this rule in Chapter 4, Variables and
Literals, dealing with the const keyword.
Use l owercase
abundantl y i n C++!
Chapter 3 o Your First C ++ Program
56
Brac es and mai n( )
All C++ programs require the following lines:
mai n( )
{
The statements that follow mai n( ) are executed first. The section
of a C++ program that begins with mai n( ) , followed by an opening
brace, {, is called the main function. A C++ program is actually a
collection of functions (small sections of code). The function called
mai n( ) is always required and always the first function executed.
In the sample program shown here, almost the entire program
is mai n( ) because the matching closing brace that follows mai n( ) s
opening brace is at the end of the program. Everything between two
matching braces is called a block. You read more about blocks in
Chapter 16, Writing C++ Functions. For now, you only have to
realize that this sample program contains just one function, mai n( ) ,
and the entire function is a single block because there is only one
pair of braces.
All executable C++ statements must have a semicolon (; ) after
them so C++ is aware that the statement is ending. Because the
computer ignores all comments, do not put semicolons after your
comments. Notice that the lines containing mai n( ) and braces do not
end with semicolons either, because these lines simply define the
beginning and ending of the function and are not executed.
As you become better acquainted with C++, you learn when to
include the semicolon and when to leave it off. Many beginning C++
programmers learn quickly when semicolons are required; your
compiler certainly lets you know if you forget to include a semicolon
where one is needed.
Figure 3.2 repeats the sample program shown in Figure 3.1. It
contains additional markings to help acquaint you with these new
terms as well as other items described in the remainder of this
chapter.
Al l executabl e C++
statements must
end wi th a semi -
col on (; ).
A C++ bl ock i s
encl osed i n two
braces.
57
EXAMPLE
C+ + By
/ / Fi l ename: C3FI RST. CPP
/ / I ni t i al C++ pr ogr amt hat demonst r at es t he C++ comment s
/ / and shows a f ew var i abl es and t hei r decl ar at i ons.
#i ncl ude <i ost r eam. h>
mai n( )
{
i nt i , j ; / / These t hr ee l i nes decl ar e f our var i abl es.
char c;
f l oat x;
i = 4; / / i and j ar e bot h assi gned i nt eger l i t er al s.
j = i + 7;
c = A ; / / Al l char act er l i t er al s ar e
/ / encl osed i n si ngl e quot at i ons.
x = 9. 087; / / x r equi r es a f l oat i ng- poi nt val ue because i t
/ / was decl ar ed as a f l oat i ng- poi nt var i abl e.
x = x * 4. 5; / / Change what was i n x wi t h a f or mul a.
/ / Sends t he val ues of t he var i abl es t o t he scr een.
cout << i << , << j << , << c << , << x << \ n;
r et ur n 0; / / ALWAYS end pr ogr ams and f unct i ons wi t h r et ur n.
/ / The 0 r et ur ns t o t he oper at i ng syst emand
/ / usual l y i ndi cat es no er r or s occur r ed.
} End block
Body of program
Variable declarations
Begin block
Comments
Figure 3.2. The parts of the sample program.
Comments in C++
In Chapter 2, What Is a Program?, you learned the difference
between a program and its output. Most users of a program do not
see the actual program; they see the output from the execution of the
programs instructions. Programmers, on the other hand, look at the
program listings, add new routines, change old ones, and update for
advancements in computer equipment.
Preprocessor directive
Chapter 3 o Your First C ++ Program
58
As explained earlier, the readability of a program is important
so you and other programmers can look through it easily. Neverthe-
less, no matter how clearly you write C++ programs, you can always
enhance their readability by adding comments throughout.
Comments are messages that you insert in your C++ programs,
explaining what is going on at that point in the program. For
example, if you write a payroll program, you might put a comment
before the check-printing routine that describes what is about to
happen. You never put C++ language statements inside a comment,
because a comment is a message for peoplenot computers. Your
C++ compiler ignores all comments in every program.
NOTE: C++ comments always begin with a / / symbol and end
at the end of the line.
Some programmers choose to comment several lines. Notice in
the sample program, C3FIRST.CPP, that the first three lines are
comment lines. The comments explain the filename and a little about
the program.
Comments also can share lines with other C++ commands. You
can see several comments sharing lines with commands in the
C3FIRST.CPP program. They explain what the individual lines do.
Use abundant comments, but remember who theyre for: people,
not computers. Use comments to help explain your code, but do not
overcomment. For example, even though you might not be familiar
with C++, the following statement is easy: It prints C++ By Ex-
ample on-screen.
cout << C++ By Exampl e; / / Pr i nt C++ By Exampl e on- scr een.
This comment is redundant and adds nothing to your under-
standing of the line of code. It would be much better, in this case, to
leave out the comment. If you find yourself almost repeating the
C++ code, leave out that particular comment. Not every line of a
C++ program should be commented. Comment only when code
lines need explainingin Englishto the people looking at your
program.
It does not matter if you use uppercase, lowercase, or a mixture
of both in your comments because C++ ignores them. Most C++
Comments tel l
peopl e what the
program i s doi ng.
59
EXAMPLE
C+ + By
programmers capitalize the first letter of sentences in comments,
just as you would in everyday writing. Use whatever case seems
appropriate for the letters in your message.
C++ can also use C-style comments. These are comments that
begin with / * and end with */ . For instance, this line contains a
comment in the C and C++ style:
net pay = gr osspay - t axes; / * Comput e t ake- home pay. */
Comment As You Go
Insert your comments as you write your programs. You are
most familiar with your program logic at the time you are
typing the program in the editor. Some people put off adding
comments until after the program is written. More often than
not, however, those comments are never added, or else they are
written halfheartedly.
If you comment as you write your code, you can glance back at
your comments while working on later sections of the pro-
graminstead of having to decipher the previous code. This
helps you whenever you want to search for something earlier
in the program.
Examples
1. Suppose you want to write a C++ program that produces a
fancy boxed title containing your name with flashing dots
around it (like a marquee). The C++ code to do this might be
difficult to understand. Before such code, you might want to
insert the following comment so others can understand the
code later:
/ / The f ol l owi ng f ew l i nes dr aw a f ancy box ar ound
/ / a name, t hen di spl ay f l ashi ng dot s ar ound t he
/ / name l i ke a Hol l ywood movi e mar quee.
Chapter 3 o Your First C ++ Program
60
This would not tell C++ to do anything because a comment
is not a command, but it would make the next few lines of
code more understandable to you and others. The comment
explains in English, for people reading the program, exactly
what the program is getting ready to do.
2. You should also put the disk filename of the program in one
of the first comments. For example, in the C3FIRST.CPP
program shown earlier, the first line is the beginning of a
comment:
/ / Fi l ename: C3FI RST. CPP
The comment is the first of three lines, but this line tells you
in which disk file the program is stored. Throughout this
book, programs have comments that include a possible
filename under which the program can be stored. They
begin with Cx, where x is the chapter number in which they
appear (for example, C6VARPR.CPP and C10LNIN.CPP).
This method helps you find these programs when they are
discussed in another section of the book.
TIP: It might be a good idea to put your name at the top of a
program in a comment. If people have to modify your program
at a later date, they first might want to consult with you, as the
original programmer, before they change it.
Explaining the Sample
Program
Now that you have an overview of a C++ program, its struc-
ture, and its comments, the rest of this chapter walks you through
the entire sample program. Do not expect to become a C++ expert
just by completing this sectionthat is what the rest of the book is
for! For now, just sit back and follow this step-by-step description of
the program code.
61
EXAMPLE
C+ + By
As described earlier, this sample program contains several
comments. The first three lines of the program are comments:
/ / Fi l ename: C3FI RST. CPP
/ / I ni t i al C++ pr ogr amt hat demonst r at es t he C++ comment s
/ / and shows a f ew var i abl es and t hei r decl ar at i ons.
This comment lists the filename and explains the purpose of the
program. This is not the only comment in the program; others
appear throughout the code.
The next line beginning with #i ncl ude is called a preprocessor
directive and is shown here:
#i ncl ude <i ost r eam. h>
This strange looking statement is not actually a C++ command, but
is a directive that instructs the C++ compiler to load a file from disk
into the middle of the current program. The only purpose for this
discussion is to ensure that the output generated with cout works
properly. Chapter 6, Preprocessor Directives, more fully explains
this directive.
The next two lines (following the blank separating line) are
shown here:
mai n( )
{
This begins the mai n( ) function. Basically, the mai n( ) functions
opening and closing braces enclose the body of this program and
mai n( ) s instructions that execute. C++ programs often contain more
than one function, but they always contain a function called mai n( ) .
The mai n( ) function does not have to be the first one, but it usually is.
The opening brace begins the first and only block of this program.
When a programmer compiles and runs this program, the
computer looks for mai n( ) and starts executing whatever instruction
follows mai n( ) s opening brace. Here are the three lines that follow:
i nt i , j ; / / These t hr ee l i nes decl ar e f our var i abl es.
char c;
f l oat x;
Chapter 3 o Your First C ++ Program
62
These three lines declare variables. A variable declaration describes
variables used in a block of code. Variable declarations describe the
programs data storage.
A C++ program processes data into meaningful results. All
C++ programs include the following:
o Commands
o Data
Data comprises variables and literals (sometimes called con-
stants). As the name implies, a variable is data that can change
(become variable) as the program runs. A literal remains the same.
In life, a variable might be your salary. It increases over time (if you
are lucky). A literal would be your first name or social security
number, because each remains with you throughout life and does
not (naturally) change.
Chapter 4, Variables and Literals, fully explains these con-
cepts. However, to give you an overview of the sample programs
elements, the following discussion explains variables and literals in
this program.
C++ enables you to use several kinds of literals. For now, you
simply have to understand that a C++ literal is any number, charac-
ter, word, or phrase. The following are all valid C++ literals:
5. 6
- 45
Q
Mar y
18. 67643
0. 0
As you can see, some literals are numeric and some are
character-based. The single and double quotation marks around
two of the literals, however, are not part of the actual literals. A
single-character literal requires single quotation marks around it; a
string of characters, such as Mar y, requires double quotation marks.
63
EXAMPLE
C+ + By
Look for the literals in the sample program. You find these:
4
7
A
9. 087
4. 5
A variable is like a box inside your computer that holds
something. That something might be a number or a character. You
can have as many variables as needed to hold changing data. After
you define a variable, it keeps its value until you change it or define
it again.
Variables have names so you can tell them apart. You use the
assignment operator, the equal sign (=), to assign values to variables.
The following statement,
sal es=25000;
puts the literal value 25000 into the variable named sal es. In the
sample program, you find the following variables:
i
j
c
x
The three lines of code that follow the opening brace of the
sample program declare these variables. This variable declaration
informs the rest of the program that two integer variables named i
and j as well as a character variable called c and a floating-point
variable called x appear throughout the program. The terms integer
and floating-point basically refer to two different types of numbers:
Integers are whole numbers, and floating-point numbers contain
decimal points.
The next few statements of the sample program assign values
to these variables.
Chapter 3 o Your First C ++ Program
64
i = 4; / / i and j ar e bot h assi gned i nt eger l i t er al s.
j = i + 7;
c = A ; / / Al l char act er l i t er al s ar e
/ / encl osed i n si ngl e quot at i ons.
x = 9. 087; / / x r equi r es a f l oat i ng- poi nt val ue because i t
/ / was decl ar ed as a f l oat i ng- poi nt var i abl e.
x = x * 4. 5; / / Change what was i n x wi t h a f or mul a.
The first line puts 4 in the integer variable, i . The second line
adds 7 to the variable i s value to get 11, which then is assigned to (or
put into) the variable called j . The plus sign (+) in C++ works just
like it does in mathematics. The other primary math operators are
shown in Table 3.1.
Table 3.1. The primary math operators.
Operator Meaning Example
+ Addition 4 + 5
Subtraction 7 2
* Multiplication 12 * 6
/ Division 48 / 12
The character literal A is assigned to the c variable. The number
9. 087 is assigned to the variable called x, then x is immediately
overwritten with a new value: itself (9. 087) multiplied by 4.5. This
helps illustrate why computer designers use an asterisk (*) for
multiplication and not a lowercase x as people generally do to
show multiplication; the computer would confuse the variable x
with the multiplication symbol, x, if both were allowed.
TIP: If mathematical operators are on the right side of the
equal sign, the program completes the math before assigning
the result to a variable.
65
EXAMPLE
C+ + By
The next line (after the comment) includes the following
specialand, at first, confusingstatement:
cout << i << , << j << , << c << , << x << \ n;
When the program reaches this line, it prints the contents of the
four variables on-screen. The important part of this line is that the
four values for i , j , c, and x print on-screen.
The output from this line is
4, 11, A, 40. 891499
Because this is the only cout in the program, this is the only
output the sample program produces. You might think the program
is rather long for such a small output. After you learn more about
C++, you should be able to write more useful programs.
The cout is not a C++ command. You might recall from Chapter
2, What Is a Program?, that C++ has no built-in input/output
commands. The cout is an operator, described to the compiler in the
#i ncl ude file called iostream.h, and it sends output to the screen.
C++ also supports the pr i nt f ( ) function for formatted output.
You have seen one function already, mai n( ) , which is one for which
you write the code. The C++ programming designers have already
written the code for the pr i nt f function. At this point, you can think
of pr i nt f as a command that outputs values to the screen, but it is
actually a built-in function. Chapter 7, Simple Input/Output
describes the pr i nt f function in more detail.
NOTE: To differentiate pr i nt f from regular C++ commands,
parentheses are used after the name, as in pr i nt f ( ) . In C++, all
function names have parentheses following them. Sometimes
these parentheses have something between them, and some-
times they are blank.
The last two lines in the program are shown here:
r et ur n 0; / / ALWAYS end pr ogr ams and f unct i ons wi t h r et ur n.
}
Put a r et ur n
statement at the end
of each functi on.
Chapter 3 o Your First C ++ Program
66
The r et ur n command simply tells C++ that this function is
finished. C++ returns control to whatever was controlling the pro-
gram before it started running. In this case, because there was only
one function, control is returned either to DOS or to the C++ editing
environment. C++ requires a return value. Most C++ programmers
return a 0 (as this program does) to the operating system. Unless you
use operating-system return variables, you have little use for a
return value. Until you have to be more specific, always return a 0
from mai n( ) .
Actually, many r et ur n statements are optional. C++ would
know when it reached the end of the program without this state-
ment. It is a good programming practice, however, to put a r et ur n
statement at the end of every function, including mai n( ) . Because
some functions require a r et ur n statement (if you are returning
values), it is better to get in the habit of using them, rather than run
the risk of leaving one out when you really need it.
You will sometimes see parentheses around the r et ur n value,
as in:
r et ur n ( 0) ; / / ALWAYS end pr ogr ams and f unct i ons wi t h r et ur n.
The parentheses are unnecessary and sometimes lead begin-
ning C++ students into thinking that r et ur n is a built-in function.
However, the parentheses are recommended when you want to
return an expression. You read more about returning values in
Chapter 19, Function Return Values and Prototypes.
The closing brace after the r et ur n does two things in this
program. It signals the end of a block (begun earlier with the open-
ing brace), which is the end of the mai n( ) function, and it signals
the end of the program.
Review Questions
The answers to the review questions are in Appendix B, aptly
named Answers to Review Questions.
1. What must go before each comment in a C++ program?
2. What is a variable?
3. What is a literal?
67
EXAMPLE
C+ + By
4. What are four C++ math operators?
5. What operator assigns a variable its value? (Hint: It is called
the assignment operator.)
6. True or false: A variable can consist of only two types:
integers and characters.
7. What is the operator that writes output to the screen?
8. Is the following a variable name or a string literal?
ci t y
9. What, if anything, is wrong with the following C++
statement?
RETURN;
Summary
This chapter focused on teaching you to write helpful and
appropriate comments for your programs. You also learned a little
about variables and literals, which hold the programs data. Without
them, the term data processing would no longer be meaningful (there
would be no data to process).
Now that you have a feel for what a C++ program looks like, it
is time to begin looking at specifics of the commands. Starting with
the next chapter, you begin to write your own programs. The next
chapter picks up where this one left off; it takes a detailed look at
literals and variables, and better describes their uses and how to
choose their names.
Chapter 3 o Your First C ++ Program
68
69
EXAMPLE
C+ + By
4
Variables and
Literals
To understand data processing with C++, you must understand
how C++ creates, stores, and manipulates data. This chapter teaches
you how C++ handles data by introducing the following topics:
o The concepts of variables and literals
o The types of C++ variables and literals
o Special literals
o Constant variables
o Naming and using variables
o Declaring variables
o Assigning values to variables
Now that you have seen an overview of the C++ programming
language, you can begin writing C++ programs. In this chapter, you
begin to write your own programs from scratch.
You learned in Chapter 3, Your First C++ Program, that C++
programs consist of commands and data. Datum is the heart of all
C++ programs; if you do not correctly declare or use variables and
literals, your data are inaccurate and your results are going to be
Garbage i n, garbage
out!
Chapter 4 o Variables and Literals
70
inaccurate as well. A computer adage says the if you put garbage in,
you are going to get garbage out. This is very true. People usually
blame computers for mistakes, but the computers are not always at
fault. Rather, their data are often not entered properly into their
programs.
This chapter spends a long time focusing on numeric variables
and numeric literals. If you are not a numbers person, do not fret.
Working with numbers is the computers job. You have to under-
stand only how to tell the computer what you want it to do.
Variables
Variables have characteristics. When you decide your program
needs another variable, you simply declare a new variable and C++
ensures that you get it. In C++, variable declarations can be placed
anywhere in the program, as long as they are not referenced until
after they are declared. To declare a variable, you must understand
the possible characteristics, which follow.
o Each variable has a name.
o Each variable has a type.
o Each variable holds a value that you put there, by assigning
it to that variable.
The following sections explain each of these characteristics in
detail.
Naming Variables
Because you can have many variables in a single program, you
must assign names to them to keep track of them. Variable names are
unique, just as house addresses are unique. If two variables have the
same name, C++ would not know to which you referred when you
request one of them.
Variable names can be as short as a single letter or as long as 32
characters. Their names must begin with a letter of the alphabet but,
after the first letter, they can contain letters, numbers, and under-
score ( _ ) characters.
71
EXAMPLE
C+ + By
TIP: Spaces are not allowed in a variable name, so use the
underscore character to separate parts of the name.
The following list of variable names are all valid:
sal ar y aug91_sal es i i ndex_age amount
It is traditional to use lowercase letters for C++ variable names.
You do not have to follow this tradition, but you should know that
uppercase letters in variable names are different from lowercase
letters. For example, each of the following four variables is viewed
differently by your C++ compiler.
sal es Sal es SALES sALES
Be very careful with the Shift key when you type a variable
name. Do not inadvertently change the case of a variable name
throughout a program. If you do, C++ interprets them as distinct
and separate variables.
Variables cannot have the same name as a C++ command or
function. Appendix E, Keyword and Function Reference, shows
a list of all C++ command and function names.
The following are invalid variable names:
81_sal es Aug91+Sal es MY AGE pr i nt f
TIP: Although you can call a variable any name that fits the
naming rules (as long as it is not being used by another variable
in the program), you should always use meaningful variable
names. Give your variables names that help describe the values
they are holding.
For example, keeping track of total payroll in a variable called
t ot al _payr ol l is much more descriptive than using the variable
name XYZ34. Even though both names are valid, t ot al _payr ol l is
easier to remember and you have a good idea of what the
variable holds by looking at its name.
Do not gi ve vari abl es
the same name as a
command or bui l t- i n
functi on.
Chapter 4 o Variables and Literals
72
Variable Type s
Variables can hold different types of data. Table 4.1 lists the
different types of C++ variables. For instance, if a variable holds an
integer, C++ assumes no decimal point or fractional part (the part to
the right of the decimal point) exists for the variables value. A large
number of types are possible in C++. For now, the most important
types you should concentrate on are char , i nt , and f l oat . You can
append the prefix l ong to make some of them hold larger values than
they would otherwise hold. Using the unsi gned prefix enables them
to hold only positive numbers.
Table 4.1. Some C++ variable types.
Declaration Name Type
char Character
unsi gned char Unsigned character
si gned char Signed character (same as char )
i nt Integer
unsi gned i nt Unsigned integer
si gned i nt Signed integer (same as i nt )
shor t i nt Short integer
unsi gned shor t i nt Unsigned short integer
si gned shor t i nt Signed short integer (same as shor t i nt )
l ong Long integer
l ong i nt Long integer (same as l ong)
si gned l ong i nt Signed long integer (same as l ong i nt )
unsi gned l ong i nt Unsigned long integer
f l oat Floating-point
doubl e Double floating-point
l ong doubl e Long double floating-point
73
EXAMPLE
C+ + By
The next section more fully describes each of these types. For
now, you have to concentrate on the importance of declaring them
before using them.
Dec laring Variable s
There are two places you can declare a variable:
o Before the code that uses the variable
o Before a function name (such as before mai n( ) in the
program)
The first of these is the most common, and is used throughout
much of this book. (If you declare a variable before a function name,
it is called a global variable. Chapter 17, Variable Scope, addresses
the pros and cons of global variables.) To declare a variable, you
must state its type, followed by its name. In the previous chapter,
you saw a program that declared four variables in the following
way.
Start of the mai n( ) function.
Declare the variables i and j as integers.
Declare the variable c as a character.
Declare the variable x as a floating-point variable.
mai n( )
{
i nt i , j ; / / These t hr ee l i nes decl ar e f our var i abl es.
char c;
f l oat x;
/ / The r est of pr ogr amf ol l ows.
This declares two integer variables named i and j . You have no
idea what is inside those variables, however. You generally cannot
assume a variable holds zeroor any other numberuntil you
assign it a value. The first line basically tells C++ the following:
I am going to use two integer variables somewhere in this
program. Be expecting them. I want them named i and j . When I
put a value into i or j , I ensure that the value is an integer.
Decl are al l vari abl es
i n a C++ program
before you use them.
Chapter 4 o Variables and Literals
74
Without such a declaration, you could not assign i or j a value
later. All variables must be declared before you use them. This does
not necessarily hold true in other programming languages, such as
BASIC, but it does for C++. You could declare each of these two
variables on its own line, as in the following code:
mai n( )
{
i nt i ;
i nt j ;
/ / The r est of pr ogr amf ol l ows.
You do not gain any readability by doing this, however. Most
C++ programmers prefer to declare variables of the same type on the
same line.
The second line in this example declares a character variable
called c. Only single characters should be placed there. Next, a
floating-point variable called x is declared.
Examples
1. Suppose you had to keep track of a persons first, middle,
and last initials. Because an initial is obviously a character, it
would be prudent to declare three character variables to
hold the three initials. In C++, you could do that with the
following statement:
mai n( )
{
char f i r st , mi ddl e, l ast ;
/ / The r est of pr ogr amf ol l ows.
This statement could go after the opening brace of mai n( ) . It
informs the rest of the program that you require these three
character variables.
2. You could declare these three variables also on three sepa-
rate lines, although it does not necessarily improve readabil-
ity to do so. This could be accomplished with:
75
EXAMPLE
C+ + By
mai n( )
{
char f i r st ;
char mi ddl e;
char l ast ;
/ / The r est of pr ogr amf ol l ows.
3. Suppose you want to keep track of a persons age and
weight. If you want to store these values as whole numbers,
they would probably go in integer variables. The following
statement would declare those variables:
mai n( )
{
i nt age, wei ght ;
/ / The r est of pr ogr amf ol l ows.
Looking at Data Type s
You might wonder why it is important to have so many
variable types. After all, a number is just a number. C++ has more
data types, however, than almost all other programming languages.
The variables type is critical, but choosing the type among the many
offerings is not as difficult as it might first seem.
The character variable is easy to understand. A character
variable can hold only a single character. You cannot put more than
a single character into a character variable.
NOTE: Unlike many other programming languages, C++
does not have a string variable. Also, you cannot hold more
than a single character in a C++ character variable. To store a
string of characters, you must use an aggregate variable type
that combines other fundamental types, such as an array.
Chapter 5, Character Arrays and Strings, explains this more
fully.
Integers hold whole numbers. Although mathematicians might
cringe at this definition, an integer is actually any number that does
Chapter 4 o Variables and Literals
76
not contain a decimal point. All the following expressions are
integers:
45 - 932 0 12 5421
Floating-point numbers contain decimal points. They are known
as real numbers to mathematicians. Any time you have to store a
salary, a temperature, or any other number that might have a
fractional part (a decimal portion), you must store it in a floating-
point variable. All the following expressions are floating-point
numbers, and any floating-point variable can hold them:
45. 12 - 2344. 5432 0. 00 . 04594
Sometimes you have to keep track of large numbers, and
sometimes you have to keep track of smaller numbers. Table 4.2
shows a list of ranges that each C++ variable type can hold.
CAUTION: All true AT&T C++ programmers know that
they cannot count on using the exact values in Table 4.2 on
every computer that uses C++. These ranges are typical on a
PC, but might be much different on another computer. Use this
table only as a guide.
Table 4.2. Typic al ranges that C++ variables hold.
Type Range*
char 128 to 127
unsi gned char 0 to 255
si gned char 128 to 127
i nt 32768 to 32767
unsi gned i nt 0 to 65535
si gned i nt 32768 to 32767
shor t i nt 32768 to 32767
unsi gned shor t i nt 0 to 65535
77
EXAMPLE
C+ + By
si gned shor t i nt 32768 to 32767
l ong i nt 2147483648 to 2147483647
si gned l ong i nt 2147483648 to 2147483647
f l oat 3.4E38 to 3.4E+38
doubl e 1.7E308 to 1.7E+308
l ong doubl e 3.4E4932 to 1.1E+4932
* Use this table only as a guide; different compilers and different computers can have different
ranges.
NOTE: The floating-point ranges in Table 4.2 are shown in
scientific notation. To determine the actual range, take the
number before the E (meaning Exponent) and multiply it by
10 raised to the power after the plus sign. For instance, a
floating-point number (type f l oat ) can contain a number as
small as 3.4
38
.
Notice that long integers and long doubles tend to hold larger
numbers (and therefore, have a higher precision) than regular
integers and regular double floating-point variables. This is due to
the larger number of memory locations used by many of the C++
compilers for these data types. Again, this is usuallybut not
alwaysthe case.
Do Not Over Type a Variable
If the long variable types hold larger numbers than the regular
ones, you might initially want to use long variables for all your
data. This would not be required in most cases, and would
probably slow your programs execution.
Type Range*
Chapter 4 o Variables and Literals
78
As Appendix A, Memory Addressing, Binary, and Hexadeci-
mal Review, describes, the more memory locations used by
data, the larger that data can be. However, every time your
computer has to access more storage for a single variable (as is
usually the case for long variables), it takes the CPU much
longer to access it, calculate with it, and store it.
Use the long variables only if you suspect your data might
overflow the typical data type ranges. Although the ranges
differ between computers, you should have an idea of whether
you numbers might exceed the computers storage ranges.
If you are working with extremely large (or extremely small
and fractional) numbers, you should consider using the long
variables.
Generally, all numeric variables should be signed (the default)
unless you know for certain that your data contain only positive
numbers. (Some values, such as age and distances, are always
positive.) By making a variable an unsigned variable, you gain a
little extra storage range (as explained in Appendix A, Memory
Addressing, Binary, and Hexadecimal Review). That range of
values must always be positive, however.
Obviously, you must be aware of what kinds of data your
variables hold. You certainly do not always know exactly what each
variable is holding, but you can have a general idea. For example, in
storing a persons age, you should realize that a long integer variable
would be a waste of space, because nobody can live to an age that
cant be stored by a regular integer.
At first, it might seem strange for Table 4.2 to state that
character variables can hold numeric values. In C++, integers and
character variables frequently can be used interchangeably. As
explained in Appendix A, Memory Addressing, Binary, and Hexa-
decimal Review, each ASCII table character has a unique number
that corresponds to its location in the table. If you store a number in
a character variable, C++ treats the data as if it were the ASCII
character that matched that number in the table. Conversely, you
can store character data in an integer variable. C++ finds that
79
EXAMPLE
C+ + By
characters ASCII number, and stores that number rather than the
character. Examples that help illustrate this appear later in the
chapter.
Designating Long, Unsigned, and Floating-Point Literals
When you type a number, C++ interprets its type as the
smallest type that can hold that number. For example, if you
print 63, C++ knows that this number fits into a signed integer
memory location. It does not treat the number as a long integer,
because 63 is not large enough to warrant a long integer literal
size.
However, you can append a suffix character to numeric literals
to override the default type. If you put an L at the end of an
integer, C++ interprets that integer as a long integer. The
number 63 is an integer literal, but the number 63L is a long
integer literal.
Assign the U suffix to designate an unsigned integer literal. The
number 63 is, by default, a signed integer literal. If you type 63U,
C++ treats it as an unsigned integer. The suffix UL indicates an
unsigned long literal.
C++ interprets all floating-point literals (numbers that contain
decimal points) as double floating-point literals (double float-
ing-point literals hold larger numbers than floating-point liter-
als). This process ensures the maximum accuracy in such
numbers. If you use the literal 6. 82, C++ treats it as a double
floating-point data type, even though it would fit in a regular
f l oat . You can append the floating-point suffix (F) or the long
double floating-point suffix (L) to literals that contain decimal
points to represent a floating-point literal or a long double
floating-point literal.
You may rarely use these suffixes, but if you have to assign a
literal value to an extended or unsigned variable, your literals
might be a little more accurate if you add U, L, UL, or F (their
lowercase equivalents work too) to their ends.
Chapter 4 o Variables and Literals
80
Assigning Values to Variable s
Now that you know about the C++ variable types, you are
ready to learn the specifics of assigning values to those variables.
You do this with the assignment statement. The equal sign (=) is used
for assigning values to variables. The format of the assignment
statement is
var i abl e=expr essi on;
The var i abl e is any variable that you declared earlier. The
expr essi on is any variable, literal, expression, or combination that
produces a resulting data type that is the same as the var i abl es data
type.
TIP: Think of the equal sign as a left-pointing arrow. Loosely,
the equal sign means you want to take the number, variable, or
expression on the right side of the equal sign and put it into the
variable on the left side of the equal sign.
Examples
1. If you want to keep track of your current age, salary, and
dependents, you could store these values in three C++
variables. You first declare the variables by deciding on
correct types and good names for them. You then assign
values to them. Later in the program, these values might
change (for example, if the program calculates a new pay
increase for you).
Good variable names include age, sal ar y, and dependent s.
To declare these three variables, the first part of the mai n( )
function would look like this:
/ / Decl ar e and st or e t hr ee val ues.
mai n( )
{
i nt age;
f l oat sal ar y;
i nt dependent s;
81
EXAMPLE
C+ + By
Notice that you do not have to declare all integer variables
together. The next three statements assign values to the
variables.
age=32;
sal ar y=25000. 00;
dependent s=2;
/ / Rest of pr ogr amf ol l ows.
This example is not very long and doesnt do much, but it
illustrates the using and assigning of values to variables.
2. Do not put commas in values that you assign to variables.
Numeric literals should never contain commas. The follow-
ing statement is invalid:
sal ar y=25, 000. 00;
3. You can assign variables or mathematical expressions to
other variables. Suppose, earlier in a program, you stored
your tax rate in a variable called t ax_r at e, then decided to
use your tax rate for your spouses rate as well. At the
proper point in the program, you would code the following:
spouse_t ax_r at e = t ax_r at e;
(Adding spaces around the equal sign is acceptable to the
C++ compiler, but you do not have to do so.) At this point in
the program, the value in t ax_r at e is copied to a new variable
named spouse_t ax_r at e. The value in t ax_r at e is still there
after this line finishes. The variables were declared earlier in
the program.
If your spouses tax rate is 40 percent of yours, you can
assign an expression to the spouses variable, as in:
spouse_t ax_r at e = t ax_r at e * . 40;
Any of the four mathematical symbols you learned in the
previous chapter, as well as the additional ones you learn
later in the book, can be part of the expression you assign to
a variable.
Chapter 4 o Variables and Literals
82
4. If you want to assign character data to a character variable,
you must enclose the character in single quotation marks.
All C++ character literals must be enclosed in single quota-
tion marks.
The following section of a program declares three variables,
then assigns three initials to them. The initials are character
literals because they are enclosed in single quotation marks.
mai n( )
{
char f i r st , mi ddl e, l ast ;
f i r st = G ;
mi ddl e = M ;
l ast = P ;
/ / Rest of pr ogr amf ol l ows.
Because these are variables, you can reassign their values
later if the program warrants it.
CAUTION: Do not mix types. C enables programmers to do
this, but C++ does not. For instance, in the mi ddl e variable
presented in the previous example, you could not have stored
a floating-point literal:
mi ddl e = 345. 43244; / / You cannot do t hi s!
If you did so, mi ddl e would hold a strange value that would
seem to be meaningless. Make sure that values you assign to
variables match the variables type. The only major exception
to this occurs when you assign an integer to a character vari-
able, or a character to an integer variable, as you learn shortly.
Literals
As with variables, there are several types of C++ literals.
Remember that a literal does not change. Integer literals are whole
numbers that do not contain decimal points. Floating-point literals
83
EXAMPLE
C+ + By
are numbers that contain a fractional portion (a decimal point with
an optional value to the right of the decimal point).
Assigning Integer Literals
You already know that an integer is any whole number without
a decimal point. C++ enables you to assign integer literals to vari-
ables, use integer literals for calculations, and print integer literals
using the cout operator.
A regular integer literal cannot begin with a leading 0. To C++,
the number 012 is not the number twelve. If you precede an integer
literal with a 0, C++ interprets it as an octal literal. An octal literal is
a base-8 number. The octal numbering system is not used much in
todays computer systems. The newer versions of C++ retain octal
capabilities for compatibility with previous versions.
A special integer in C++ that is still greatly used today is the
base-16, or hexadecimal, literal. Appendix A, Memory Addressing,
Binary, and Hexadecimal Review, describes the hexadecimal num-
bering system. If you want to represent a hexadecimal integer literal,
add the 0x prefix to it. The following numbers are hexadecimal
numbers:
0x10 0x2C4 0xFFFF 0X9
Notice that it does not matter if you use a lowercase or upper-
case letter x after the leading zero, or an uppercase or lowercase
hexadecimal digit (for hex numbers A through F). If you write
business-application programs in C++, you might think you never
have the need for using hexadecimal, and you might be correct. For
a complete understanding of C++ and your computer in general,
however, you should become a little familiar with the fundamentals
of hexadecimal numbers.
Table 4.3 shows a few integer literals represented in their
regular decimal, hexadecimal, and octal notations. Each row con-
tains the same number in all three bases.
An octal i nteger l i ter-
al contai ns a l eadi ng
0, and a hexadeci -
mal l i teral contai ns a
l eadi ng 0x.
Chapter 4 o Variables and Literals
84
Table 4.3. Integer literals represented in three
bases.
Decimal Hexadecimal Octal
(Base 10) (Base 16) (Base 8)
16 0x10 020
65536 0x10000 0100000
25 0x19 031
NOTE: Floating-point literals can begin with a leading zero,
for example, 0.7. They are properly interpreted by C++. Only
integers can be hexadecimal or octal literals.
Your Computers Word Size Is Important
If you write many system programs that use hexadecimal
numbers, you probably want to store those numbers in un-
signed variables. This keeps C++ from improperly interpreting
positive numbers as negative numbers.
For example, if your computer stores integers in 2-byte words
(as most PCs do), the hexadecimal literal 0xFFFF represents
either 1 or 65535, depending on how the sign bit is interpreted.
If you declared an unsigned integer, such as
unsi gned_i nt i _num= 0xFFFF;
C++ knows you want it to use the sign bit as data and not as the
sign. If you declared the same value as a signed integer,
however, as in
i nt i _num= 0xFFFF; / * The wor d si gned i s opt i onal . */
C++ thinks this is a negative number (1) because the sign bit
is on. (If you were to convert 0xFFFF to binary, you would get
sixteen 1s.) Appendix A, Memory Addressing, Binary, and
Hexadecimal Review, discusses these concepts in more detail.
85
EXAMPLE
C+ + By
Assigning String Literals
One type of C++ literal, called the string literal, does not have a
matching variable. A string literal is always enclosed in double
quotation marks. Here are examples of string literals:
C++ Pr ogr ammi ng 123 4323 E. Oak Road x
Any string of characters between double quotation marks
even a single characteris considered to be a string literal. A single
space, a word, or a group of words between double quotation marks
are all C++ string literals.
If the string literal contains only numeric digits, it is not a
number; it is a string of numeric digits that you cannot use to
perform mathematics. You can perform math only on numbers, not
on string literals.
NOTE: A string literal is any character, digit, or group of
characters enclosed in double quotation marks. A character
literal is any character enclosed in single quotation marks.
The double quotation marks are never considered part of the
string literal. The double quotation marks surround the string and
simply inform your C++ compiler that the code is a string literal and
not another type of literal.
It is easy to print string literals. Simply put the string literals in
a cout statement. The following code prints a string literal to the
screen:
The following code prints the string literal, C++ By Exampl e.
cout << C++ By Exampl e;
Examples
1. The following program displays a simple message on-screen.
No variables are needed because no datum is stored or
calculated.
A stri ng l i teral i s
al ways encl osed i n
doubl e quotati on
marks.
Chapter 4 o Variables and Literals
86
/ / Fi l ename: C4ST1. CPP
/ / Di spl ay a st r i ng on- scr een.
#i ncl ude <i ost r eam. h>
mai n( )
{
cout << C++ pr ogr ammi ng i s f un! ;
r et ur n 0;
}
Remember to make the last line in your C++ program (be-
fore the closing brace) a r et ur n statement.
2. You probably want to label the output from your programs.
Do not print the value of a variable unless you also print a
string literal that describes that variable. The following
program computes sales tax for a sale and prints the tax.
Notice a message is printed first that tells the user what the
next number means.
/ / Fi l ename: C4ST2. CPP
/ / Comput e sal es t ax and di spl ay i t wi t h an appr opr i at e
message.
#i ncl ude <i ost r eam. h>
mai n( )
{
f l oat sal e, t ax;
f l oat t ax_r at e = . 08; / / Sal es t ax per cent age
/ / Det er mi ne t he amount of t he sal e.
sal e = 22. 54;
/ / Comput e t he sal es t ax.
t ax = sal e * t ax_r at e;
/ / Pr i nt t he r esul t s.
cout << The sal es t ax i s << t ax << \ n;
r et ur n 0;
}
87
EXAMPLE
C+ + By
Here is the output from the program:
The sal es t ax i s 1. 8032
You later learn how to print accurately to two decimal places
to make the cents appear properly.
String-Literal Endings
An additional aspect of string literals sometimes confuses
beginning C++ programmers. All string literals end with a zero. You
do not see the zero, but C++ stores the zero at the end of the string
in memory. Figure 4.1 shows what the string C++ Pr ogr am looks like
in memory.
Figure 4.1. In memory, a string literal always ends with 0.
You do not have to worry about putting the zero at the end of
a string literal; C++ does it for you every time it stores a string. If your
program contained the string C++ Pr ogr am, for example, the com-
piler would recognize it as a string literal (from the double quotation
marks) and store the zero at the end.
Null zero
Chapter 4 o Variables and Literals
88
The zero is important to C++. It is called the string delimiter.
Without it, C++ would not know where the string literal ended in
memory. (Remember that the double quotation marks are not stored
as part of the string, so C++ cannot use them to determine where the
string ends.)
The string-delimiting zero is not the same as the character zero.
If you look at the ASCII table in Appendix C, ASCII Table, you can
see that the first entry, ASCII number 0, is the null character. (If you
are unfamiliar with the ASCII table, you should read Appendix A,
Memory Addressing, Binary, and Hexadecimal Review, for a
brief description.) This string-delimiting zero is different from the
from the character 0 , which has an ASCII value of 48.
As explained in Appendix A, Memory Addressing, Binary,
and Hexadecimal Review, all memory locations in your computer
actually hold bit patterns for characters. If the letter A is stored in
memory, an A is not actually there; the binary bit pattern for the
ASCII A (01000001) is stored there. Because the binary bit pattern for
the null zero is 00000000, the string-delimiting zero is also called a
binary zero.
To illustrate this further, Figure 4.2 shows the bit patterns for
the following string literal when stored in memory: I am30.
Al l stri ng l i teral s end
i n a nul l zero (al so
cal l ed bi nary zero or
ASCII zero).
String-terminating zero
Figure 4.2. The bit pattern showing that a null zero and a character zero
are different.
Figure 4.2 shows how a string is stored in your computers
memory at the binary level. It is important for you to recognize that
the character 0, inside the number 30, is not the same zero (at the bit
level) as the string-terminating null zero. If it were, C++ would think
this string ended after the 3, which would be incorrect.
89
EXAMPLE
C+ + By
This is a fairly advanced concept, but you truly have to under-
stand it before continuing. If you are new to computers, reviewing
the material in Appendix A, Memory Addressing, Binary, and
Hexadecimal Review, will help you understand this concept.
String Lengths
Many times, your program has to know the length of a string.
This becomes critical when you learn how to accept string input
from the keyboard. The length of a string is the number of characters
up to, but not including, the delimiting null zero. Do not include the
null character in that count, even though you know C++ adds it to
the end of the string.
Examples
1. The following are all string literals:
0 C A much l onger st r i ng l i t er al
2. The following table shows some string literals and their
corresponding string lengths.
String Length
C 1
0" 21
Hel l o 5
0
30 or anges 10
Assigning Charac ter Literals
All C character literals should be enclosed in single quotation
marks. The single quotation marks are not part of the character, but
they serve to delimit the character. The following are valid C++
character literals:
w W C 7 * = . K
The l ength of a
stri ng l i teral does
not i ncl ude the nul l
bi nary zero.
Chapter 4 o Variables and Literals
90
C++ does not append a null zero to the end of character literals.
You should know that the following are different to C++.
R and R
R is a single character literal. It is one character long, because
all character literals (and variables) are one character long. R is a
string literal because it is delimited by double quotation marks. Its
length is also one, but it includes a null zero in memory so C++
knows where the string ends. Due to this difference, you cannot mix
character literals and character strings. Figure 4.3 shows how these
two literals are stored in memory.
Figure 4.3. The difference in memory between R as a character
literal and R as a string literal.
All the alphabetic, numeric, and special characters on your
keyboard can be character literals. Some characters, however, can-
not be represented with your keyboard. They include some of
the higher ASCII characters (such as the Spanish ). Because you do
not have keys for every character in the ASCII table, C++ enables you
to represent these characters by typing their ASCII hexadecimal
number inside single quotation marks.
For example, to store the Spanish in a variable, look up its
hexadecimal ASCII number from Appendix C, ASCII Table. You
find that it is A5. Add the prefix \ x to it and enclose it in single
quotation marks, so C++ will know to use the special character. You
could do that with the following code:
char sn= \ xA5' ; / / Put s t he Spani sh i nt o a var i abl e cal l ed sn.
91
EXAMPLE
C+ + By
This is the way to store (or print) any character from the ASCII table,
even if that character does not have a key on your keyboard.
The single quotation marks still tell C++ that a single character
is inside the quotation marks. Even though \ xA5 contains four
characters inside the quotation marks, those four characters repre-
sent a single character, not a character string. If you were to include
those four characters inside a string literal, C++ would treat \ xA5 as
a single character in the string. The following string literal,
An accent ed a i s \ xA0
is a C++ string that is 18 characters, not 21 characters. C++ interprets
the \ xA0 character as the , just as it should.
CAUTION: If you are familiar with entering ASCII charac-
ters by typing their ASCII numbers with the Alt-keypad com-
bination, do not do this in your C++ programs. They might
work on your computer (not all C++ compilers support this),
but your program might not be portable to another computers
C++ compiler.
Any character preceded by a backslash, \ , (such as these have
been) is called an escape sequence, or escape character. Table 4.4 shows
some additional escape sequences that come in handy when you
want to print special characters.
TIP: Include \ n i n a cout if you want to skip to the next
line when printing your document.
Table 4.4. Spec ial C++ esc ape-sequenc e
c harac ters.
Escape Sequence Meaning
\ a Alarm (the terminals bell)
\ b Backspace
\ f Form feed (for the printer)
continues
Chapter 4 o Variables and Literals
92
\ n Newline (carriage return and line feed)
\ r Carriage return
\ t Tab
\ v Vertical tab
\ \ Backslash (\ )
\ ? Question mark
\ Single quotation mark
\ Double quotation mark
\ 000 Octal number
\ xhh Hexadecimal number
\ 0 Null zero (or binary zero)
Math with C++ Characters
Because C++ links characters so closely with their ASCII num-
bers, you can perform arithmetic on character data. The follow-
ing section of code,
char c;
c = T + 5; / / Add f i ve t o t he ASCI I char act er .
actually stores a Y in c. The ASCII value of the letter T is 84.
Adding 5 to 84 produces 89. Because the variable c is not an
integer variable, but is a character variable, C++ adds the ASCII
character for 89, not the actual number.
Conversely, you can store character literals in integer variables.
If you do, C++ stores the matching ASCII number for that
character. The following section of code
i nt i = P ;
Table 4.4. Continued.
Escape Sequence Meaning
93
EXAMPLE
C+ + By
does not put a letter P in i because i is not a character variable.
C++ assigns the number 80 in the variable because 80 is the
ASCII number for the letter P.
Examples
1. To print two names on two different lines, include the \ n
between them.
Print the name Har r y; drop the cursor down to a new line and
print Jer r y.
cout << Har r y\ nJ er r y;
When the program reaches this line, it prints
Har r y
J er r y
You also could separate the two names by appending more
of the cout operator, such as:
cout << Har r y << \ n << J er r y;
Because the \ n only takes one byte of storage, you can output
it as a character literal by typing \ n in place of the preced-
ing \ n.
2. The following short program rings the bell on your com-
puter by assigning the \ a escape sequence to a variable, then
printing that variable.
/ / Fi l ename: C4BELL. CPP
/ / Ri ngs t he bel l
#i ncl ude <i ost r eam. h>
mai n( )
{
char bel l = \ a ;
cout << bel l ; / / No newl i ne needed her e.
r et ur n 0;
}
Chapter 4 o Variables and Literals
94
Constant Variables
The term constant variable might seem like a contradiction. After
all, a constant never changes and a variable holds values that
change. In C++ terminology, you can declare variables to be con-
stants with the const keyword. Throughout your program, the
constants act like variables; you can use a constant variable any-
where you can use a variable, but you cannot change constant
variables. To declare a constant, put the keyword const in front of the
variable declaration, for instance:
const i nt days_of _week = 7;
C++ offers the const keyword as an improvement of the #def i ne
preprocessor directive that C uses. Although C++ supports #def i ne
as well, const enables you to specify constant values with specific
data types.
The const keyword is appropriate when you have data that
does not change. For example, the mathematical is a good candi-
date for a constant. If you accidently attempt to store a value in a
constant, C++ will let you know. Most C++ programmers choose to
type their constant names in uppercase characters to distinguish
them from regular variables. This is the one time when uppercase
reigns in C++.
NOTE: This book reserves the name constant for C++ pro-
gram constants declared with the const keyword. The term
literal is used for numeric, character, and string data values.
Some books choose to use the terms constant and literal inter-
changeably, but in C++, the difference can be critical.
Example
Suppose a teacher wanted to compute the area of a circle for the
class. To do so, the teacher needs the value of (mathematically,
is approximately 3.14159). Because remains constant, it is a good
candidate for a const keyword, as the following program shows:
95
EXAMPLE
C+ + By
Comment for the program filename and description.
Declare a constant value for .
Declare variables for radius and area.
Compute and print the area for both radius values.
/ / Fi l ename: C4AREAC. CPP
/ / Comput es a ci r cl e wi t h r adi us of 5 and 20.
#i ncl ude <i ost r eam. h>
mai n( )
{
const f l oat PI =3. 14159;
f l oat r adi us = 5;
f l oat ar ea;
ar ea = r adi us * r adi us * PI ; / / Ci r cl e ar ea cal cul at i on
cout << The ar ea i s << ar ea << wi t h a r adi us of 5. \ n;
r adi us = 20; / / Comput e ar ea wi t h new r adi us.
ar ea = r adi us * r adi us * PI ;
cout << The ar ea i s << ar ea << wi t h a r adi us of 20. \ n;
r et ur n 0;
}
Review Questions
The answers to the review questions are in Appendix B.
1. Which of the following variable names are valid?
my_name 89_sal es sal es_89 a- sal ar y
2. Which of the following literals are characters, strings, inte-
gers, and floating-point literals?
0 - 12. 0 2. 0 X X 65. 4 - 708 0
Chapter 4 o Variables and Literals
96
3. How many variables do the following statements declare,
and what are their types?
i nt i , j , k;
char c, d, e;
f l oat x=65. 43;
4. With what do all string literals end?
5. True or false: An unsigned variable can hold a larger value
than a signed variable.
6. How many characters of storage does the following literal
take?
\ x41
7. How is the following string stored at the bit level?
Or der 10 of t hem.
8. How is the following string (called a null string) stored at the
bit level? (Hint: The length is zero, but there is still a termi-
nating character.)

9. What is wrong with the following program?

#i ncl ude <i ost r eam. h>
mai n( )
{
const i nt age=35;
cout << age << \ n;
age = 52;
cout << age << \ n;
r et ur n 0;
}
97
EXAMPLE
C+ + By
Review Exerc ises
Now that you have learned some basic C++ concepts, the
remainder of the book will include this section of review exercises so
you can practice your programming skills.
1. Write the C++ code to store three variables: your weight
(you can fib), height in feet, and shoe size. Declare the
variables, then assign their values in the body of your
program.
2. Rewrite your program from Exercise 1, adding proper cout
statements to print the values to the screen. Use appropriate
messages (by printing string literals) to describe the numbers
that are printed.
3. Write a program that stores a value and prints each type of
variable you learned in this chapter.
4. Write a program that stores a value into every type of vari-
able C++ allows. You must declare each variable at the
beginning of your program. Give them values and print
them.
Summary
A firm grasp of C++s fundamentals is critical to a better
understanding of the more detailed material that follows. This is one
of the last general-topic chapters in the book. You learned about
variable types, literal types, how to name variables, how to assign
variable values, and how to declare constants. These issues are
critical to understanding the remaining concepts in C++.
This chapter taught you how to store almost every type of
literal into variables. There is no string variable, so you cannot store
string literals in string variables (as you can in other programming
languages). However, you can fool C++ into thinking it has a string
variable by using a character array to hold strings. You learn this
important concept in the next chapter.
Chapter 4 o Variables and Literals
98
113
EXAMPLE
C+ + By
6
Preproc essor
Direc tives
As you might recall from Chapter 2, What Is a Program?, the C++
compiler routes your programs through a preprocessor before it
compiles them. The preprocessor can be called a pre-compiler
because it preprocesses and prepares your source code for compil-
ing before your compiler receives it.
Because this preprocess is so important to C++, you should
familiarize yourself with it before learning more specialized com-
mands in the language. Regular C++ commands do not affect the
preprocessor. You must supply special non-C++ commands, called
preprocessor directives, to control the preprocessor. These directives
enable you, for example, to modify your source code before the code
reaches the compiler. To teach you about the C++ preprocessor, this
chapter
o Defines preprocessor directives
o Introduces the #i ncl ude preprocessor directive
o Introduces the #def i ne preprocessor directive
o Provides examples of both
Chapter 6 o Preprocessor D irectives
114
Almost every proper C++ program contains preprocessor di-
rectives. This chapter teaches you the two most common: #i ncl ude
and #def i ne.
Understanding Preproc essor
Direc tives
Preprocessor directives are commands that you supply to the
preprocessor. All preprocessor directives begin with a pound sign
(#). Never put a semicolon at the end of preprocessor directives,
because they are preprocessor commands and not C++ commands.
Preprocessor directives typically begin in the first column of your
source program. They can begin in any column, of course, but you
should try to be consistent with the standard practice and start them
in the first column wherever they appear. Figure 6.1 illustrates a
program that contains three preprocessor directives.
/ / Fi l ename: C6PRE. CPP
/ / C++ pr ogr amt hat demonst r at es pr epr ocessor di r ect i ves.
#i ncl ude <i ost r eam. h>
#def i ne AGE 28
#def i ne MESSAGE Hel l o, wor l d
mai n( )
{
i nt i = 10, age; / / i i s assi gned a val ue at decl ar at i on
/ / age i s st i l l UNDEFI NED
age = 5; / / Def i nes t he var i abl e, age, as f i ve.
i = i * AGE; / / AGE i s not t he same as t he var i abl e, age.
cout << i << << age << << AGE << \ n; / / 280 5 28
cout << MESSAGE; / / Pr i nt s Hel l o wor l d.
r et ur n 0;
}
Figure 6.1. Program containing three preprocessor directives.
Preprocessor
directives
115
EXAMPLE
C+ + By
Preprocessor directives cause your C++ preprocessor to change
your source code, but these changes last only as long as the compi-
lation. When you look at your source code again, the preprocessor
is finished with your file and its changes are no longer in the file.
Your preprocessor does not in any way compile your program or
change your actual C++ commands. This concept confuses some
beginning C++ students, but just remember that your program has
yet to be compiled when your preprocessor directives execute.
It has been said that a preprocessor is nothing more than a text-
editor on your program. This analogy holds true throughout this
chapter.
The #i ncl ude Direc tive
The #i ncl ude preprocessor directive merges a disk file into your
source program. Remember that a preprocessor directive does
nothing more than a word processing command does to your
program; word processors also are capable of file merging. The
format of the #i ncl ude preprocessor directive follows:
#i ncl ude <f i l ename>
or
#i ncl ude f i l ename
In the #i ncl ude directive, the f i l ename must be an ASCII text file
(as your source file must be) located somewhere on a disk. To better
illustrate this rule, it might help to leave C++ for just a moment. The
following example shows the contents of two files on disk. One is
called OUTSIDE and the other is called INSIDE.
These are the contents of the OUTSIDE file:
Now i s t he t i me f or al l good men
#i ncl ude <I NSI DE>
t o come t o t he ai d of t hei r count r y.
Preprocessor
di recti ves
temporari l y change
your source code.
Chapter 6 o Preprocessor D irectives
116
The INSIDE file contains the following:
A qui ck br own f ox j umped
over t he l azy dog.
Assume you can run the OUTSIDE file through the C++
preprocessor, which finds the #i ncl ude directive and replaces it with
the entire file called INSIDE. In other words, the C++ preprocessor
directive merges the INSIDE file into the OUTSIDE fileat the
#i ncl ude locationand OUTSIDE expands to include the merged
text. After the preprocessing ends, OUTSIDE looks like this:
Now i s t he t i me f or al l good men
A qui ck br own f ox j umped
over t he l azy dog.
t o come t o t he ai d of t hei r count r y.
The INSIDE file remains on disk in its original form. Only the
file containing the #i ncl ude directive is changed. This change is only
temporary; that is, OUTSIDE is expanded by the included file only
for as long as it takes to compile the program.
A few real-life examples might help, because the OUTSIDE and
INSIDE files are not C++ programs. You might want to include a file
containing common code that you frequently use. Suppose you
print your name and address quite often. You can type the following
few lines of code in every program that prints your name and
address:
cout << Kel l y J ane Pet er son\ n;
cout << Apar t ment #217\ n;
cout << 4323 East Skel l y Dr i ve\ n;
cout << New Yor k, New Yor k\ n;
cout << 10012\ n;
Instead of having to retype the same five lines again and again,
you type them once and save them in a file called MYADD.C. From
then on, you only have to type the single line:
#i ncl ude <myadd. c>
117
EXAMPLE
C+ + By
This not only saves typing, but it also maintains consistency
and accuracy. (Sometimes this kind of repeated text is known as a
boilerplate.)
You usually can use angled brackets, <>, or double quotation
marks, , around the included filename with the same results. The
angled brackets tell the preprocessor to look for the include file in a
default include directory, set up by your compiler. The double
quotation marks tell the preprocessor first to look for the include file
in the directory where the source code is stored, and then, to look for
it in the systems include directory.
Most of the time, you do see angled brackets around the
included filename. If you want to include sections of code in other
programs, be sure to store that code in the systems include directory
(if you use angled brackets).
Even though #i ncl ude works well for inserted source code,
there are other ways to include common source code that are more
efficient. You learn about one technique, called writing external
functions, in Chapter 16, Writing C++ Functions.
This source code #i ncl ude example serves well to explain what
the #i ncl ude preprocessor directive does. Despite this fact, #i ncl ude
seldom is used to include source code text, but is more often used to
include special system files called header files. These system files
help C++ interpret the many built-in functions that you use. Your
C++ compiler comes with its own header files. When you (or your
system administrator) installed your C++ compiler, these header
files were automatically stored on your hard drive in the systems
include directory. Their filenames always end in .h to differentiate
them from regular C++ source code.
The most common header file is named iostream.h. This file
gives your C++ compiler needed information about the built-in cout
and ci n operators, as well as other useful built-in routines that
perform input and output. The name iostream.h stands for input/
output stream header.
At this point, you dont have to understand the iostream.h file.
You only have to place this file before mai n( ) in every program you
write. It is rare that a C++ program does not need the iostream.h file.
Even when the file is not needed, including it does no harm. Your
programs can work without iostream.h as long as they do not use
The #i ncl ude
di recti ve i s most
often used for
system header fi l es.
Chapter 6 o Preprocessor D irectives
118
an input or output operator defined there. Nevertheless, your
programs are more accurate and hidden errors come to the surface
much faster if you include this file.
Throughout this book, whenever a new built-in function is
described, the functions matching header file is included. Because
almost every C++ program you write includes a cout to print to the
screen, almost every program contains the following line:
Include the built-in C++ header file called iostream.h.
#i ncl ude <i ost r eam. h>
In the last chapter, you saw the st r cpy( ) function. Its header file
is called string.h. Therefore, if you write a program that contains
st r cpy( ) , include its matching header file at the same time you
include <i ost r eam. h>. These appear on separate lines, such as:
#i ncl ude <i ost r eam. h>
#i ncl ude <st r i ng. h>
The order of your include files does not matter as long as you
include the files before the functions that need them. Most C++
programmers include all their needed header files before mai n( ) .
These header files are simply text files. If you like, find a header
file such as stdio.h on your hard drive and look at it. The file might
seem complex at this point, but there is nothing hidden about it.
Dont change the header file in any way while looking at it. If you do,
you might have to reload your compiler to restore the file.
Examples
1. The following program is short. It includes the name-and-
address printing routine described earlier. After printing the
name and address, it ends.
/ / Fi l ename: C6I NC1. CPP
/ / I l l ust r at es t he #i ncl ude pr epr ocessor di r ect i ves.
#i ncl ude <i ost r eam. h>
119
EXAMPLE
C+ + By
mai n( )
{
#i ncl ude myadd. c
r et ur n 0;
}
The double quotation marks are used because the file called
MYADD.C is stored in the same directory as the source file.
Remember that if you type this program into your computer
(after typing and saving the MYADD.C file) and then com-
pile your program, the MYADD.C file is included only as
long as it takes to compile the program. Your compiler does
not see this file. Your compiler acts as if you have typed the
following:
/ / Fi l ename: C6I NCL1. CPP
/ / I l l ust r at es t he #i ncl ude pr epr ocessor di r ect i ve.
#i ncl ude <i ost r eam. h>
mai n( )
{
cout ( Kel l y J ane Pet er son\ n;
cout ( Apar t ment #217\ n;
cout ( 4323 East Skel l y Dr i ve\ n;
cout ( New Yor k, New Yor k\ n;
cout ( 10012\ n;
r et ur n 0;
}
This explains what is meant by a preprocessor: The changes
are made to your source code before its compiled. Your
original source code is restored as soon as the compile is
finished. When you look at your program again, it appears
as originally typed, with the #i ncl ude statement.
2. The following program copies a message into a character
array and prints it to the screen. Because the cout and
st r cpy( ) built-in functions are used, both of their header files
are included.
Chapter 6 o Preprocessor D irectives
120
The #def i ne
di recti ve repl aces
every occurrence of
a fi rst argument wi th
a second argument.
/ / Fi l ename: C6I NCL3. CPP
/ / Uses t wo header f i l es.
#i ncl ude <i ost r eam. h>
#i ncl ude <st r i ng. h>
mai n( )
{
char message[ 20] ;
st r cpy( message, Thi s i s f un! ) ;
cout << message;
r et ur n 0;
}
The #def i ne Direc tive
The #def i ne preprocessor directive is used in C++ program-
ming, although not nearly as frequently as it is in C. Due to the
const keyword (in C++) that enables you to define variables as
constants, #def i ne is not used as much in C++. Nevertheless, #def i ne
is useful for compatibility to C programs you are converting to C++.
The #def i ne directive might seem strange at first, but it is similar to
a search-and-replace command on a word processor. The format of
#def i ne follows:
#def i ne ARGUMENT1 ar gument 2
where ARGUMENT1 is a single word containing no spaces. Use the same
naming rules for the #def i ne statements first argument as for vari-
ables (see Chapter 4, Variables and Literals). For the first argu-
ment, it is traditional to use uppercase lettersone of the only uses
of uppercase in the entire C++ language. At least one space separates
ARGUMENT1 from ar gument 2. The ar gument 2 can be any character, word,
or phrase; it also can contain spaces or anything else you can type on
the keyboard. Because #def i ne is a preprocessor directive and not a
C++ command, do not put a semicolon at the end of its expression.
The #def i ne preprocessor directive replaces the occurrence
of ARGUMENT1 everywhere in your program with the contents of
121
EXAMPLE
C+ + By
ar gument 2. In most cases, the #def i ne directive should go before mai n( )
(along with any #i ncl ude directives). Look at the following #def i ne
directive:
Define the AGELI MI T literal to 21.
#def i ne AGELI MI T 21
If your program includes one or more occurrences of the term
AGELI MI T, the preprocessor replaces every one of them with the
number 21. The compiler then reacts as if you actually had typed 21
rather than AGELI MI T, because the preprocessor changes all occur-
rences of AGELI MI T to 21 before your compiler reads the source code.
But, again, the change is only temporary. After your program is
compiled, you see it as you originally typed it, with #def i ne and
AGELI MI T still intact.
AGELI MI T is not a variable, because variables are declared and
assigned values only at the time when your program is compiled
and run. The preprocessor changes your source file before the time
it is compiled.
You might wonder why you would ever have to go to this much
trouble. If you want 21 everywhere AGELI MI T occurs, you could type
21 to begin with! But the advantage of using #def i ne rather than
literals is that if the age limit ever changes (perhaps to 18), you have
to change only one line in the program, not every single occurrence
of the literal 21.
Because #def i ne enables you easily to define and change liter-
als, the replaced arguments of the #def i ne directive are sometimes
called defined literals. (C programmers say that #def i ne defines
constants, but C++ programmers rarely use the word constant
unless they are discussing the use of const .) You can define any type
of literal, including string literals. The following program contains
a defined string literal that replaces a string in two places.
/ / Fi l ename: C6DEF1. CPP
/ / Def i nes a st r i ng l i t er al and uses i t t wi ce.
#i ncl ude <i ost r eam. h>
#def i ne MYNAME Phi l War d
mai n( )
The #def i ne
di recti ve creates
defi ned l i teral s.
Chapter 6 o Preprocessor D irectives
122
{
char name[ ] =MYNAME;
cout << My name i s << name << \ n; / / Pr i nt s t he ar r ay.
cout << My name i s << MYNAME << \ n; / / Pr i nt s t he
/ / def i ned l i t er al .
r et ur n 0;
}
The first argument of #def i ne is in uppercase to distinguish it
from variable names in the program. Variables are usually typed in
lowercase. Although your preprocessor and compiler will not con-
fuse the two, other users who look at your program can more quickly
scan through and tell which items are defined literals and which are
not. They will know when they see an uppercase word (if you follow
the recommended standard for this first #def i ne argument) to look at
the top of the program for its actual defined value.
The fact that defined literals are not variables is even more clear
in the following program. This program prints five values. Try to
guess what those five values are before you look at the answer
following the program.
/ / Fi l ename: C6DEF2. CPP
/ / I l l ust r at es t hat #def i ne l i t er al s ar e not var i abl es.
#i ncl ude <i ost r eam. h>
#def i ne X1 b+c
#def i ne X2 X1 + X1
#def i ne X3 X2 * c + X1 - d
#def i ne X4 2 * X1 + 3 * X2 + 4 * X3
mai n( )
{
i nt b = 2; / / Decl ar es and i ni t i al i zes f our var i abl es.
i nt c = 3;
i nt d = 4;
i nt e = X4;
/ / Pr i nt s t he val ues.
cout << e << , << X1 << , << X2;
cout << , << X3 << , << X4 << \ n;
r et ur n 0;
}
123
EXAMPLE
C+ + By
The output from this program is
44 5 10 17 44
If you treated X1, X2, X3, and X4 as variables, you would not
receive the correct answers. X1 through X4 are not variables; they are
defined literals. Before your program is compiled, the preprocessor
reads the first line and changes every occurrence of X1 to b+c. This
occurs before the next #def i ne is processed. Therefore, after the first
#def i ne, the source code looks like this:
/ / Fi l ename: C6DEF2. CPP
/ / I l l ust r at es t hat #def i ne l i t er al s ar e not var i abl es.
#i ncl ude <i ost r eam. h>
#def i ne X2 b+c + b+c
#def i ne X3 X2 * c + b+c - d
#def i ne X4 2 * b+c + 3 * X2 + 4 * X3
mai n( )
{
i nt b=2; / / Decl ar es and i ni t i al i zes f our var i abl es.
i nt c=3;
i nt d=4;
i nt e=X4;
/ / Pr i nt s t he val ues.
cout << e << , << b+c << , << X2;
cout << , << X3 << , << X4 << \ n;
r et ur n 0;
}
After the first #def i ne finishes, the second one takes over and
changes every occurrence of X2 to b+c + b+c. Your source code at that
point becomes:
/ / Fi l ename: C6DEF2. CPP
/ / I l l ust r at es t hat #def i ne l i t er al s ar e not var i abl es.
#i ncl ude <i ost r eam. h>
Chapter 6 o Preprocessor D irectives
124
#def i ne X3 b+c + b+c * c + b+c - d
#def i ne X4 2 * b+c + 3 * b+c + b+c + 4 * X3
mai n( )
{
i nt b=2; / / Decl ar es and i ni t i al i zes f our var i abl es.
i nt c=3;
i nt d=4;
i nt e=X4;
/ / Pr i nt s t he val ues.
cout << e << , << b+c << , << b+c + b+c;
cout << , << X3 << , << X4 << \ n;
r et ur n 0;
}
After the second #def i ne finishes, the third one takes over and
changes every occurrence of X3 to b+c +b+c * c +b+c - d. Your source
code then becomes:
/ / Fi l ename: C6DEF2. CPP
/ / I l l ust r at es t hat #def i ne l i t er al s ar e not var i abl es.
#i ncl ude <i ost r eam. h>
#def i ne X4 2 * b+c + 3 * b+c + b+c + 4 * b+c + b+c * c + b+c - d
mai n( )
{
i nt b=2; / / Decl ar es and i ni t i al i zes f our var i abl es.
i nt c=3;
i nt d=4;
i nt e=X4;
/ / Pr i nt s t he val ues.
cout << e << , << b+c << , << b+c + b+c;
cout << , << b+c + b+c * c + b+c - d
<< , << X4 << \ n;
r et ur n 0;
}
125
EXAMPLE
C+ + By
The source code is growing rapidly! After the third #def i ne
finishes, the fourth and last one takes over and changes every occur-
rence of X4 to 2 * b+c + 3 * b+c + b+c + 4 * b+c + b+c * c +b+c - d.
Your source code at this last point becomes:
/ / Fi l ename: C6DEF2. CPP
/ / I l l ust r at es t hat #def i ne l i t er al s ar e not var i abl es.
#i ncl ude <i ost r eam. h>
mai n( )
{
i nt b=2; / / Decl ar es and i ni t i al i zes f our var i abl es.
i nt c=3;
i nt d=4;
i nt e=2 * b+c + 3 * b+c + b+c + 4 * b+c + b+c * c + b+c - d;
/ / Pr i nt s t he val ues.
cout << e << , << b+c << , << b+c + b+c;
cout << , << b+c + b+c * c + b+c - d
<< , << 2 * b+c + 3 * b+c + b+c + 4 * b+c +
b+c * c + b+c - d << \ n;
r et ur n 0;
}
This is what your compiler actually reads. You did not type this
complete listing; you typed the original listing (shown first). The
preprocessor expanded your source code into this longer form, just
as if you had typed it this way.
This is an extreme example, but it serves to illustrate how
#def i ne works on your source code and doesnt define any variables.
The #def i ne behaves like a word processors search-and-replace
command. Due to #def i nes behavior, you can even rewrite the C++
language!
If you are used to BASIC, you might be more comfortable
typing PRI NT rather than C++s cout when you want to print on-
screen. If so, the following #def i ne statement,
#def i ne PRI NT cout
enables you to print in C++ with these statements:
Chapter 6 o Preprocessor D irectives
126
PRI NT << Thi s i s a new pr i nt i ng t echni que\ n;
PRI NT << I coul d have used cout i nst ead. \ n;
This works because by the time your compiler reads the pro-
gram, it reads only the following:
cout << Thi s i s a new pr i nt i ng t echni que\ n;
cout << I coul d have used cout i nst ead. \ n;
In the next chapter, Simple Input/Output, you learn about
two functions sometimes used for input and output called pr i nt f ( )
and scanf ( ) . You can just as easily redefine function names using
#def i ne as you did with cout .
Also, remember that you cannot replace a defined literal if it
resides in another string literal. For example, you cannot use the
following #def i ne statement:
#def i ne AGE
to replace information in this cout :
cout << AGE;
because AGE is a string literal, and it prints literally just as it appears
inside the double quotation marks. The preprocessor can replace
only defined literals that do not appear in quotation marks.
Do Not Overdo #def i ne
Many early C programmers enjoyed redefining parts of the
language to suit whatever they were used to in another lan-
guage. The cout to PRI NT example was only one example of this.
You can redefine virtually any C++ statement or function to
look any way you like.
There is a danger to this, however, so be wary of using #def i ne
for this purpose. Your redefining the language becomes con-
fusing to others who modify your program later. Also, as you
become more familiar with C++, you will naturally use the true
127
EXAMPLE
C+ + By
C++ language more and more. When you are comfortable with
C++, older programs that you redefined will be confusing
even to you!
If you are programming in C++, use the language conventions
that C++ provides. Shy away from trying to redefine com-
mands in the language. Think of the #def i ne directive as a way
to define numeric and string literals. If those literals ever
change, you have to change only one line in your program.
Just say no to any temptation to redefine commands and
built-in functions. Better yet, modify any older C code that uses
#def i ne, and replace the #def i ne preprocessor directive with the
more useful const command.
Examples
1. Suppose you want to keep track of your companys target
sales amount of $55,000.00. That target amount has not
changed for the previous two years. Because it probably will
not change soon (sales are flat), you decide to start using a
defined literal to represent this target amount. Then, if target
sales do change, you just have to change the amount on the
#def i ne line to:
#def i ne TARGETSALES 55000. 00
which defines a floating-point literal. You can then assign
TARGETSALES to floating-point variables and print its value, just
as if you had typed 55000.00 throughout your program, as
these lines show:
amt = TARGETSALES
cout << TARGETSALES;
2. If you find yourself defining the same literals in many
programs, file the literals on disk and include them. Then,
you dont have to type your defined literals at the beginning
Chapter 6 o Preprocessor D irectives
128
of every program. If you store these literals in a file called
MYDEFS.C in your programs directory, you can include the
file with the following #i ncl ude statement:
#i ncl ude mydef s. c
(To use angled brackets, you have to store the file in your
systems include directory.)
3. Defined literals are appropriate for array sizes. For example,
suppose you declare an array for a customers name. When
you write the program, you know you dont have a cus-
tomer whose name is longer than 22 characters (including
the null). Therefore, you can do this:
#def i ne CNMLENGTH 22
When you define the array, you can use this:
char cust _name[ CNMLENGTH]
Other statements that need the array size also can use
CNMLENGTH.
4. Many C++ programmers define a list of error messages.
Once they define the messages with an easy-to-remember
name, they can print those literals if an error occurs and still
maintain consistency in their programs. The following error
messages (or a similar form) often appear at the beginning of
C++ programs.
#def i ne DI SKERR Your di sk dr i ve seems not t o be wor ki ng
#def i ne PRNTERR Your pr i nt er i s not r espondi ng
#def i ne AGEERR You cannot ent er an age t hat smal l
#def i ne NAMEERR You must ent er a f ul l name
Review Questions
The answers to the review questions are in Appendix B.
1. True or false: You can define variables with the preprocessor
directives.
129
EXAMPLE
C+ + By
2. Which preprocessor directive merges another file into your
program?
3. Which preprocessor directive defines literals throughout
your program?
4. True or false: You can define character, string, integer, and
floating-point literals with the #def i ne directive.
5. Which happens first: your program is compiled or pre-
processed?
6. What C++ keyword is used to replace the #def i ne prepro-
cessor directive?
7. When do you use the angled brackets in an #i ncl ude, and
when do you use double quotation marks?
8. Which are easier to change: defined literals or literals that
you type throughout a program? Why?
9. Which header file should you include in almost every C++
program you write?
10. True or false: The #def i ne in the following:
#def i ne MESSAGE Pl ease pr ess Ent er t o cont i nue. . .
changes this statement:
cout << MESSAGE;
11. What is the output from the following program?
/ / Fi l ename: C6EXER, C
#i ncl ude <i ost r eam. h>
#def i ne AMT1 a+a+a
#def i ne AMT2 AMT1 - AMT1
mai n( )
{
i nt a=1;
cout << Amount i s << AMT2 << \ n;
r et ur n 0;
}
Chapter 6 o Preprocessor D irectives
130
Even if you get this right, you will appreciate the side effects
of #def i ne. The const keyword (discussed in Chapter 4,
Variables and Literals) before a constant variable has none
of the side effects that #def i ne has.
Review Exerc ises
1. Write a program that prints your name to the screen. Use a
defined literal for the name. Do not use a character array,
and dont type your actual name inside the cout .
2. Suppose your boss wanted you to write a program that
produced an exception report. If the companys sales are
less than $100,000.00 or more than $750,000.00, your boss
wants your program to print the appropriate message. You
learn how to produce these types of reports later in the book,
but for now just write the #def i ne statements that define
these two floating-point literals.
3. Write the cout statements that print your name and birth
date to the screen. Store these statements in their own file.
Write a second program that includes the first file and
prints your name and birth date. Be sure also to include
<iostream.h>, because the included file contains cout
statements.
4. Write a program that defines the ten digits, 0 through 9, as
literals ZERO through NI NE. Add these ten defined digits and
print the result.
Summary
This chapter taught you the #i ncl ude and #def i ne preprocessor
directives. Despite the fact that these directives are not executed,
they temporarily change your source code by merging and defining
literals into your program.
131
EXAMPLE
C+ + By
The next chapter, Simple Input/Output, explains input and
output in more detail. There are ways to control precision when
using ci n and cout , as well as built-in functions that format input
and output.
Chapter 6 o Preprocessor D irectives
132
133
EXAMPLE
C+ + By
7
Simple
Input/Output
You have already seen the cout operator. It prints values to the
screen. There is much more to cout than you have learned. Using cout
and the screen (the most common output device), you can print
information any way you want it. Your programs also become much
more powerful if you learn to receive input from the keyboard. ci n
is an operator that mirrors the cout . Instead of sending output values
to the screen, ci n accepts values that the user types at the keyboard.
The cout and ci n operators offer the new C++ programmer
input and output operators they can use with relative ease. Both of
these operators have a limited scope, but they give you the ability to
send output from and receive input to your programs. There are
corresponding functions supplied with all C++ compilers called
pr i nt f ( ) and scanf ( ) . These functions are still used by C++ program-
mers due to their widespread use in regular C programs.
This chapter introduces you to
o The cout operator
o Control operators
o The ci n operator
Chapter 7 o Sim ple Input/O utput
134
o The pr i nt f ( ) output function
o The scanf ( ) input function
You will be surprised at how much more advanced your
programs can be after you learn these input/output operators.
The cout Operator
The cout operator sends data to the standard output device. The
standard output device is usually the screen; you can, however,
redirect standard output to another device. If you are unfamiliar
with device redirection at the operating system level, dont worry,
you learn more about it in this book. At this point, cout sends all
output to the screen.
The format of the cout is different from those of other C++
commands. The format for cout is
cout << dat a [ << dat a ] ;
The dat a placeholder can be variables, literals, expressions, or
a combination of all three.
Printing Strings
To print a string constant, simply type the string constant after
the cout operator. For example, to print the string, The r ai n i n Spai n,
you would simply type this:
Print the sentence The r ai n i n Spai n to the screen.
cout << The r ai n i n Spai n;
You must remember, however, that cout does not perform an
automatic carriage return. This means the screens cursor appears
directly after the last printed character and subsequent cout s begin
thereafter.
To better understand this concept, try to predict the output
from the following three cout operators:
cout sends output
to the screen.
135
EXAMPLE
C+ + By
cout << Li ne 1;
cout << Li ne 2;
cout << Li ne 3;
These operators produce the following output:
Li ne 1Li ne 2Li ne 3
which is probably not what you intended. Therefore, you must
include the newline character, \ n, whenever you want to move the
cursor to the next line. The following three cout operators produce
a three-line output:
cout << Li ne 1\ n;
cout << Li ne 2\ n;
cout << Li ne 3\ n;
The output from these cout s is
Li ne 1
Li ne 2
Li ne 3
The \ n character sends the cursor to the next line no matter
where you insert it. The following three cout operators also produce
the correct three-line output:
cout << Li ne 1;
cout << \ nLi ne 2\ n;
cout Li ne 3;
The second cout prints a newline before it prints anything else.
It then prints its string followed by another newline. The third string
prints on the third line.
You also can print strings stored in character arrays by typing
the array name inside the cout . If you were to store your name in an
array defined as:
char my_name[ ] = Lyndon Har r i s;
you could print the name with the following cout :
cout << my_name;
Chapter 7 o Sim ple Input/O utput
136
The following section of code prints three string literals on
three different lines:
cout << Nancy Car son\ n;
cout << 1213 Oak St r eet \ n;
cout << Fai r banks, Al aska\ n;
The cout is often used to label output. Before printing an age,
amount, salary, or any other numeric data, you should print a string
constant that tells the user what the number means. The following
cout tells the user that the next number printed is an age. Without this
cout , the user would not know what the number represented.
cout << Her e i s t he age t hat was f ound i n our f i l es: ;
You can print a blank line by printing two newline characters,
\ n, next to each other after your string, as in:
cout << Pr epar e t he i nvoi ces. . . \ n\ n;
Examples
1. The following program stores a few values in three vari-
ables, then prints the results:
/ / Fi l ename: C7PRNT1. CPP
/ / Pr i nt s val ues i n var i abl es.
#i ncl ude <i ost r eam. h>
mai n( )
{
char f i r st = E ; / / St or e some char act er , i nt eger ,
char mi ddl e = W ; / / and f l oat i ng- poi nt var i abl e.
char l ast = C ;
i nt age = 32;
i nt dependent s = 2;
f l oat sal ar y = 25000. 00;
f l oat bonus = 575. 25;
/ / Pr i nt s t he r esul t s.
cout << f i r st << mi ddl e << l ast ;
137
EXAMPLE
C+ + By
cout << age << dependent s;
cout << sal ar y << bonus;
r et ur n 0;
}
2. The last program does not help the user. The output is not
labeled, and it prints on a single line. Here is the same
program with a few messages included and some newline
characters placed where needed:
/ / Fi l ename: C7PRNT2. CPP
/ / Pr i nt s val ues i n var i abl es wi t h appr opr i at e l abel s.
#i ncl ude <i ost r eam. h>
mai n( )
{
char f i r st = E ; / / St or e some char act er , i nt eger ,
char mi ddl e = W ; / / and f l oat i ng- poi nt var i abl e.
char l ast = C ;
i nt age = 32;
i nt dependent s = 2;
f l oat sal ar y = 25000. 00;
f l oat bonus = 575. 25;
/ / Pr i nt s t he r esul t s.
cout << Her e ar e t he i ni t i al s: \ n;
cout << f i r st << mi ddl e << l ast <<\ n;
cout << The age and number of dependent s ar e\ n;
cout << age << << dependent s << \ n\ n;
cout << The sal ar y and bonus ar e\ n;
cout << sal ar y << << bonus;
r et ur n 0;
}
The output from this program appears below:
Her e ar e t he i ni t i al s:
EWC
The age and number of dependent s ar e
32 2
Chapter 7 o Sim ple Input/O utput
138
The sal ar y and bonus ar e
25000 575. 25
The first floating-point values do not print with zeros, but
the number is correct. The next section shows you how to set
the number of leading and trailing zeros.
3. If you have to print a table of numbers, you can use the \ t
tab character to do so. Place the tab character between each
of the printed numbers. The following program prints a list
of team names and number of hits for the first three weeks of
the season:
/ / Fi l ename: C7TEAM. CPP
/ / Pr i nt s a t abl e of t eamnames and hi t s f or t hr ee weeks.
#i ncl ude <i ost r eam. h>
mai n( )
{
cout << Par r ot s\ t Rams\ t Ki ngs\ t Ti t ans\ t Char ger s\ n;
cout << 3\ t 5\ t 3\ t 1\ t 0\ n;
cout << 2\ t 5\ t 1\ t 0\ t 1\ n;
cout << 2\ t 6\ t 4\ t 3\ t 0\ n;
r et ur n 0;
}
This program produces the table shown below. You can see
that even though the names are different widths, the num-
bers print correctly beneath them. The \ t character forces the
next name or value to the next tab position (every eight
characters).
Par r ot s Rams Ki ngs Ti t ans Char ger s
3 5 3 1 0
2 5 1 0 1
2 6 4 3 0
139
EXAMPLE
C+ + By
Control Operators
You have already seen the need for additional program-output
control. All floating-point numbers print with too many decimal
places for most applications. What if you want to print only dollars
and cents (two decimal places), or print an average with a single
decimal place?
You can specify how many print positions to use in printing a
number. For example, the following cout prints the number 456,
using three positions (the length of the data):
cout << 456;
If the 456 were stored in an integer variable, it would still use
three positions to print because the number of digits printed is three.
However, you can specify how many positions to print. The follow-
ing cout prints the number 456 in five positions (with two leading
spaces):
cout << set w( 5) << set f i l l ( ) << 456;
You typically use the set w manipulator when you want to print
data in uniform columns. Be sure to include the iomanip.h header
file in any programs that use manipulators because iomanip.h
describes how the set w works to the compiler.
The following program shows you the importance of the width
number. Each cout output is described in the comment to its left.
/ / Fi l ename: C7MOD1. CPP
/ / I l l ust r at es var i ous i nt eger wi dt h cout modi f i er s.
#i ncl ude <i ost r eam. h>
#i ncl ude <i omani p. h>
mai n( )
{ / / The out put appear s bel ow.
cout << 456 << 456 << 456 << \ n; / / Pr i nt s 456456456
cout << set w( 5) << 456 << set w( 5) << 456 << set w( 5) <<
456 << \ n; / / Pr i nt s 456 456 456
cout << set w( 7) << 456 << set w( 7) << 456 << set w( 7) <<
456 << \ n; / / Pr i nt s 456 456 456
r et ur n 0;
}
You can modi fy the
way numbers pri nt.
Chapter 7 o Sim ple Input/O utput
140
When you use a set w manipulator inside a conversion charac-
ter, C++ right-justifies the number by the width you specify. When
you specify an eight-digit width, C++ prints a value inside those
eight digits, padding the number with leading blanks if the number
does not fill the whole width.
NOTE: If you do not specify a width large enough to hold the
number, C++ ignores your width request and prints the num-
ber in its entirety.
You can control the width of strings in the same manner with
the set w manipulator. If you dont specify enough width to output
the full string, C++ ignores the width. The mailing list application in the
back of this book uses this technique to print names on mailing labels.
NOTE: set w( ) becomes more important when you print
floating-point numbers.
set pr eci si on( 2) prints a floating-point number with two deci-
mal places. If C++ has to round the fractional part, it does so. The
following cout :
cout << set w( 6) << set pr eci si on( 2) << 134. 568767;
produces the following output:
134. 57
Without the set w or set pr eci si on manipulators, C++ would
have printed:
134. 568767
TIP: When printing floating-point numbers, C++ always prints
the entire portion to the left of the decimal (to maintain as much
accuracy as possible) no matter how many positions you
specify. Therefore, many C++ programmers ignore the set w
manipulator for floating-point numbers and only specify the
precision, as in set pr eci si on( 2) .
141
EXAMPLE
C+ + By
Examples
1. If you want to control the width of your data, use a set w
manipulator. The following program is a revision of the
C7TEAM.CPP shown earlier. Instead of using the tab charac-
ter, \ t , which is limited to eight spaces, this program uses the
width specifier to set the tabs. It ensures that each column is
10 characters wide.
/ / Fi l ename: C7TEAMMD. CPP
/ / Pr i nt s a t abl e of t eamnames and hi t s f or t hr ee weeks
/ / usi ng wi dt h- modi f yi ng conver si on char act er s.
#i ncl ude <i ost r eam. h>
#i ncl ude <i omani p. h>
mai n( )
{
cout << set w( 10) << Par r ot s << set w( 10) <<
Rams << set w( 10) << Ki ngs << set w( 10) <<
Ti t ans << set w( 10) << Char ger s << \ n;
cout << set w( 10) << 3 << set w( 10) << 5 <<
set w( 10) << 2 << set w( 10) << 1 <<
set w( 10) << 0 << \ n;
cout << set w( 10) << 2 << set w( 10) << 5 <<
set w( 10) << 1 << set w( 10) << 0 <<
set w( 10) << 1 << \ n;
cout << set w( 10) << 2 << set w( 10) << 6 <<
set w( 10) << 4 << set w( 10) << 3 <<
set w( 10) << 0 << \ n;
r et ur n 0;
}
2. The following program is a payroll program. The output is
in dollars and cents because the dollar amounts print
properly to two decimal places.
/ / Fi l ename: C7PAY1. CPP
/ / Comput es and pr i nt s payr ol l dat a pr oper l y i n dol l ar s
/ / and cent s.
Chapter 7 o Sim ple Input/O utput
142
#i ncl ude <i ost r eam. h>
#i ncl ude <i omani p. h>
mai n( )
{
char emp_name[ ] = Lar r y Payt on;
char pay_dat e[ ] = 03/ 09/ 92;
i nt hour s_wor ked = 43;
f l oat r at e = 7. 75; / / Pay per hour
f l oat t ax_r at e = . 32; / / Tax per cent age r at e
f l oat gr oss_pay, t axes, net _pay;
/ / Comput es t he pay amount .
gr oss_pay = hour s_wor ked * r at e;
t axes = t ax_r at e * gr oss_pay;
net _pay = gr oss_pay - t axes;
/ / Pr i nt s t he r esul t s.
cout << As of : << pay_dat e << \ n;
cout << emp_name << wor ked << hour s_wor ked <<
hour s\ n;
cout << and got pai d << set w( 2) << set pr eci si on( 2)
<< gr oss_pay << \ n;
cout << Af t er t axes of : << set w( 6) << set pr eci si on( 2)
<< t axes << \ n;
cout << hi s t ake- home pay was $ << set w( 8) <<
set pr eci si on( 2) << net _pay << \ n;
r et ur n 0;
}
The output from this program follows. Remember that the
floating-point variables still hold the full precision (to six
decimal places), as they did in the previous program. The
modifying set w manipulators only affect how the variables
are output, not what is stored in them.
As of : 03/ 09/ 92
Lar r y Payt on wor ked 43 hour s
and got pai d 333. 25
Af t er t axes of : 106. 64
hi s t ake- home pay was $226. 61
143
EXAMPLE
C+ + By
3. Most C++ programmers do not use the set w manipulator
when printing dollars and cents. Here is the payroll program
again that uses the shortcut floating-point width method.
Notice the previous three cout statements include no set w
manipulator. C++ automatically prints the full number to
the left of the decimal and prints only two places to the right.
/ / Fi l ename: C7PAY2. CPP
/ / Comput es and pr i nt s payr ol l dat a pr oper l y
/ / usi ng t he shor t cut modi f i er .
#i ncl ude <i ost r eam. h>
#i ncl ude <i omani p. h>
mai n( )
{
char emp_name[ ] = Lar r y Payt on;
char pay_dat e[ ] = 03/ 09/ 92;
i nt hour s_wor ked = 43;
f l oat r at e = 7. 75; / / Pay per hour
f l oat t ax_r at e = . 32; / / Tax per cent age r at e
f l oat gr oss_pay, t axes, net _pay;
/ / Comput es t he pay amount .
gr oss_pay = hour s_wor ked * r at e;
t axes = t ax_r at e * gr oss_pay;
net _pay = gr oss_pay - t axes;
/ / Pr i nt s t he r esul t s.
cout << As of : << pay_dat e << \ n;
cout << emp_name << wor ked << hour s_wor ked <<
hour s\ n;
cout << and got pai d << set pr eci si on( 2) << gr oss_pay
<< \ n;
cout << Af t er t axes of : << set pr eci si on( 2) << t axes
<< \ n;
cout << hi s t ake- home pay was << set pr eci si on( 2) <<
net _pay << \ n;
r et ur n 0;
}
Chapter 7 o Sim ple Input/O utput
144
This programs output is the same as the previous
programs.
The ci n Operator
You now understand how C++ represents data and variables,
and you know how to print the data. There is one additional part of
programming you have not seen: inputting data to your programs.
Until this point, you have not inputted data into a program. All
data you worked with was assigned to variables in the program.
However, this is not always the best way to transfer data to your
programs; you rarely know what your data is when you write your
programs. The data is known only when you run the programs (or
another user runs them).
The ci n operator is one way to input from the keyboard. When
your programs reach the line with a ci n, the user can enter values
directly into variables. Your program can then process those vari-
ables and produce output. Figure 7.1 illustrates the difference be-
tween cout and ci n.
The ci n operator
stores keyboard
i nput i n vari abl es.
Figure 7.1. The actions of cout and ci n.
145
EXAMPLE
C+ + By
The ci n Function Fills Variables with Values
There is a major difference between ci n and the assignment
statements (such as i = 17; ). Both fill variables with values.
However, the assignment statement assigned specific values to
variables at programming time. When you run a program with
assignment statements, you know from the programs listing
exactly what values go into the variables because you wrote the
program specifically to store those values. Every time you run
the program, the results are exactly the same because the same
values are assigned to the same variables.
You have no idea, when you write programs that use ci n, what
values will be assigned to the ci ns variables because their
values are not known until the program runs and the user
enters those values. This means you have a more flexible
program that can be used by a variety of people. Every time the
program is run, different results are created, depending on the
values typed at each ci n in the program.
The ci n has its drawbacks. Therefore, in the next few chapters
you will use ci n until you learn more powerful (and flexible) input
methods. The ci n operator looks much like cout . It contains one or
more variables that appear to the right of the operator name. The
format of the ci n is
ci n >> val ue [ >> val ues] ;
The iostream.h header file contains the information C++ needs
to use ci n, so include it when using ci n.
NOTE: The ci n operator uses the same manipulators (set w and
set pr eci si on) as the cout operator.
As mentioned earlier, ci n poses a few problems. The ci n opera-
tor requires that your user type the input exactly as ci n expects it.
Because you cannot control the users typing, this cannot be en-
sured. You might want the user to enter an integer value followed
Chapter 7 o Sim ple Input/O utput
146
by a floating-point value and your ci n operator call might expect it
too, but your user might decide to enter something else! If this
happens, there is not much you can do because the resulting input
is incorrect and your C++ program has no reliable method for testing
user accuracy. Before every ci n, print a prompt that explains exactly
what you expect the user to type.
For the next few chapters, you can assume that the user knows
to enter the proper values, but for your real programs, read on for
better methods to receive input, starting with Chapter 21, Device
and Character Input/Output.
Examples
1. If you wanted a program that computed a seven percent
sales tax, you could use the ci n statement to figure the sales,
compute the tax, and print the results as the following
program shows:
/ / Fi l ename: C7SLTX1. CPP
/ / Pr ompt f or a sal es amount and pr i nt t he sal es t ax.
#i ncl ude <i ost r eam. h>
#i ncl ude <i omani p. h>
mai n( )
{
f l oat t ot al _sal e; / / User s sal e amount goes her e.
f l oat st ax;
/ / Di spl ay a message f or t he user .
cout << What i s t he t ot al amount of t he sal e? ;
/ / Recei ve t he sal es amount f r omuser .
ci n >> t ot al _sal e;
/ / Cal cul at e sal es t ax.
st ax = t ot al _sal e * . 07;
The ci n operator
requi res that the user
type correct i nput.
Thi s i s not al ways
possi bl e to
guarantee!
147
EXAMPLE
C+ + By
cout << The sal es t ax f or << set pr eci si on( 2) <<
t ot al _sal e << i s << set pr eci si on ( 2) << st ax;
r et ur n 0;
}
Because the first cout does not contain a newline character,
\ n, the users response to the prompt appears to the right of
the question mark.
2. When inputting keyboard strings into character arrays with
ci n, you are limited to receiving one word at a time. The ci n
does not enable you to type more than one word in a single
character array at a time. The following program asks the
user for his or her first and last name. The program has to
store those two names in two different character arrays
because ci n cannot input both names at once. The program
then prints the names in reverse order.
/ / Fi l ename: C7PHON1. CPP
/ / Pr ogr amt hat r equest s t he user s name and pr i nt s i t
/ / t o t he scr een as i t woul d appear i n a phone book.
#i ncl ude <i ost r eam. h>
#i ncl ude <i omani p. h>
mai n( )
{
char f i r st [ 20] , l ast [ 20] ;
cout << What i s your f i r st name? ;
ci n >> f i r st ;
cout << What i s your l ast name? ;
ci n >> l ast ;
cout << \ n\ n; / / Pr i nt s t wo bl ank l i nes.
cout << I n a phone book, your name woul d l ook l i ke t hi s: \ n;
cout << l ast << , << f i r st ;
r et ur n 0;
}
Chapter 7 o Sim ple Input/O utput
148
3. Suppose you want to write a program that does simple
addition for your seven-year-old daughter. The following
program prompts her for two numbers. The program then
waits for her to type an answer. When she gives her answer,
the program displays the correct result so she can see how
well she did.
/ / Fi l ename: C7MATH. CPP
/ / Pr ogr amt o hel p chi l dr en wi t h si mpl e addi t i on.
/ / Pr ompt chi l d f or t wo val ues af t er pr i nt i ng
/ / a t i t l e message.
#i ncl ude <i ost r eam. h>
#i ncl ude <i omani p. h>
mai n( )
{
i nt num1, num2, ans;
i nt her _ans;
cout << *** Mat h Pr act i ce ***\ n\ n\ n;
cout << What i s t he f i r st number ? ;
ci n >> num1;
cout << What i s t he second number ? ;
ci n >> num2;
/ / Comput e answer and gi ve her a chance t o wai t f or i t .
ans = num1 + num2;
cout << \ nWhat do you t hi nk i s t he answer ? ;
ci n >> her _ans; / / Not hi ng i s done wi t h t hi s.
/ / Pr i nt s answer af t er a bl ank l i ne.
cout << \ n << num1 << pl us << num2 << i s
<< ans << \ n\ nHope you got i t r i ght ! ;
r et ur n 0;
}
149
EXAMPLE
C+ + By
pr i nt f ( ) and scanf ( )
Before C++, C programmers had to rely on function calls to
perform input and output. Two of those functions, pr i nt f ( ) and
scanf ( ) , are still used frequently in C++ programs, although cout and
ci n have advantages over them. pr i nt f ( ) (like cout ) prints values to
the screen and scanf ( ) (like ci n) inputs values from the keyboard.
pr i nt f ( ) requires a controlling format string that describes the data
you want to print. Likewise, scanf ( ) requires a controlling format
string that describes the data the program wants to receive from the
keyboard.
NOTE: cout is the C++ replacement to pr i nt f ( ) and ci n is the
C++ replacement to scanf ( ) .
Because you are concentrating on C++, this chapter only briefly
covers pr i nt f ( ) and scanf ( ) . Throughout this book, a handful of
programs use these functions to keep you familiar with their format.
pr i nt f ( ) and scanf ( ) are not obsolete in C++, but their use will
diminish dramatically when programmers move away from C and
to C++. cout and ci n do not require controlling strings that describe
their data; cout and ci n are intelligent enough to know how to treat
data. Both pr i nt f ( ) and scanf ( ) are limitedespecially scanf ( ) but
they do enable your programs to send output and to receive input.
The pr i nt f ( ) Func tion
pr i nt f ( ) sends data to the standard output device, which is
generally the screen. The format of pr i nt f ( ) is different from those of
regular C++ commands. The values that go inside the parentheses
vary, depending on the data you are printing. However, as a general
rule, the following pr i nt f ( ) format holds true:
pr i nt f ( cont r ol _st r i ng [ , one or mor e val ues] ) ;
Notice pr i nt f ( ) always requires a cont r ol _st r i ng. This is a
string, or a character array containing a string, that determines how
the rest of the values (if any are listed) print. These values can be
variables, literals, expressions, or a combination of all three.
The pr i nt f ( )
functi on sends
output to the screen.
Chapter 7 o Sim ple Input/O utput
150
TIP: Despite its name, pr i nt f ( ) sends output to the screen and
not to the printer.
The easiest data to print with pr i nt f ( ) are strings. To print a
string constant, you simply type that string constant inside the
pr i nt f ( ) function. For example, to print the string The r ai n i n Spai n,
you would simply type the following:
Print the phrase The r ai n i n Spai n to the screen.
pr i nt f ( The r ai n i n Spai n) ;
pr i nt f ( ) , like cout , does not perform an automatic carriage
return. Subsequent pr i nt f ( ) s begin next to that last printed charac-
ter. If you want a carriage return, you must supply a newline
character, as so:
pr i nt f ( The r ai n i n Spai n\ n) ;
You can print strings stored in character arrays also by typing
the array name inside the pr i nt f ( ) . For example, if you were to store
your name in an array defined as:
char my_name[ ] = Lyndon Har r i s;
you could print the name with this pr i nt f ( ) :
pr i nt f ( my_name) ;
You must include the stdio.h header file when using pr i nt f ( )
and scanf ( ) because stdio.h determines how the input and output
functions work in the compiler. The following program assigns a
message in a character array, then prints that message.
/ / Fi l ename: C7PS2. CPP
/ / Pr i nt s a st r i ng st or ed i n a char act er ar r ay.
#i ncl ude <st di o. h>
mai n( )
{
char message[ ] = Pl ease t ur n on your pr i nt er ;
pr i nt f ( message) ;
r et ur n 0;
}
151
EXAMPLE
C+ + By
Conversion Charac ters
Inside most pr i nt f ( ) control strings are conversion characters.
These special characters tell pr i nt f ( ) exactly how the data (following
the characters) are to be interpreted. Table 7.1 shows a list of
common conversion characters. Because any type of data can go
inside the pr i nt f ( ) s parentheses, these conversion characters are
required any time you print more than a single string constant. If you
dont want to print a string, the string constant must contain at least
one of the conversion characters.
Table 7.1. Common pr i nt f ( ) c onversion c harac ters.
Conversion
Character Output
%s String of characters (until null zero is reached)
%c Character
%d Decimal integer
%f Floating-point numbers
%u Unsigned integer
%x Hexadecimal integer
%% Prints a percent sign (%)
Note: You can insert an l (lowercase l ) or L before the integer and floating-point conversion characters
(such as %l d and %Lf ) to indicate that a long integer or long double floating-point is to be printed.
NOTE: Characters other than those shown in the table print
exactly as they appear in the control string.
When you want to print a numeric constant or variable, you
must include the proper conversion character inside the pr i nt f ( )
control string. If i , j , and k are integer variables, you cannot print
them with the pr i nt f ( ) that follows.
pr i nt f ( i , j , k) ;
Chapter 7 o Sim ple Input/O utput
152
Because pr i nt f ( ) is a function and not a command, this pr i nt f ( )
function has no way of knowing what type the variables are. The
results are unpredictable, and you might see garbage on your
screenif anything appears at all.
When you print numbers, you must first print a control string
that includes the format of those numbers. The following pr i nt f ( )
prints a string. In the output from this line, a string appears with an
integer (%d) and a floating-point number (%f ) printed inside that
string.
pr i nt f ( I amBet t y, I am%d year s ol d, and I make %f \ n,
35, 34050. 25) ;
This produces the following output:
I amBet t y, I am35 year s ol d, and I make 34050. 25
Figure 7.2 shows how C interprets the control string and the
variables that follow. Be sure you understand this example before
moving on. It is the foundation of the pr i nt f ( ) function.
Figure 7.2. Control string in action.
You also can print integer and floating-point variables in the
same manner.
Examples
1. The following program stores a few values in three vari-
ables, then prints the results.
153
EXAMPLE
C+ + By
/ / Fi l ename: C7PRNTF. CPP
/ / Pr i nt s val ues i n var i abl es wi t h appr opr i at e l abel s.
#i ncl ude <st di o. h>
mai n( )
{
char f i r st = E ; / / St or e some char act er , i nt eger ,
char mi ddl e= W ; / / and f l oat i ng- poi nt var i abl e.
char l ast = C ;
i nt age=32;
i nt dependent s=2;
f l oat sal ar y=25000. 00;
f l oat bonus=575. 25;
/ * Pr i nt s t he r esul t s. */
pr i nt f ( Her e ar e t he i ni t i al s\ n) ;
pr i nt f ( %c%c%c\ n\ n, f i r st , mi ddl e, l ast ) ;
pr i nt f ( The age and number of dependent s ar e\ n) ;
pr i nt f ( %d %d\ n\ n, age, dependent s) ;
pr i nt f ( The sal ar y and bonus ar e\ n) ;
pr i nt f ( %f %f , sal ar y, bonus) ;
r et ur n 0;
}
The output from this program is
Her e ar e t he i ni t i al s
EWC
The age and number of dependent s ar e
32 2
The sal ar y and bonus ar e
25000. 000000 575. 250000
2. The floating-point values print with too many zeros, of
course, but the numbers are correct. You can limit the num-
ber of leading and trailing zeros that is printed by adding a
width specifier in the control string. For instance, the following
pr i nt f ( ) prints the sal ar y and bonus with two decimal places:
pr i nt f ( %. 2f %. 2f , sal ar y, bonus) ;
Chapter 7 o Sim ple Input/O utput
154
Make sure your printed values match the control string
supplied with them. The pr i nt f ( ) function cannot fix prob-
lems resulting from mismatched values and control strings.
Dont try to print floating-point values with character-string
control codes. If you list five integer variables in a pr i nt f ( ) ,
be sure to include five %d conversion characters in the
pr i nt f ( ) as well.
Printing ASCII Values
There is one exception to the rule of printing with matching
conversion characters. If you want to print the ASCII value of
a character, you can print that character (whether it is a constant
or a variable) with the integer %d conversion character. Instead
of printing the character, pr i nt f ( ) prints the matching ASCII
number for that character.
Conversely, if you print an integer with a %c conversion char-
acter, you see the character that matches that integers value
from the ASCII table.
The following pr i nt f ( ) s illustrate this fact:
pr i nt f ( %c, 65) ; / / Pr i nt s t he l et t er A.
pr i nt f ( %d, A ) ; / / Pr i nt s t he number 65.
The scanf ( ) Func tion
The scanf ( ) function reads input from the keyboard. When
your programs reach the line with a scanf ( ) , the user can enter values
directly into variables. Your program can then process the variables
and produce output.
The scanf ( ) function looks much like pr i nt f ( ) . It contains a
control string and one or more variables to the right of the control
string. The control string informs C++ exactly what the incoming
keyboard values look like, and what their types are. The format of
scanf ( ) is
scanf ( cont r ol _st r i ng, one or mor e val ues) ;
The scanf ( )
functi on stores
keyboard i nput to
vari abl es.
155
EXAMPLE
C+ + By
The scanf ( ) cont r ol _st r i ng uses almost the same conversion
characters as the pr i nt f ( ) cont r ol _st r i ng, with two slight differences.
You should never include the newline character, \ n, in a scanf ( )
control string. The scanf ( ) function knows when the input is
finished when the user presses Enter. If you supply an additional
newline code, scanf ( ) might not terminate properly. Also, always
put a beginning space inside every scanf ( ) control string. This does
not affect the users input, but scanf ( ) sometimes requires it to work
properly. Later examples in this chapter clarify this fact.
As mentioned earlier, scanf ( ) poses a few problems. The scanf ( )
function requires that your user type the input exactly the way
cont r ol _st r i ng specifies. Because you cannot control your users
typing, this cannot always be ensured. For example, you might
want the user to enter an integer value followed by a floating-point
value (your scanf ( ) control string might expect it too), but your user
might decide to enter something else! If this happens, there is not
much you can do. The resulting input is incorrect, but your C
program has no reliable method for testing user accuracy before
your program is run.
CAUTION: The users keyboard input values must match, in
number and type, the control string contained in each scanf ( ) .
Another problem with scanf ( ) is not as easy for beginners to
understand as the last. The scanf ( ) function requires that you use
pointer variables, not regular variables, in its parentheses. Although
this sounds complicated, it doesnt have to be. You should have no
problem with scanf ( ) s pointer requirements if you remember these
two simple rules:
1. Always put an ampersand (&) before variable names inside a
scanf ( ) .
2. Never put an ampersand (&) before an array name inside a
scanf ( ) .
Despite these strange scanf ( ) rules, you can learn this function
quickly by looking at a few examples.
The scanf ( )
functi on requi res
that your user type
accuratel y. Thi s i s
not al ways possi bl e
to guarantee!
Chapter 7 o Sim ple Input/O utput
156
Examples
1. If you want a program that computes a seven percent sales
tax, you could use the scanf ( ) statement to receive the sales,
compute the tax, and print the results as the following
program shows.
/ / Fi l ename: C7SLTXS. CPP
/ / Comput e a sal es amount and pr i nt t he sal es t ax.
#i ncl ude <st di o. h>
mai n( )
{
f l oat t ot al _sal e; / / User s sal e amount goes her e.
f l oat st ax;
/ / Di spl ay a message f or t he user .
pr i nt f ( What i s t he t ot al amount of t he sal e? ) ;
/ / Comput e t he sal es amount f r omuser .
scanf ( %f , &t ot al _sal e) ; / / Don t f or get t he begi nni ng
/ / space and an &.
st ax = t ot al _sal e * . 07; / / Cal cul at e t he sal es t ax.
pr i nt f ( The sal es t ax f or %. 2f i s %. 2f , t ot al _sal e, st ax) ;
r et ur n 0;
}
If you run this program, the program waits for you to enter a
value for the total sale. Remember to use the ampersand in
front of the t ot al _sal e variable when you enter it in the
scanf ( ) function. After pressing the Enter key, the program
calculates the sales tax and prints the results.
If you entered 10.00 as the sale amount, you would receive
the following output :
The sal es t ax f or 10. 00 i s 0. 70
2. Use the string %s conversion character to input keyboard
strings into character arrays with scanf ( ) . As with ci n, you
are limited to inputting one word at a time, because you
157
EXAMPLE
C+ + By
cannot type more than one word into a single character array
with scanf ( ) . The following program is similar to
C7PHON1.CPP except the scanf ( ) function, rather than ci n,
is used. It must store two names in two different character
arrays, because scanf ( ) cannot input both names at once. The
program then prints the names in reverse order.
/ / Fi l ename: C7PHON2. CPP
/ / Pr ogr amt hat r equest s t he user s name and pr i nt s i t
/ / t o t he scr een as i t woul d appear i n a phone book.
#i ncl ude <st di o. h>
mai n( )
{
char f i r st [ 20] , l ast [ 20] ;
pr i nt f ( What i s your f i r st name? ) ;
scanf ( %s, f i r st ) ;
pr i nt f ( What i s your l ast name? ) ;
scanf ( %s, l ast ) ;
pr i nt f ( \ n\ n) ; / / Pr i nt s t wo bl ank l i nes.
pr i nt f ( I n a phone book, your name woul d l ook l i ke
t hi s: \ n) ;
pr i nt f ( %s, %s, l ast , f i r st ) ;
r et ur n 0;
}
3. How many values are entered with the following scanf ( ) ,
and what are their types?
scanf ( %d %d %f %s, &i , &j , &k, l ) ;
Review Questions
The answers to the Review Questions are in Appendix B.
] 1. What is the difference between cout and ci n?
2. Why is a prompt message important before using ci n for
input?
Chapter 7 o Sim ple Input/O utput
158
3. How many values do you enter with the following ci n?
ci n >> i >> j >> k >> l ;
4. Because they both assign values to variables, is there any
difference between assigning values to variables and using
ci n to give them values?
5. True or false: The %s conversion character is usually not
required in pr i nt f ( ) control strings.
6. Which types of variables do not require the ampersand (&)
character in scanf ( ) functions?
7. What is the output produced by the following cout ?
cout << The backsl ash \ \ \ \ char act er i s speci al ;
8. What is the result of the following cout ?
cout << set w( 8) << set pr eci si on( 3) << 123. 456789;
Review Exerc ises
1. Write a program that prompts the user for his or her name
and weight. Store these values in separate variables and
print them on-screen.
2. Assume you are a college professor and have to average
grades for 10 students. Write a program that prompts you
for 10 different grades, then displays an average of them.
3. Modify the program in Exercise 2 to ask for each students
name as well as her grade. Print the grade list to the screen,
with each students name and grade in two columns. Make
sure the columns align by using a set w manipulator on the
grade. At the bottom, print the average of the grades. (Hint:
Store the 10 names and 10 grades in different variables with
different names.) This program is easy, but takes thirty or so
lines, plus appropriate comments and prompts. Later, you
learn ways to streamline this program.
159
EXAMPLE
C+ + By
4. This exercise tests your understanding of the backslash
conversion character: Write a program that uses cout opera-
tors to produce the following picture on-screen:
+
/ *\
| | |
* | | |
** | | |
/ \ __* | | |
/ \ | | / | | | \
/ | / * \
/ | ======| \ ***
| + + | *
| | | |
____| _+| | +_| ______________/ ================\ _______
Summary
You now can print almost anything to the screen. By studying
the manipulators and how they behave, you can control your output
more thoroughly than ever before. Also, because you can receive
keyboard values, your programs are much more powerful. No
longer do you have to know your data values when you write the
program. You can ask the user to enter values into variables with ci n.
You have the tools to begin writing programs that fit the data
processing model of INPUT->PROCESS->OUTPUT. This chapter
concludes the preliminary discussion of the C++ language. This part
of the book attempted to give you an overview of the language and
to teach you enough of the language elements so you can begin
writing helpful programs.
Chapter 8, Using C++ Math Operators and Precedence,
begins a new type of discussion. You learn how C++s math and
relational operators work on data, and the importance of the prece-
dence table of operators.
Chapter 7 o Sim ple Input/O utput
160
Part II
Using C++ Operators
163
EXAMPLE
C+ + By
8
Using C++ Math
Operators and
Prec edenc e
If you are dreading this chapter because you dont like mathrelax,
C++ does all your math for you! It is a misconception that you have
to be good at math to understand how to program computers. In
fact, programming practice assumes the opposite is true! Your
computer is your slave, to follow your instructions, and to do all
the calculations for you. This chapter explains how C++ computes
by introducing you to
o Primary math operators
o Order of operator precedence
o Assignment statements
o Mixed data type calculations
o Type casting
Chapter 8 o U sing C ++ M ath O perators and Precedence
164
Many people who dislike math actually enjoy learning how the
computer handles it. After learning the math operators and a few
simple ways in which C++ uses them, you should feel comfortable
using calculations in your programs. Computers are fast, and they
can perform math operations much faster than you can!
C++s Primary Math
Operators
A C++ math operator is a symbol used for adding, subtracting,
multiplying, dividing, and other operations. C++ operators are not
always mathematical in nature, but many are. Table 8.1 lists these
operator symbols and their primary meanings.
Table 8.1. C++ primary operators.
Symbol Meaning
* Multiplication
/ Division and Integer Division
% Modulus or Remainder
+ Addition
- Subtraction
Most of these operators work in the familiar way you expect
them to. Multiplication, addition, and subtraction produce the same
results (and the division operator usually does) as those produced
with a calculator. Table 8.2 illustrates four of these simple operators.
Table 8.2. Typic al operator results.
Formula Result
4 * 2 8
64 / 4 16
80 - 15 65
12 + 9 21
165
EXAMPLE
C+ + By
Table 8.2 contains examples of binary operations performed with
the four operators. Dont confuse binary operations with binary
numbers. When an operator is used between two literals, variables,
or a combination of both, it is called a binary operator because it
operates using two values. When you use these operators (when
assigning their results to variables, for example), it does not matter
in C++ whether you add spaces to the operators or not.
CAUTION: For multiplication, use the asterisk (*), not an x as
you might normally do. An x cannot be used as the multiplica-
tion sign because C++ uses x as a variable name. C++ interprets
x as the value of a variable called x.
The Unary Operators
A unary operator operates on, or affects, a single value. For
instance, you can assign a variable a positive or negative number by
using a unary + or .
Examples
1. The following section of code assigns four variables a posi-
tive or a negative number. The plus and minus signs are all
unary because they are not used between two values.
The variable a is assigned a negative 25 value.
The variable b is assigned a positive 25 value.
The variable c is assigned a negative a value.
The variable d is assigned a positive b value.
a = - 25; / / Assi gn a a negat i ve 25.
b = +25; / / Assi gn b a posi t i ve 25 ( + i s not needed) .
c = - a; / / Assi gn c t he negat i ve of a ( - 25) .
d = +b; / / Assi gn d t he posi t i ve of b ( 25, + not needed) .
Chapter 8 o U sing C ++ M ath O perators and Precedence
166
2. You generally do not have to use the unary plus sign. C++
assumes a number or variable is positive, even if it has no
plus sign. The following four statements are equivalent to
the previous four, except they do not contain plus signs.
a = - 25; / / Assi gn a a negat i ve 25.
b = 25; / / Assi gn b a posi t i ve 25.
c = - a; / / Assi gn c t he negat i ve of a ( - 25) .
d = b; / / Assi gn d t he posi t i ve of b ( 25) .
3. The unary negative comes in handy when you want to
negate a single number or variable. The negative of a nega-
tive is positive. Therefore, the following short program
assigns a negative number (using the unary ) to a variable,
then prints the negative of that same variable. Because it had
a negative number to begin with, the cout produces a posi-
tive result.
/ / Fi l ename: C8NEG. CPP
/ / The negat i ve of a var i abl e t hat cont ai ns a negat i ve val ue.
#i ncl ude <i ost r eam. h>
mai n( )
{
si gned i nt t emp=- 12; / / si gned i s not needed because
/ / i t i s t he def aul t .
cout << - t emp << \ n; / / Pr oduces a 12 on- scr een.
r et ur n 0;
}
The variable declaration does not need the signed prefix,
because all integer variables are signed by default.
4. If you want to subtract the negative of a variable, make sure
you put a space before the unary minus sign. For example,
the following line:
new_t emp + new_t emp- - i nver si on_f act or ;
temporarily negates the i nver si on_f act or and subtracts that
negated value from new_t emp.
167
EXAMPLE
C+ + By
Division and Modulus
The division sign, / , and the modulus operator, %, might behave
in ways unfamiliar to you. Theyre as easy to use, however, as the
other operators you have just seen.
The forward slash (/ ) is always used for division. However, it
produces an integer called di vi de if integer values (literals, variables,
or a combination of both) appear on both sides of the slash. If there
is a remainder, C++ discards it.
The percent sign (%) produces a modulus, or a remainder, of an
integer division. It requires that integers be on both sides of the
symbol, or it does not work.
Examples
1. Suppose you want to compute your weekly pay. The follow-
ing program asks for your yearly pay, divides it by 52, and
prints the results to two decimal places.
/ / Fi l ename: C8DI V. CPP
/ / Di spl ays user s weekl y pay.
#i ncl ude <st di o. h>
mai n( )
{
f l oat weekl y, year l y;
pr i nt f ( What i s your annual pay? ) ; / / Pr ompt user .
scanf ( %f , &year l y) ;
weekl y = year l y/ 52; / / Comput es t he weekl y pay.
pr i nt f ( \ n\ nYour weekl y pay i s $%. 2f , weekl y) ;
r et ur n 0;
}
Because a floating-point number is used in the division, C++
produces a floating-point result. Here is a sample output
from such a program:
What i s your annual pay? 38000. 00
Your weekl y pay i s $730. 77
The modul us (%)
computes
remai nders i n
di vi si on.
Chapter 8 o U sing C ++ M ath O perators and Precedence
168
Because this program used scanf ( ) and pr i nt f ( ) (to keep you
familiar with both ways of performing input and output),
the stdio.h header file is included rather than iostream.h.
2. Integer division does not round its results. If you divide two
integers and the answer is not a whole number, C++ ignores
the fractional part. The following pr i nt f ( ) s help show this.
The output that results from each pr i nt f ( ) appears in the
comment to the right of each line.
pr i nt f ( %d \ n, 10/ 2) ; / / 5 ( no r emai nder )
pr i nt f ( %d \ n, 300/ 100) ; / / 3 ( no r emai nder )
pr i nt f ( %d \ n, 10/ 3) ; / / 3 ( di scar ded r emai nder )
pr i nt f ( %d \ n, 300/ 165) ; / / 1 ( di scar ded r emai nder )
The Order of Prec edenc e
Understanding the math operators is the first of two steps toward
understanding C++ calculations. You must also understand the order of
precedence. The order of precedence (sometimes called the math hierarchy
or order of operators) determines exactly how C++ computes formulas.
The precedence of operators is exactly the same concept you learned in
high school algebra courses. (Dont worry, this is the easy part of
algebra!) To see how the order of precedence works, try to determine
the result of the following simple calculation:
2 + 3 * 2
If you said 10, you are not alone; many people respond with 10.
However, 10 is correct only if you interpret the formula from the left.
What if you calculated the multiplication first? If you took the value
of 3 * 2 and got an answer of 6, then added the 2, you receive an
answer of 8which is exactly the same answer that C++ computes
(and happens to be the correct way)!
C++ always performs multiplication, division, and modulus
first, then addition and subtraction. Table 8.3 shows the order of the
operators you have seen so far. Of course, there are many more
levels to C++s precedence table of operators than the ones shown in
Table 8.3. Unlike most computer languages, C++ has 20 levels of
precedence. Appendix D, C++ Precedence Table, contains the
complete precedence table. Notice in this appendix that multiplica-
tion, division, and modulus reside on level 8, one level higher than
C++ performs
mul ti pl i cati on,
di vi si on, and
modul us before
addi ti on and
subtracti on.
169
EXAMPLE
C+ + By
level 9s addition and subtraction. In the next few chapters, you learn
how to use the remainder of this precedence table in your C++
programs.
Table 8.3. Order of prec edenc e for primary operators.
Order Operator
First Multiplication, division, modulus remainder (*, / , %)
Second Addition, subtraction (+, - )
Examples
1. It is easy to follow C++s order of operators if you follow the
intermediate results one at a time. The three calculations in
Figure 8.1 show you how to do this.
6 + 2 * 3 - 4 / 2
6 + 6 - 4 / 2
6 + 6 - 2
12 - 2
10
3 * 4 / 2 + 3 - 1
12 / 2 + 3 - 1
6 + 3 - 1
9 - 1
8
20 / 3 + 5 %2
6 + 5 %2
6 + 1
7
Figure 8.1. C++s order of operators with lines indicating precedence.
Chapter 8 o U sing C ++ M ath O perators and Precedence
170
2. Looking back at the order of precedence table, you might
notice that multiplication, division, and modulus are on the
same level. This implies there is no hierarchy on that level. If
more than one of these operators appear in a calculation,
C++ performs the math from the left. The same is true of
addition and subtractionC++ performs the operation on
the extreme left first.
Figure 8.2 illustrates an example showing this process.
10 / 5 * 2 - 2 + 1
2 * 2 - 2 + 1
4 - 2 + 1
2 + 1
3
Figure 8.2. C++s order of operators from the left, with lines indicating
precedence.
Because the division appears to the left of the multiplication,
it is computed first.
You now should be able to follow the order of these C++
operators. You dont have to worry about the math because C++
does the actual work. However, you should understand this order
of operators so you know how to structure your calculations. Now
that you have mastered this order, its time to learn how you can
override it with parentheses!
Using Parentheses
If you want to override the order of precedence, you can add
parentheses to the calculation. The parentheses actually reside on a
level above the multiplication, division, and modulus in the prece-
dence table. In other words, any calculation in parentheseswhether
it is addition, subtraction, division, or whateveris always calcu-
lated before the rest of the line. The other calculations are then
performed in their normal operator order.
171
EXAMPLE
C+ + By
The first formula in this chapter, 2 +3 * 2, produced an 8 because
the multiplication was performed before addition. However, by
adding parentheses around the addition, as in ( 2 +3) * 2, the answer
becomes 10.
In the precedence table shown in Appendix D, C++ Prece-
dence Table, the parentheses reside on level 3. Because they are
higher than the other levels, the parentheses take precedence over
multiplication, division, and all other operators.
Examples
1. The calculations shown in Figure 8.3 illustrate how paren-
theses override the regular order of operators. These are the
same three formulas shown in the previous section, but their
results are calculated differently because the parentheses
override the normal order of operators.
6 + 2 * ( 3 - 4) / 2
6 + 2 * - 1 / 2
6 + - 2 / 2
6 + - 1
5
3 * 4 / 2 + ( 3 - 1)
3 * 4 / 2 + 2
12 / 2 + 2
6 + 2
8
20 / ( 3 + 5) %2
20 / 8 %2
2 %2
0
Figure 8.3. Example of parentheses as the highest precedence level
with lines indicating precedence.
Parentheses overri de
the usual order of
math.
Chapter 8 o U sing C ++ M ath O perators and Precedence
172
2. If an expression contains parentheses-within-parentheses,
C++ evaluates the innermost parentheses first. The expres-
sions in Figure 8.4 illustrate this.
5 * ( 5 + ( 6 - 2) + 1)
5 * ( 5 + 4 + 1)
5 * ( 9 + 1)
5 * 10
50
Figure 8.4. Precedence example of parentheses-within-parentheses
with lines indicating precedence.
3. The following program produces an incorrect result, even
though it looks as if it will work. See if you can spot the
error!
Comments to identify your program.
Include the header file iostream.h so cout works.
Declare the variables avg, gr ade1, gr ade2, and gr ade3 as floating-
point variables.
The variable avg becomes equal to gr ade3 divided by 3.0 plus
gr ade2 plus gr ade1.
Print to the screen The aver age i s and the average of the three
grade variables.
Return to the operating system.
/ / Fi l ename: C8AVG1. CPP
/ / Comput e t he aver age of t hr ee gr ades.
#i ncl ude <i ost r eam. h>
mai n( )
{
f l oat avg, gr ade1, gr ade2, gr ade3;
gr ade1 = 87. 5;
gr ade2 = 92. 4;
gr ade3 = 79. 6;
173
EXAMPLE
C+ + By
avg = gr ade1 + gr ade2 + gr ade3 / 3. 0;
cout << The aver age i s << avg << \ n;
r et ur n 0;
}
The problem is that division is performed first. Therefore,
the third grade is divided by 3.0 first, then the other two
grades are added to that result. To correct this problem, you
simply have to add one set of parentheses, as shown in the
following:
/ / Fi l ename: C8AVG2. CPP
/ / Comput e t he aver age of t hr ee gr ades.
#i ncl ude <i ost r eam. h>
mai n( )
{
f l oat avg, gr ade1, gr ade2, gr ade3;
gr ade1 = 87. 5;
gr ade2 = 92. 4;
gr ade3 = 79. 6;
avg = ( gr ade1 + gr ade2 + gr ade3) / 3. 0;
cout << The aver age i s << avg << \ n;
r et ur n 0;
}
TIP: Use plenty of parentheses in your C++ programs to clarify
the order of operators, even when you dont have to override
their default order. Using parentheses makes the calculations
easier to understand later, when you might have to modify the
program.
Shorter Is Not Always Better
When you program computers for a living, it is much more
important to write programs that are easy to understand than
programs that are short or include tricky calculations.
Chapter 8 o U sing C ++ M ath O perators and Precedence
174
Maintainability is the computer industrys word for the chang-
ing and updating of programs previously written in a simple
style. The business world is changing rapidly, and the pro-
grams companies have used for years must often be updated to
reflect this changing environment. Businesses do not always
have the resources to write programs from scratch, so they
usually modify the ones they have.
Years ago when computer hardware was much more expen-
sive, and when computer memories were much smaller, it was
important to write small programs, which often meant relying
on clever, individualized tricks and shortcuts. Unfortunately,
such programs are often difficult to revise, especially if the
original programmers leave and someone else (you!) must
modify the original code.
Companies are realizing the importance of spending time to
write programs that are easy to modify and that do not rely on
tricks, or quick and dirty routines that are hard to follow. You
can be a much more valuable programmer if you write clean
programs with ample white space, frequent remarks, and
straightforward code. Use parentheses in formulas if it makes
the formulas clearer, and use variables for storing results in
case you need the same answer later in the program. Break
long calculations into several smaller ones.
Throughout the remainder of this book, you can read tips on
writing maintainable programs. You and your colleagues will
appreciate these tips when you incorporate them in your own
C++ programs.
The Assignment Statements
In C++, the assignment operator, =, behaves differently from
what you might be used to in other languages. So far, you have used
it to assign values to variables, which is consistent with its use in
most other programming languages.
However, the assignment operator also can be used in other
ways, such as multiple assignment statements and compound as-
signments, as the following sections illustrate.
175
EXAMPLE
C+ + By
Multiple Assignments
If two or more equal signs appear in an expression, each
performs an assignment. This fact introduces a new aspect of the
precedence order you should understand. Consider the following
expression:
a=b=c=d=e=100;
This might at first seem confusing, especially if you know other
computer languages. To C++, the equal sign always means: Assign
the value on the right to the variable on the left. This right-to-left
order is described in Appendix Ds precedence table. The third
column in the table is labeled Associativity, which describes the
direction of the operation. The assignment operator associates from
the right, whereas some of the other C++ operators associate from
the left.
Because the assignment associates from the right, the previous
expression assigns 100 to the variable named e. This assignment
produces a value, 100, for the expression. In C++, all expressions
produce values, typically the result of assignments. Therefore, 100 is
assigned to the variable d. The value, 100, is assigned to c, then to b,
and finally to a. The old values of these variables are replaced by 100
after the statement finishes.
Because C++ does not automatically set variables to zero before
you use them, you might want to do so before you use the variables
with a single assignment statement. The following section of vari-
able declarations and initializations is performed using multiple
assignment statements.
mai n( )
{
i nt ct r , num_emp, num_dep;
f l oat sal es, sal ar y, amount ;
ct r =num_emp=num_dep=0;
sal es=sal ar y=amount =0;
/ / Rest of pr ogr amf ol l ows.
In C++, you can include the assignment statement almost
anywhere in a program, even in another calculation. For example,
consider this statement:
Chapter 8 o U sing C ++ M ath O perators and Precedence
176
val ue = 5 + ( r = 9 - c) ;
which is a perfectly legal C++ statement. The assignment operator
resides on the first level of the precedence table, and always pro-
duces a value. Because its associativity is from the right, the r is
assigned 9 - c because the equal sign on the extreme right is
evaluated first. The subexpression (r =9 - c) produces a value (and
places that value in r ), which is then added to 5 before storing the
answer in val ue.
Example
Because C++ does not initialize variables to zero before you use
them, you might want to include a multiple assignment operator to
do so before using the variables. The following section of code
ensures that all variables are initialized before the rest of the pro-
gram uses them.
mai n( )
{
i nt num_emp, dependent s, age;
f l oat sal ar y, hr _r at e, t axr at e;
/ / I ni t i al i ze al l var i abl es t o zer o.
num_emp=dependent s=age=hour s=0;
sal ar y=hr _r at e=t axr at e=0. 0;
/ / Rest of pr ogr amf ol l ows.
Compound Assignments
Many times in programming, you might want to update the
value of a variable. In other words, you have to take a variables
current value, add or multiply that value by an expression, then
reassign it to the original variable. The following assignment state-
ment demonstrates this process:
sal ar y=sal ar y*1. 2;
177
EXAMPLE
C+ + By
This expression multiplies the old value of sal ar y by 1.2 (in
effect, raising the value in sal ar y by 20 percent), then reassigns it to
sal ar y. C++ provides several operators, called compound operators,
that you can use any time the same variable appears on both sides
of the equal sign. The compound operators are shown in Table 8.4.
Table 8.4. C++s c ompound operators.
Operator Example Equivalent
+= bonus+=500; bonus=bonus+500;
- = budget - =50; budget =budget - 50;
*= sal ar y*=1. 2; sal ar y=sal ar y*1. 2;
/ = f act or / =. 50; f act or =f act or / . 50;
%= daynum%=7; daynum=daynum%7;
The compound operators are low in the precedence table. They
typically are evaluated last or near-last.
Examples
1. You have been storing your factorys production amount
in a variable called pr od_amt , and your supervisor has just
informed you that a new addition has to be applied to the
production value. You could code this update in a statement,
as follows:
pr od_amt = pr od_amt + 2. 6; / / Add 2. 6 t o cur r ent pr oduct i on.
Instead of using this formula, use C++s compound addition
operator by coding it like this:
pr od_amt += 2. 6; / / Add 2. 6 t o cur r ent pr oduct i on.
2. Suppose you are a high school teacher who wants to raise
your students grades. You gave a test that was too difficult,
and the grades were not what you expected. If you had
stored each of the students grades in variables named
gr ade1, gr ade2, gr ade3, and so on, you can update the grades
in a program with the following section of compound
assignments.
Chapter 8 o U sing C ++ M ath O perators and Precedence
178
gr ade1*=1. 1; / / I ncr ease each st udent s gr ade by 10.
per cent .
gr ade2*=1. 1;
gr ade3*=1. 1;
/ / Rest of gr ade changes f ol l ow.
3. The precedence of the compound operators requires impor-
tant consideration when you decide how to code compound
assignments. Notice from Appendix D, C++ Precedence
Table, that the compound operators are on level 19, much
lower than the regular math operators. This means you must
be careful how you interpret them.
For example, suppose you want to update the value of a
sal es variable with this formula:
4- f act or +bonus
You can update the sal es variable with the following
statement:
sal es = *4 - f act or + bonus;
This statement adds the quantity 4- f act or +bonus to sal es. Due
to operator precedence, this statement is not the same as the
following one:
sal es = sal es *4 - f act or + bonus;
Because the *=operator is much lower in the precedence
table than * or - , it is performed last, and with right-to-left
associativity. Therefore, the following are equivalent, from a
precedence viewpoint:
sal es *= 4 - f act or + bonus;
and
sal es = sal es * ( 4 - f act or + bonus) ;
Mixing Data Type s
in Calc ulations
You can mix data types in C++. Adding an integer and a
floating-point value is mixing data types. C++ generally converts
179
EXAMPLE
C+ + By
the smaller of the two types into the other. For instance, if you add
a double to an integer, C++ first converts the integer into a double
value, then performs the calculation. This method produces the
most accurate result possible. The automatic conversion of data
types is only temporary; the converted value is back in its original
data type as soon as the expression is finished.
If C++ converted two different data types to the smaller values
type, the higher-precision value is truncated, or shortened, and
accuracy is lost. For example, in the following short program, the
floating-point value of sal es is added to an integer called bonus.
Before C++ computes the answer, it converts bonus to floating-point,
which results in a floating-point answer.
/ / Fi l ename: C8DATA. CPP
/ / Demonst r at e mi xed dat a t ype i n an expr essi on.
#i ncl ude <st di o. h>
mai n( )
{
i nt bonus=50;
f l oat sal ar y=1400. 50;
f l oat t ot al ;
t ot al =sal ar y+bonus; / / bonus becomes f l oat i ng- poi nt
/ / but onl y t empor ar i l y.
pr i nt f ( The t ot al i s %. 2f , t ot al ) ;
r et ur n 0;
}
Type Casting
Most of the time, you dont have to worry about C++s auto-
matic conversion of data types. However, problems can occur if you
mix unsigned variables with variables of other data types. Due to
differences in computer architecture, unsigned variables do not
always convert to the larger data type. This can result in loss of
accuracy, and even incorrect results.
You can override C++s default conversions by specifying your
own temporary type change. This process is called type casting.
When you type cast, you temporarily change a variables data type
C++ attempts to
convert the smal l er
data type to the
l arger one i n a
mi xed data- type
expressi on.
Chapter 8 o U sing C ++ M ath O perators and Precedence
180
from its declared data type to a new one. There are two formats of
the type cast. They are
( dat a t ype) expr essi on
and
dat a t ype( expr essi on)
where dat a t ype can be any valid C++ data type, such as i nt or f l oat ,
and the expr essi on can be a variable, literal, or an expression that
combines both. The following code temporarily type casts the
integer variable age into a double floating-point variable, so it can be
multiplied by the double floating-point f act or . Both formats of the
type cast are illustrated.
The variable age_f act or is assigned the value of the variable age (now
treated like a double floating-point variable) multiplied by the variable
f act or .
age_f act or = ( doubl e) age * f act or ; / / Tempor ar i l y change age
/ / t o doubl e.
The second way of type casting adds the parentheses around
the variable rather than the data type, as so:
age_f act or = doubl e( age) * f act or ; / / Tempor ar i l y change age
/ / t o doubl e.
NOTE: Type casting by adding the parentheses around the
expression and not the data type is new to C++. C programmers
do not have the optionthey must put the data type in paren-
theses. The second method feels like a function call and
seems to be more natural for this language. Therefore, becom-
ing familiar with the second method will clarify your code.
181
EXAMPLE
C+ + By
Examples
1. Suppose you want to verify the interest calculation used by
your bank on a loan. The interest rate is 15.5 percent, stored
as .155 in a floating-point variable. The amount of interest
you owe is computed by multiplying the interest rate by the
amount of the loan balance, then multiplying that by the
number of days in the year since the loan originated. The
following program finds the daily interest rate by dividing
the annual interest rate by 365, the number of days in a year.
C++ must convert the integer 365 to a floating-point literal
automatically, because it is used in combination with a
floating-point variable.
/ / Fi l ename: C8I NT1. CPP
/ / Cal cul at e i nt er est on a l oan.
#i ncl ude <st di o. h>
mai n( )
{
i nt days=45; / / Days si nce l oan or i gi nat i on.
f l oat pr i nci pl e = 3500. 00; / / Or i gi nal l oan amount
f l oat i nt er est _r at e=0. 155; / / Annual i nt er est r at e
f l oat dai l y_i nt er est ; / / Dai l y i nt er est r at e
dai l y_i nt er est =i nt er est _r at e/ 365; / / Comput e f l oat i ng-
/ / poi nt val ue.
/ / Because days i s i nt , i t t oo i s conver t ed t o f l oat .
dai l y_i nt er est = pr i nci pl e * dai l y_i nt er est * days;
pr i nci pl e+=dai l y_i nt er est ; / / Updat e pr i nci pl e wi t h i nt er est .
pr i nt f ( The bal ance you owe i s %. 2f \ n, pr i nci pl e) ;
r et ur n 0;
}
The output of this program follows:
The bal ance you owe i s 3566. 88
Chapter 8 o U sing C ++ M ath O perators and Precedence
182
2. Instead of having C++ perform the conversion, you might
want to type cast all mixed expressions to ensure they
convert to your liking. Here is the same program as in the
first example, except type casts are used to convert the
integer literals to floating-points before they are used.
/ / Fi l ename: C8I NT2. CPP
/ / Cal cul at e i nt er est on a l oan usi ng t ype cast i ng.
#i ncl ude <st di o. h>
mai n( )
{
i nt days=45; / / Days si nce l oan or i gi nat i on.
f l oat pr i nci pl e = 3500. 00; / / Or i gi nal l oan amount
f l oat i nt er est _r at e=0. 155; / / Annual i nt er est r at e
f l oat dai l y_i nt er est ; / / Dai l y i nt er est r at e
dai l y_i nt er est =i nt er est _r at e/ f l oat ( 365) ; / / Type cast days
/ / t o f l oat .
/ / Because days i s i nt eger , conver t i t t o f l oat al so.
dai l y_i nt er est = pr i nci pl e * dai l y_i nt er est * f l oat ( days) ;
pr i nci pl e+=dai l y_i nt er est ; / / Updat e pr i nci pl e wi t h i nt er est .
pr i nt f ( The bal ance you owe i s %. 2f , pr i nci pl e) ;
r et ur n 0;
}
The output from this program is exactly the same as the
previous one.
Review Questions
The answers to the review questions are in Appendix B.
1. What is the result for each of the following expressions?
a. 1 + 2 * 4 / 2
b. ( 1 + 2) * 4 / 2
c. 1 + 2 * ( 4 / 2)
183
EXAMPLE
C+ + By
2. What is the result for each of the following expressions?
a. 9 %2 + 1
b. ( 1 + ( 10 - ( 2 + 2) ) )
3. Convert each of the following formulas into its C++ assign-
ment equivalents.
3 + 3
a. a =
4 + 4
b. x = ( a - b) *( a - c) 2
a2
c. f =
b3
( 8 - x2) ( 4 * 2 - 1)
d. d = -
( x - 9) x3
4. Write a short program that prints the area of a circle, when
its radius equals 4 and equals 3.14159. (Hint: The area of a
circle is computed by * radius
2
.)
5. Write the assignment and pr i nt f ( ) statements that print the
remainder of 100/3.
Review Exerc ises
1. Write a program that prints each of the first eight powers
of 2 (21, 22, 23,...28). Please write comments and include
your name at the top of the program. Print string literals
that describe each answer printed. The first two lines of
your output should look like this:
2 r ai sed t o t he f i r st power i s 2
2 r ai sed t o t he second power i s 4
Chapter 8 o U sing C ++ M ath O perators and Precedence
184
2. Change C8PAY.CPP so it computes and prints a bonus of 15
percent of the gross pay. Taxes are not to be taken out of the
bonus. After printing the four variables, gr oss_pay, t ax_r at e,
bonus, and gr oss_pay, print a check on-screen that looks like
a printed check. Add string literals so it prints the check-
holder and put your name as the payer at the bottom of the
check.
3. Store the weights and ages of three people in variables. Print
a table, with titles, of the weights and ages. At the bottom of
the table, print the averages.
4. Assume that a video store employee works 50 hours. He is
paid $4.50 for the first 40 hours, time-and-a-half (1.5 times
the regular pay rate) for the first five hours over 40, and
double-time pay for all hours over 45. Assuming a 28 per-
cent tax rate, write a program that prints his gross pay, taxes,
and net pay to the screen. Label each amount with appropri-
ate titles (using string literals) and add appropriate com-
ments in the program.
Summary
You now understand C++s primary math operators and the
importance of the precedence table. Parentheses group operations
so they can override the default precedence levels. Unlike some
other programming languages, every operator in C++ has a mean-
ing, no matter where it appears in an expression. This fact enables
you to use the assignment operator (the equal sign) in the middle of
other expressions.
When you perform math with C++, you also must be aware of
how C++ interprets data types, especially when you mix them in the
same expression. Of course, you can temporarily type cast a variable
or literal so you can override its default data type.
This chapter has introduced you to a part of the book concerned
with C++ operators. The following two chapters (Chapter 9, Rela-
tional Operators, and Chapter 10, Logical Operators) extend this
introduction to include relational and logical operators. They enable
you to compare data and compute accordingly.
185
EXAMPLE
C+ + By
9
Relational
Operators
Sometimes you wont want every statement in your C++ program to
execute every time the program runs. So far, every program in this
book has executed from the top and has continued, line-by-line,
until the last statement completes. Depending on your application,
you might not always want this to happen.
Programs that dont always execute by rote are known as data-
driven programs. In data-driven programs, the data dictates what
the program does. You would not want the computer to print every
employees paychecks for every pay period, for example, because
some employees might be on vacation, or they might be paid on
commission and not have made a sale during that period. Printing
paychecks with zero dollars is ridiculous. You want the computer to
print checks only for employees who have worked.
This chapter shows you how to create data-driven programs.
These programs do not execute the same way every time. This is
possible through the use of relational operators that conditionally
control other statements. Relational operators first look at the
literals and variables in the program, then operate according to what
they find. This might sound like difficult programming, but it is
actually straightforward and intuitive.
Chapter 9 o Relational O perators
186
This chapter introduces you to
o Relational operators
o The i f statement
o The el se statement
Not only does this chapter introduce these comparison com-
mands, but it prepares you for much more powerful programs,
possible once you learn the relational operators.
Defining Relational Operators
In addition to the math operators you learned in Chapter 8,
Using C++ Math Operators and Precedence, there are also opera-
tors that you use for data comparisons. They are called relational
operators, and their task is to compare data. They enable you to
determine whether two variables are equal, not equal, and which
one is less than the other. Table 9.1 lists each relational operator and
its meaning.
Table 9.1. The relational operators.
Operator Description
== Equal to
> Greater than
< Less than
>= Greater than or equal to
<= Less than or equal to
! = Not equal to
The six relational operators form the foundation of data com-
parison in C++ programming. They always appear with two literals,
variables, expressions (or some combination of these), one on each
side of the operator. These relational operators are useful and you
should know them as well as you know the +, - , *, / , and %mathemati-
cal operators.
Rel ati onal operators
compare data.
187
EXAMPLE
C+ + By
NOTE: Unlike many programming languages, C++ uses a
double equal sign (==) as a test for equality. The single equal
sign (=) is reserved for assignment of values.
Examples
1. Assume that a program initializes four variables as follows:
i nt a=5;
i nt b=10;
i nt c=15;
i nt d=5;
The following statements are then True:
a is equal to d, so a == d
b is less than c, so b < c
c is greater than a, so c > a
b is greater than or equal to a, so b >= a
d is less than or equal to b, so d <= b
b is not equal to c, so b ! = c
These are not C++ statements; they are statements of com-
parison (relational logic) between values in the variables.
Relational logic is easy.
Relational logic always produces a True or False result. In
C++, unlike some other programming languages, you can
directly use the True or False result of relational operators
inside other expressions. You will soon learn how to do this;
but for now, you have to understand only that the following
True and False evaluations are correct:
o A True relational result evaluates to 1.
o A False relational result evaluates to 0.
Chapter 9 o Relational O perators
188
Each of the statements presented earlier in this example
evaluates to a 1, or True, result.
2. If you assume the same values as stated for the previous
examples four variables, each of the values statements is
False (0):
a == b
b > c
d < a
d > a
a ! = d
b >= c
c <= b
Study these statements to see why each is False and evalu-
ates to 0. The variables a and d, for example, are exactly
equal to the same value (5), so neither is greater or less than
the other.
You use relational logic in everyday life. Think of the follow-
ing statements:
The generic butter costs less than the name brand.
My child is younger than Johnny.
Our salaries are equal.
The dogs are not the same age.
Each of these statements can be either True or False. There is
no other possible answer.
Watch the Signs!
Many people say they are not math-inclined or not logical,
and you might be one of them. But, as mentioned in Chapter 8,
you do not have to be good in math to be a good computer
programmer. Neither should you be frightened by the term
189
EXAMPLE
C+ + By
relational logic, because you just saw how you use it in every-
day life. Nevertheless, symbols confuse some people.
The two primary relational operators, less than (<) and greater
than (>), are easy to remember. You probably learned this
concept in school, but might have forgotten it. Actually, their
signs tell you what they mean.
The arrow points to the lesser of the two values. Notice how, in
the previous Example 1, the arrow (the point of the <or >)
always points to the lesser number. The larger, open part of the
arrow points to the larger number.
The relation is False if the arrow is pointing the wrong way. In
other words, 4 > 9 is False because the operator symbol is
pointing to the 9, which is not the lesser number. In English this
statement says, 4 is greater than 9, which is clearly false.
The i f Statement
You incorporate relational operators in C++ programs with the
if statement. Such an expression is called a decision statement because
it tests a relationshipusing the relational operatorsand, based
on the tests result, makes a decision about which statement to
execute next.
The i f statement appears as follows:
i f ( condi t i on)
{ bl ock of one or mor e C++ st at ement s }
The condi t i on includes any relational comparison, and it must
be enclosed in parentheses. You saw several relational comparisons
earlier, such as a==d, c<d, and so on. The bl ock of one or mor e C++
st at ement s is any C++ statement, such as an assignment or pr i nt f ( ) ,
enclosed in braces. The block of the i f , sometimes called the body of
the i f statement, is usually indented a few spaces for readability.
This enables you to see, at a glance, exactly what executes if condi t i on
is True.
Chapter 9 o Relational O perators
190
If only one statement follows the i f , the braces are not required
(but it is always good to include them). The block executes only if
condi t i on is True. If condi t i on is False, C++ ignores the block and
simply executes the next appropriate statement in the program that
follows the i f statement.
Basically, you can read an i f statement in the following way: If
the condition is True, perform the block of statements inside the
braces. Otherwise, the condition must be False; so do not execute
that block, but continue executing the remainder of the program as
though this i f statement did not exist.
The i f statement is used to make a decision. The block of
statements following the i f executes if the decision (the result of the
relation) is True, but the block does not execute otherwise. As with
relational logic, you also use if logic in everyday life. Consider the
statements that follow.
If the day is warm, I will go swimming.
If I make enough money, we will build a new house.
If the light is green, go.
If the light is red, stop.
Each of these statements is conditional. That is, if and only if the
condition is true do you perform the activity.
CAUTION: Do not type a semicolon after the parentheses of
the relational test. Semicolons appear after each statement
inside the block.
Expressions as the Condition
C++ interprets any nonzero value as True, and zero always as
False. This enables you to insert regular nonconditional expres-
sions in the i f logic. To understand this concept, consider the
following section of code:
The i f statement
makes a deci si on.
191
EXAMPLE
C+ + By
mai n( )
{
i nt age=21; / / Decl ar es and assi gns age as 21.
i f ( age=85)
{ cout << You have l i ved t hr ough a l ot ! ; }
/ / Remai ni ng pr ogr amcode goes her e.
At first, it might seem as though the pr i nt f ( ) does not execute,
but it does! Because the code line used a regular assignment
operator (=) (not a relational operator, ==), C++ performs the
assignment of 85 to age. This, as with all assignments you saw
in Chapter 8, Using C++ Math Operators and Precedence,
produces a value for the expression of 85. Because 85 is nonzero,
C++ interprets the i f condition as True and then performs the
body of the i f statement.
Confusing the relational equality test (==) with the regular
assignment operator (=) is a common error in C++ programs,
and the nonzero True test makes this bug even more difficult to
find.
The designers of C++ didnt intend for this to confuse you.
They want you to take advantage of this feature whenever you
can. Instead of putting an assignment before an i f and testing
the result of that assignment, you can combine the assignment
and i f into a single statement.
Test your understanding of this by considering this: Would
C++ interpret the following condition as True or False?
i f ( 10 == 10 == 10) ...
Be careful! At first glance, it seems True; but C++ interprets it
as False! Because the == operator associates from the left, the
program compares the first 10 to the second. Because they are
equal, the result is 1 (for True) and the 1 is then compared to the
third 10which results in a 0 (for False)!
Chapter 9 o Relational O perators
192
Examples
1. The following are examples of valid C++ i f statements.
If (the variable sal es is greater than 5000), then the variable bonus
becomes equal to 500.
i f ( sal es > 5000)
{ bonus = 500; }
If this is part of a C++ program, the value inside the variable
sal es determines what happens next. If sal es contains more
than 5000, the next statement that executes is the one inside
the block that initializes bonus. If, however, sal es contains
5000 or less, the block does not execute, and the line follow-
ing the i f s block executes.
If (the variable age is less than or equal to 21) then print You ar e a
mi nor . to the screen and go to a new line, print What i s your
gr ade? to the screen, and accept an integer from the keyboard.
i f ( age <= 21)
{ cout << You ar e a mi nor . \ n;
cout << What i s your gr ade? ;
ci n >> gr ade; }
If the value in age is less than or equal to 21, the lines of code
within the block execute next. Otherwise, C++ skips the
entire block and continues with the remaining program.
If (the variable bal ance is greater than the variable l ow_bal ance),
then print Past due! to the screen and move the cursor to a new
line.
i f ( bal ance > l ow_bal ance)
{cout << Past due! \ n; }
If the value in bal ance is more than that in l ow_bal ance, execu-
tion of the program continues at the block and the message
Past due! prints on-screen. You can compare two variables
to each other (as in this example), or a variable to a literal (as
in the previous examples), or a literal to a literal (although
this is rarely done), or a literal to any expression in place of
any variable or literal. The following i f statement shows an
expression included in the i f .
193
EXAMPLE
C+ + By
If (the variable pay multiplied by the variable t ax_r at e equals the
variable mi ni mum), then the variable l ow_sal ar y is assigned 1400. 60.
I f ( pay * t ax_r at e == mi ni mum)
{ l ow_sal ar y = 1400. 60; }
The precedence table of operators in Appendix D, C++
Precedence Table, includes the relational operators. They
are at levels 11 and 12, lower than the other primary math
operators. When you use expressions such as the one shown
in this example, you can make these expressions much more
readable by enclosing them in parentheses (even though
C++ does not require it). Here is a rewrite of the previous i f
statement with ample parentheses:
If (the variable pay (multiplied by the variable t ax_r at e) equals the
variable mi ni mum), then the variable l ow_sal ar y is assigned 1400. 60.
I f ( ( pay * t ax_r at e) == mi ni mum)
{ l ow_sal ar y = 1400. 60; }
2. The following is a simple program that computes a
salespersons pay. The salesperson receives a flat rate of
$4.10 per hour. In addition, if sales are more than $8,500, the
salesperson also receives an additional $500 as a bonus. This
is an introductory example of conditional logic, which
depends on a relation between two values, sal es and $8500.
/ / Fi l ename: C9PAY1. CPP
/ / Cal cul at es a sal esper son s pay based on hi s or her sal es.
#i ncl ude <i ost r eam. h>
#i ncl ude <st di o. h>
mai n( )
{
char sal _name[ 20] ;
i nt hour s;
f l oat t ot al _sal es, bonus, pay;
cout << \ n\ n; / / Pr i nt t wo bl ank l i nes.
cout << Payr ol l Cal cul at i on\ n;
cout << - - - - - - - - - - - - - - - - - - - \ n;
Chapter 9 o Relational O perators
194
/ / Ask t he user f or needed val ues.
cout << What i s sal esper son s l ast name? ;
ci n >> sal _name;
cout << How many hour s di d t he sal esper son wor k? ;
ci n >> hour s;
cout << What wer e t he t ot al sal es? ;
ci n >> t ot al _sal es;
bonus = 0; / / I ni t i al l y, t her e i s no bonus.
/ / Comput e t he base pay.
pay = 4. 10 * ( f l oat ) hour s; / / Type cast s t he hour s.
/ / Add bonus onl y i f sal es wer e hi gh.
i f ( t ot al _sal es > 8500. 00)
{ bonus = 500. 00; }
pr i nt f ( %s made $%. 2f \ n, sal _name, pay) ;
pr i nt f ( and got a bonus of $%. 2f , bonus) ;
r et ur n 0;
}
This program uses cout , ci n, and pr i nt f ( ) for its input and
output. You can mix them. Include the appropriate header
files if you do (stdio.h and iostream.h).
The following output shows the result of running this
program twice, each time with different input values. Notice
that the program does two different things: It computes a
bonus for one employee, but doesnt for the other. The $500
bonus is a direct result of the i f statement. The assignment
of $500 to bonus executes only if the value in t ot al _sal es is
more than $8500.
Payr ol l Cal cul at i on
- - - - - - - - - - - - - - - - - - -
What i s sal esper son s l ast name? Har r i son
How many hour s di d t he sal esper son wor k? 40
What wer e t he t ot al sal es? 6050. 64
Har r i son made $164. 00
and got a bonus of $0. 00
195
EXAMPLE
C+ + By
Payr ol l Cal cul at i on
- - - - - - - - - - - - - - - - - - -
What i s sal esper son s l ast name? Rober t son
How many hour s di d t he sal esper son wor k? 40
What wer e t he t ot al sal es? 9800
Rober t son made $164. 00
and got a bonus of $500. 00
3. When programming the way users input data, it is wise to
program data validation on the values they type. If they enter
a bad value (for instance, a negative number when the input
cannot be negative), you can inform them of the problem
and ask them to reenter the data.
Not all data can be validated, of course, but most of it can be
checked for reasonableness. For example, if you write a
student record-keeping program, to track each students
name, address, age, and other pertinent data, you can check
whether the age falls in a reasonable range. If the user enters
213 for the age, you know the value is incorrect. If the user
enters - 4 for the age, you know this value is also incorrect.
Not all erroneous input for age can be checked, however. If
the user is 21, for instance, and types 22, your program has
no way of knowing whether this is correct, because 22 falls
in a reasonable age range for students.
The following program is a routine that requests an age, and
makes sure it is more than 10. This is certainly not a fool-
proof test (because the user can still enter incorrect ages), but
it takes care of extremely low values. If the user enters a bad
age, the program asks for it again inside the i f statement.
/ / Fi l ename: C9AGE. CPP
/ / Pr ogr amt hat ensur es age val ues ar e r easonabl e.
#i ncl ude <st di o. h>
mai n( )
{
i nt age;
pr i nt f ( \ nWhat i s t he st udent s age? ) ;
scanf ( %d, &age) ; / / Wi t h scanf ( ) , r emember t he &
Chapter 9 o Relational O perators
196
i f ( age < 10)
{ pr i nt f ( %c, \ x07 ) ; / / BEEP
pr i nt f ( *** The age cannot be l ess t han 10 ***\ n) ;
pr i nt f ( Tr y agai n. . . \ n\ n) ;
pr i nt f ( What i s t he st udent s age? ) ;
scanf ( %d, &age) ;
}
pr i nt f ( Thank you. You ent er ed a val i d age. ) ;
r et ur n 0;
}
This routine can also be a section of a longer program. You
learn later how to prompt repeatedly for a value until a valid
input is given. This program takes advantage of the bell
(ASCII 7) to warn the user that a bad age was entered.
Because the \ a character is an escape sequence for the alarm
(see Chapter 4, Variables and Literals for more informa-
tion on escape sequences), \ a can replace the \ x07 in this
program.
If the entered age is less than 10, the user receives an error
message. The program beeps and warns the user about the
bad age before asking for it again.
The following shows the result of running this program.
Notice that the program knows, due to the i f statement,
whether age is more than 10.
What i s t he st udent s age? 3
*** The age cannot be l ess t han 10 ***
Tr y agai n. . .
What i s t he st udent s age? 21
Thank you. You ent er ed a val i d age.
4. Unlike many languages, C++ does not include a square math
operator. Remember that you square a number by multi-
plying it times itself (3*3, for example). Because many com-
puters do not allow for integers to hold more than the square
of 180, the following program uses i f statements to make
sure the number fits as an integer.
197
EXAMPLE
C+ + By
The program takes a value from the user and prints its
squareunless it is more than 180. The message * Squar e i s
not al l owed f or number s over 180 * appears on-screen if the
user types a huge number.
/ / Fi l ename: C9SQR1. CPP
/ / Pr i nt t he squar e of t he i nput val ue
/ / i f t he i nput val ue i s l ess t han 180.
#i ncl ude <i ost r eam. h>
mai n( )
{
i nt num, squar e;
cout << \ n\ n; / / Pr i nt t wo bl ank l i nes.
cout << What number do you want t o see t he squar e of ? ;
ci n >> num;
i f ( num<= 180)
{ squar e = num* num;
cout << The squar e of << num<< i s <<
squar e << \ n;
}
i f ( num> 180)
{ cout << \ x07 ; / / BEEP
cout << \ n* Squar e i s not al l owed f or number s over 180 *;
cout << \ nRun t hi s pr ogr amagai n t r yi ng a smal l er val ue. ;
}
cout << \ nThank you f or r equest i ng squar e r oot s. \ n;
r et ur n 0;
}
The following output shows a couple of sample runs with
this program. Notice that both conditions work: If the user
enters a number less than 180, the calculated square appears,
but if the user enters a larger number, an error message
appears.
Chapter 9 o Relational O perators
198
What number do you want t o see t he squar e of ? 45
The squar e of 45 i s 2025
Thank you f or r equest i ng squar e r oot s.
What number do you want t o see t he squar e of ? 212
* Squar e i s not al l owed f or number s over 180 *
Run t hi s pr ogr amagai n t r yi ng a smal l er val ue.
Thank you f or r equest i ng squar e r oot s.
You can improve this program with the el se statement,
which you learn later in this chapter. This code includes a
redundant check of the users input. The variable nummust
be checked once to print the square if the input number is
less than or equal to 180, and checked again for the error
message if it is greater than 180.
5. The value of 1 and 0 for True and False, respectively, can
help save you an extra programming step, which you are not
necessarily able to save in other languages. To understand
this, examine the following section of code:
commi ssi on = 0; / / I ni t i al i ze commi ssi on
i f ( sal es > 10000)
{ commi ssi on = 500. 00; }
pay = net _pay + commi ssi on; / / Commi ssi on i s 0 unl ess
/ / hi gh sal es.
You can make this program more efficient by combining the
i f s relational test because you know that i f returns 1 or 0:
pay = net _pay + ( commi ssi on = ( sal es > 10000) * 500. 00) ;
This single line does what it took the previous four lines to
do. Because the assignment on the extreme right has prece-
dence, it is computed first. The program compares the
variable sal es to 10000. If it is more than 10000, a True result
of 1 returns. The program then multiplies 1 by 500. 00 and
stores the result in commi ssi on. If, however, the sal es were not
199
EXAMPLE
C+ + By
more than 10000, a 0 results and the program receives 0 from
multiplying 0 by 500. 00.
Whichever value (500. 00 or 0) the program assigns to commi s-
si on is then added to net _pay and stored in pay.
The el se Statement
The el se statement never appears in a program without an i f
statement. This section introduces the el se statement by showing
you the popular i f - el se combination statement. Its format is
i f ( condi t i on)
{ A bl ock of 1 or mor e C++ st at ement s }
el se
{ A bl ock of 1 or mor e C++ st at ement s }
The first part of the i f - el se is identical to the i f statement. If
condi t i on is True, the block of C++ statements following the i f
executes. However, if condi t i on is False, the block of C++ statements
following the el se executes instead. Whereas the simple i f statement
determines what happens only when the condi t i on is True, the i f -
el se also determines what happens if the condi t i on is False. No
matter what the outcome is, the statement following the i f - el se
executes next.
The following describes the nature of the i f - el se:
o If the condi t i on test is True, the entire block of statements
following the i f executes.
o If the condi t i on test is False, the entire block of statements
following the el se executes.
NOTE: You can also compare characters, in addition to num-
bers. When you compare characters, C++ uses the ASCII table
to determine which character is less than the other (lower in
the ASCII table). But you cannot compare character strings or
arrays of character strings directly with relational operators.
Chapter 9 o Relational O perators
200
Examples
1. The following program asks the user for a number. It then
prints whether or not the number is greater than zero, using
the i f - el se statement.
/ / Fi l ename: C9I FEL1. CPP
/ / Demonst r at es i f - el se by pr i nt i ng whet her an
/ / i nput val ue i s gr eat er t han zer o or not .
#i ncl ude <i ost r eam. h>
mai n( )
{
i nt num;
cout << What i s your number ? ;
ci n >> num; / / Get t he user s number .
i f ( num> 0)
{ cout << Mor e t han 0\ n; }
el se
{ cout << Less or equal t o 0\ n; }
/ / No mat t er what t he number was, t he f ol l owi ng execut es.
cout << \ n\ nThanks f or your t i me! \ n;
r et ur n 0;
}
There is no need to test for both possibilities when you use
an el se. The i f tests whether the number is greater than zero,
and the el se automatically handles all other possibilities.
2. The following program asks the user for his or her first
name, then stores it in a character array. The program checks
the first character of the array to see whether it falls in the
first half of the alphabet. If it does, an appropriate message is
displayed.
/ / Fi l ename: C9I FEL2. CPP
/ / Test s t he user s f i r st i ni t i al and pr i nt s a message.
#i ncl ude <i ost r eam. h>
mai n( )
{
201
EXAMPLE
C+ + By
char l ast [ 20] ; / / Hol ds t he l ast name.
cout << What i s your l ast name? ;
ci n >> l ast ;
/ / Test t he i ni t i al
i f ( l ast [ 0] <= P )
{ cout << Your name i s ear l y i n t he al phabet . \ n; }
el se
{ cout << You have t o wai t a whi l e f or
<< YOUR name t o be cal l ed! \ n; }
r et ur n 0;
}
Notice that because the program is comparing a character
array element to a character literal, you must enclose the
character literal inside single quotation marks. The data type
on each side of each relational operator must match.
3. The following program is a more complete payroll routine
than the other one. It uses the i f statement to illustrate how
to compute overtime pay. The logic goes something like this:
If employees work 40 hours or fewer, they are paid regular
pay (their hourly rate times the number of hours worked). If
employees work between 40 and 50 hours, they receive one-
and-a-half times their hourly rate for those hours over 40, in
addition to their regular pay for the first 40. All hours over
50 are paid at double the regular rate.
/ / Fi l ename: C9PAY2. CPP
/ / Comput e t he f ul l over t i me pay possi bi l i t i es.
#i ncl ude <i ost r eam. h>
#i ncl ude <st di o. h>
mai n( )
{
i nt hour s;
f l oat dt , ht , r p, r at e, pay;
cout << \ n\ nHow many hour s wer e wor ked? ;
ci n >> hour s;
cout << \ nWhat i s t he r egul ar hour l y pay? ;
ci n >> r at e;
Chapter 9 o Relational O perators
202
/ / Comput e pay her e
/ / Doubl e- t i me possi bi l i t y
i f ( hour s > 50)
{ dt = 2. 0 * r at e * ( f l oat ) ( hour s - 50) ;
ht = 1. 5 * r at e * 10. 0; } / / Ti me + 1/ 2 f or 10 hour s.
el se
{ dt = 0. 0; }/ / Ei t her none or doubl e f or hour s over 50.
/ / Ti me and a hal f .
i f ( hour s > 40)
{ ht = 1. 5 * r at e * ( f l oat ) ( hour s - 40) ; }
/ / Regul ar Pay
i f ( hour s >= 40)
{ r p = 40 * r at e; }
el se
{ r p = ( f l oat ) hour s * r at e; }
pay = dt + ht + r p; / / Add t hr ee component s of payr ol l .
pr i nt f ( \ nThe pay i s %. 2f , pay) ;
r et ur n 0;
}
4. The block of statements following the if can contain any
valid C++ statementeven another i f statement! This
sometimes is handy, as the following example shows.
You can even use this program to award employees for their
years of service to your company. In this example, you are
giving a gold watch to those with more than 20 years of
service, a paperweight to those with more than 10 years, and
a pat on the back to everyone else!
/ / Fi l ename: C9SERV. CPP
/ / Pr i nt s a message dependi ng on year s of ser vi ce.
#i ncl ude <i ost r eam. h>
mai n( )
{
i nt yr s;
cout << How many year s of ser vi ce? ;
ci n >> yr s; / / Det er mi ne t he year s t hey have wor ked.
203
EXAMPLE
C+ + By
i f ( yr s > 20)
{ cout << Gi ve a gol d wat ch\ n; }
el se
{ i f ( yr s > 10)
{ cout << Gi ve a paper wei ght \ n; }
el se
{ cout << Gi ve a pat on t he back\ n; }
}
r et ur n 0;
}
Dont rely on the i f within an i f to handle too many condi-
tions, because more than three or four conditions can add
confusion. You might mess up your logic, such as: If this is
True, and if this is also True, then do something; but if not
that, but something else is True, then... (and so on). The
swi t ch statement that you learn about in a later chapter
handles these types of multiple i f selections much better
than a long i f within an i f statement does.
Review Questions
The answers to the review questions are in Appendix B.
1. Which operator tests for equality?
2. State whether each of these relational tests is True or False:
a. 4 >= 5
b. 4 == 4
c. 165 >= 165
d. 0 ! = 25
3. True or false: C++ i s f un prints on-screen when the following
statement executes.
Chapter 9 o Relational O perators
204
i f ( 54 <= 54)
{ pr i nt f ( C++ i s f un) ; }
4. What is the difference between an i f and an i f - el se state-
ment?
5. Does the following pr i nt f ( ) execute?
i f ( 3 ! = 4 ! = 1)
{ pr i nt f ( Thi s wi l l pr i nt ) ; }
6. Using the ASCII table (see Appendix C, ASCII Table), state
whether these character relational tests are True or False:
a. C < c
b. 0 > 0
c. ? > )
Review Exerc ises
1. Write a weather-calculator program that asks for a list of the
previous five days temperatures, then prints Br r r r ! every
time a temperature falls below freezing.
2. Write a program that asks for a number and then prints the
square and cube (the number multiplied by itself three
times) of the number you input, if that number is more than
1. Otherwise, the program does not print anything.
3. In a program, ask the user for two numbers. Print a message
telling how the first one relates to the second. In other
words, if the user enters 5 and 7, your program prints 5 i s
l ess t han 7.
4. Write a program that prompts the user for an employees
pre-tax salary and prints the appropriate taxes. The taxes are
10 percent if the employee makes less than $10,000; 15
percent if the employee earns $10,000 up to, but not includ-
ing, $20,000; and 20 percent if the employee earns $20,000 or
more.
205
EXAMPLE
C+ + By
Summary
You now have the tools to write powerful data-checking pro-
grams. This chapter showed you how to compare literals, variables,
and combinations of both by using the relational operators. The i f
and the i f - el se statements rely on such data comparisons to deter-
mine which code to execute next. You can now conditionally execute
statements in your programs.
The next chapter takes this one step further by combining
relational operators to create logical operators (sometimes called
compound conditions). These logical operators further improve your
programs capability to make selections based on data comparisons.
Chapter 9 o Relational O perators
206
207
EXAMPLE
C+ + By
10
Logic al Operators
C++s logical operators enable you to combine relational operators
into more powerful data-testing statements. The logical operators
are sometimes called compound relational operators. As C++s prece-
dence table shows, relational operators take precedence over logical
operators when you combine them. The precedence table plays an
important role in these types of operators, as this chapter empha-
sizes.
This chapter introduces you to
o The logical operators
o How logical operators are used
o How logical operators take precedence
This chapter concludes your study of the conditional testing
that C++ enables you to perform, and it illustrates many examples
of i f statements in programs that work on compound conditional
tests.
Defining Logic al Operators
There may be times when you have to test more than one set of
variables. You can combine more than one relational test into a
compound relational test by using C++s logical operators, as shown in
Table 10.1.
Chapter 10 o Logical O perators
208
Table 10.1. Logic al operators.
Operator Meaning
&& AND
| | OR
! NOT
The first two logical operators, && and | | , never appear by
themselves. They typically go between two or more relational tests.
Table 10.2 shows you how each logical operator works. These
tables are called truth tables because they show you how to achieve
True results from an i f statement that uses these operators. Take
some time to study these tables.
Table 10.2. Truth tables.
The AND (&&) truth table
(Both sides must be True)
True AND True = True
True AND False = False
False AND True = False
False AND False = False
The OR (
| |
) truth table
(One or the other side must be True)
True OR True = True
True OR False = True
False OR True = True
False OR False = False
The NOT (! ) truth table
(Causes an opposite relation)
NOT True = False
NOT False = True
Logi cal operators
enabl e the user to
compute compound
rel ati onal tests.
209
EXAMPLE
C+ + By
Logic al Operators and
Their Uses
The True and False on each side of the operators represent a
relational i f test. The following statements, for example, are valid i f
tests that use logical operators (sometimes called compound relational
operators).
If the variable a is less than the variable b, and the variable c is greater than
the variable d, then print Resul t s ar e i nval i d. to the screen.
i f ( ( a < b) && ( c > d) )
{ cout << Resul t s ar e i nval i d. ; }
The variable a must be less than b and, at the same time, c must
be greater than d for the pr i nt f ( ) to execute. The i f statement still
requires parentheses around its complete conditional test. Consider
this portion of a program:
i f ( ( sal es > 5000) | | ( hr s_wor ked > 81) )
{ bonus=500; }
The sal es must be more than 5000, or the hr s_wor ked must be
more than 81, before the assignment executes.
i f ( ! ( sal es < 2500) )
{ bonus = 500; }
If sal es is greater than or equal to 2500, bonus is initialized. This
illustrates an important programming tip: Use ! sparingly. Or, as
some professionals so wisely put it: Do not use ! or your programs
will not be ! (unclear). It is much clearer to rewrite the previous
example by turning it into a positive relational test:
i f ( sal es >= 2500)
{ bonus 500; }
But the ! operator is sometimes helpful, especially when testing
for end-of-file conditions for disk files, as you learn in Chapter 30,
Sequential Files. Most the time, however, you can avoid using ! by
using the reverse logic shown in the following:
The | | i s
someti mes cal l ed
i ncl usi ve OR. Here i s
a program segment
that i ncl udes the not
(! ) operator:
Chapter 10 o Logical O perators
210
! ( var 1 == var 2) is the same as ( var 1 ! = var 2)
! ( var 1 <= var 2) is the same as ( var 1 > var 2)
! ( var 1 >= var 2) is the same as ( var 1 < var 2)
! ( var 1 ! = var 2) is the same as ( var 1 == var 2)
! ( var 1 > var 2) is the same as ( var 1 <= var 2)
! ( var 1 < var 2) is the same as ( var 1 >= var 2)
Notice that the overall format of the i f statement is retained
when you use logical operators, but the relational test expands to
include more than one relation. You even can have three or more, as
in the following statement:
i f ( ( a == B) && ( d == f ) | | ( l = m) | | ! ( k <> 2) ) . . .
This is a little too much, however, and good programming
practice dictates using at most two relational tests inside a single i f
statement. If you have to combine more than two, use more than one
i f statement to do so.
As with other relational operators, you also use the following
logical operators in everyday conversation.
If my pay is high and my vacation time is long, we can go
to Italy this summer.
If you take the trash out or clean your room, you can watch
TV tonight.
If you arent good, youll be punished.
Internal Truths
The True or False results of relational tests occur internally at
the bit level. For example, take the i f test:
i f ( a == 6) . . .
to determine the truth of the relation, (a==6). The computer
takes a binary 6, or 00000110, and compares it, bit-by-bit, to
the variable a. If a contains 7, a binary 00000111, the result of
this equal test is False, because the right bit (called the least-
significant bit) is different.
211
EXAMPLE
C+ + By
C++s Logic al Effic ienc y
C++ attempts to be more efficient than other languages. If you
combine multiple relational tests with one of the logical operators,
C++ does not always interpret the full expression. This ultimately
makes your programs run faster, but there are dangers! For ex-
ample, if your program is given the conditional test:
i f ( ( 5 > 4) | | ( sal es < 15) && ( 15 ! = 15) ) . . .
C++ only evaluates the first condition, ( 5 > 4) , and realizes it does
not have to look further. Because ( 5 >4) is True and because | | (OR)
anything that follows it is still True, C++ does not bother with the
rest of the expression. The same holds true for the following state-
ment:
i f ( ( 7 < 3) && ( age > 15) && ( i ni t i al == D ) ) . . .
Here, C++ evaluates only the first condition, which is False.
Because the && (AND) anything else that follows it is also False, C++
does not interpret the expression to the right of ( 7 < 3) . Most of the
time, this doesnt pose a problem, but be aware that the following
expression might not fulfill your expectations:
i f ( ( 5 > 4) | | ( num= 0) ) . . .
The ( num= 0) assignment never executes, because C++ has to
interpret only ( 5 > 4) to determine whether the entire expression is
True or False. Due to this danger, do not include assignment
expressions in the same condition as a logical test. The following
single i f condition:
i f ( ( sal es > ol d_sal es) | | ( i nvent or y_f l ag = Y ) ) . . .
should be broken into two statements, such as:
i nvent or y_f l ag) = Y ;
i f ( ( sal es > ol d_sal es) | | ( i nvent or y_f l ag) ) . . .
so the i nvent or y_f l ag is always assigned the Y value, no matter how
the ( sal es > ol d_sal es) expression tests.
Chapter 10 o Logical O perators
212
Examples
1. The summer Olympics are held every four years during each
year that is divisible evenly by 4. The U.S. Census is taken
every 10 years, in each year that is evenly divisible by 10.
The following short program asks for a year, and then tells
the user if it is a year of the summer Olympics, a year of the
census, or both. It uses relational operators, logical opera-
tors, and the modulus operator to determine this output.
/ / Fi l ename: C10YEAR. CPP
/ / Det er mi nes i f i t i s Summer Ol ympi cs year ,
/ / U. S. Census year , or bot h.
#i ncl ude <i ost r eam. h>
mai n( )
{
i nt year ;
/ / Ask f or a year
cout << What i s a year f or t he t est ? ;
ci n >> year ;
/ / Test t he year
i f ( ( ( year %4) ==0) && ( ( year %10) ==0) )
{ cout << Bot h Ol ympi cs and U. S. Census! ;
r et ur n 0; } / / Qui t pr ogr am, r et ur n t o oper at i ng
/ / syst em.
i f ( ( year %4) ==0)
{ cout << Summer Ol ympi cs onl y; }
el se
{ i f ( ( year %10) ==0)
{ cout << U. S. Census onl y; }
}
r et ur n 0;
}
2. Now that you know about compound relations, you can
write an age-checking program like the one called
C9AGE.CPP presented in Chapter 9, Relational Operators.
That program ensured the age would be above 10. This is
another way you can validate input for reasonableness.
213
EXAMPLE
C+ + By
The following program includes a logical operator in its i f to
determine whether the age is greater than 10 and less than
100. If either of these is the case, the program concludes that
the user did not enter a valid age.
/ / Fi l ename: C10AGE. CPP
/ / Pr ogr amt hat hel ps ensur e age val ues ar e r easonabl e.
#i ncl ude <i ost r eam. h>
mai n( )
{
i nt age;
cout << What i s your age? ;
ci n >> age;
i f ( ( age < 10) | | ( age > 100) )
{ cout << \ x07 \ x07 \ n; / / Beep t wi ce
cout << *** The age must be bet ween 10 and
100 ***\ n; }
el se
{ cout << You ent er ed a val i d age. ; }
r et ur n 0;
}
3. The following program could be used by a video store to
calculate a discount, based on the number of rentals people
transact as well as their customer status. Customers are
classified either R for Regular or S for Special. Special custom-
ers have been members of the rental club for more than one
year. They automatically receive a 50-cent discount on all
rentals. The store also holds value days several times a
year. On value days, all customers receive the 50-cent dis-
count. Special customers do not receive an additional 50
cents off during value days, because every day is a discount
for them.
The program asks for each customers status and whether or
not it is a value day. It then uses the | | relation to test for the
discount. Even before you started learning C++, you would
probably have looked at this problem with the following
idea in mind.
Chapter 10 o Logical O perators
214
If a customer is Special or if it is a value day, deduct 50
cents from the rental.
Thats basically the idea of the i f decision in the following
program. Even though Special customers do not receive an
additional discount on value days, there is one final i f test
for them that prints an extra message at the bottom of the
screens indicated billing.
/ / Fi l ename: C10VI DEO. CPP
/ / Pr ogr amt hat comput es vi deo r ent al amount s and gi ves
/ / appr opr i at e di scount s based on t he day or cust omer st at us.
#i ncl ude <i ost r eam. h>
#i ncl ude <st di o. h>
mai n( )
{
f l oat t ape_char ge, di scount , r ent al _amt ;
char f i r st _name[ 15] ;
char l ast _name[ 15] ;
i nt num_t apes;
char val _day, sp_st at ;
cout << \ n\ n *** Vi deo Rent al Comput at i on ***\ n;
cout << - - - - - - - - - - - - - - - - - - - - - - - - \ n;
/ / Under l i ne t i t l e
t ape_char ge = 2. 00;
/ / Bef or e- di scount t ape f ee- per t ape.
/ / Recei ve i nput dat a.
cout << \ nWhat i s cust omer s f i r st name? ;
ci n >> f i r st _name;
cout << What i s cust omer s l ast name? ;
ci n >> l ast _name;
cout << \ nHow many t apes ar e bei ng r ent ed? ;
ci n >> num_t apes;
cout << I s t hi s a Val ue day ( Y/ N) ? ;
ci n >> val _day;
cout << I s t hi s a Speci al St at us cust omer ( Y/ N) ? ;
ci n >> sp_st at ;
/ / Cal cul at e r ent al amount .
215
EXAMPLE
C+ + By
di scount = 0. 0; / / I ncr ease di scount i f t hey ar e el i gi bl e.
i f ( ( val _day == Y ) | | ( sp_st at == Y ) )
{ di scount = 0. 5;
r ent al _amt =( num_t apes*t ape_char ge)
( di scount *num_t apes) ; }
/ / Pr i nt t he bi l l .
cout << \ n\ n** Rent al Cl ub **\ n\ n;
cout << f i r st _name << << l ast _name << r ent ed
<< num_t apes << t apes\ n;
pr i nt f ( The t ot al was %. 2f \ n, r ent al _amt ) ;
pr i nt f ( The di scount was %. 2f per t ape\ n, di scount ) ;
/ / Pr i nt ext r a message f or Speci al St at us cust omer s.
i f ( sp_st at == Y )
{ cout << \ nThank t hemf or bei ng a Speci al
<< St at us cust omer \ n; }
r et ur n 0;
}
The output of this program appears below. Notice that
Special customers have the extra message at the bottom of
the screen. This program, due to its i f statements, performs
differently depending on the data entered. No discount is
applied for Regular customers on nonvalue days.
*** Vi deo Rent al Comput at i on ***
- - - - - - - - - - - - - - - - - - - - - - - -
What i s cust omer s f i r st name? J er r y
What i s cust omer s l ast name? Par ker
How many t apes ar e bei ng r ent ed? 3
I s t hi s a Val ue day ( Y/ N) ? Y
I s t hi s a Speci al St at us cust omer ( Y/ N) ? Y
** Rent al Cl ub **
J er r y Par ker r ent ed 3 t apes
The t ot al was 4. 50
The di scount was 0. 50 per t ape
Thank t hemf or bei ng a Speci al St at us cust omer
Chapter 10 o Logical O perators
216
Logic al Operators and
Their Prec edenc e
The math precedence order you read about in Chapter 8,
Using C++ Math Operators and Precedence, did not include the
logical operators. To be complete, you should be familiar with the
entire order of precedence, as presented in Appendix D, C++
Precedence Table.
You might wonder why the relational and logical operators are
included in a precedence table. The following statement helps show
you why:
i f ( ( sal es < mi n_sal * 2 && yr s_emp > 10 * sub) . . .
Without the complete order of operators, it is impossible to
determine how such a statement would execute. According to the
precedence order, this i f statement executes as follows:
i f ( ( sal es < ( mi n_sal * 2) ) && ( yr s_emp > ( 10 * sub) ) ) . . .
This still might be confusing, but it is less so. The two multipli-
cations are performed first, followed by the relations < and >. The &&
is performed last because it is lowest in the precedence order of
operators.
To avoid such ambiguous problems, be sure to use ample
parentheseseven if the default precedence order is your intention.
It is also wise to resist combining too many expressions inside a
single i f relational test.
Notice that | | (OR) has lower precedence than && (AND).
Therefore, the following i f tests are equivalent:
i f ( ( f i r st _i ni t i al == A ) && ( l ast _i ni t i al == G ) | | ( i d==321) ) . . .
i f ( ( ( f i r st _i ni t i al == A ) && ( l ast _i ni t i al == G ) ) | | ( i d==321) ) . . .
The second is clearer, due to the parentheses, but the precedence
table makes them identical.
217
EXAMPLE
C+ + By
Review Questions
The answers to the review questions are in Appendix B.
1. What are the three logical operators?
2. The following compound relational tests produce True or
False comparisons. Determine which are True and which are
False.
a. ! ( Tr ue | | Fal se)
b. ( Tr ue && Fal se) && ( Fal se | | Tr ue)
c. ! ( Tr ue && Fal se)
d. Tr ue | | ( Fal se && Fal se) | | Fal se
3. Given the statement:
i nt i =12, j =10, k=5;
What are the results (True or False) of the following state-
ments? (Hint: Remember that C++ interprets any nonzero
statement as True.)
a. i && j
b. 12 - i | | k
c. j ! = k && i ! = k
4. What is the value printed in the following program? (Hint:
Dont be misled by the assignment operators on each side of
the | | .)
/ / Fi l ename: C10LOGO. CPP
/ / Logi cal oper at or t est
#i ncl ude <i ost r eam. h>
mai n( )
{
i nt f , g;
g = 5;
f = 8;
i f ( ( g = 25) | | ( f = 35) )
Chapter 10 o Logical O perators
218
{ cout << g i s << g << and f got changed t o << f ; }
r et ur n 0;
}
5. Using the precedence table, determine whether the follow-
ing statements produce a True or False result. After this, you
should appreciate the abundant use of parentheses!
a. 5 == 4 + 1 | | 7 * 2 ! = 12 - 1 && 5 == 8 / 2
b. 8 + 9 ! = 6 - 1 | | 10 %2 ! = 5 + 0
c. 17 - 1 > 15 + 1 && 0 + 2 ! = 1 == 1 | | 4 ! = 1
d. 409 * 0 ! = 1 * 409 + 0 | | 1 + 8 * 2 >= 17
6. Does the following cout execute?
i f ( ! 0)
{ cout << C++ By Exampl e \ n; }
Review Exerc ises
1. Write a program (by using a single compound i f state-
ment) to determine whether the user enters an odd positive
number.
2. Write a program that asks the user for two initials. Print a
message telling the user if the first initial falls alphabetically
before the second.
3. Write a number-guessing game. Assign a value to a variable
called number at the top of the program. Give a prompt that
asks for five guesses. Receive the users five guesses with a
single scanf ( ) for practice with scanf ( ) . Determine whether
any of the guesses match the number and print an appropriate
message if one does.
4. Write a tax-calculation routine, as follows: A family pays no
tax if its income is less than $5,000. It pays a 10 percent tax if
its income is $5,000 to $9,999, inclusive. It pays a 20 percent
tax if the income is $10,000 to $19,999, inclusive. Otherwise,
it pays a 30 percent tax.
219
EXAMPLE
C+ + By
Summary
This chapter extended the i f statement to include the &&, | | , and
! logical operators. These operators enable you to combine several
relational tests into a single test. C++ does not always have to
look at every relational operator when you combine them in an ex-
pression.
This chapter concludes the explanation of the i f statement. The
next chapter explains the remaining regular C++ operators. As you
saw in this chapter, the precedence table is still important to the C++
language. Whenever you are evaluating expressions, keep the pre-
cedence table in the back of your mind (or at your fingertips) at all
times!
Chapter 10 o Logical O perators
220
221
EXAMPLE
C+ + By
11
Additional C++
Operators
C++ has several other operators you should learn besides those you
learned in Chapters 9 and 10. In fact, C++ has more operators than
most programming languages. Unless you become familiar with
them, you might think C++ programs are cryptic and difficult to
follow. C++s heavy reliance on its operators and operator prece-
dence produces the efficiency that enables your programs to run
more smoothly and quickly.
This chapter teaches you the following:
o The ?: conditional operator
o The ++increment operator
o The decrement operator
o The si zeof operator
o The (, ) comma operator
o The Bitwise Operators (&, | , and ^)
Chapter 11 o Additional C ++ O perators
222
Most the operators described in this chapter are unlike those
found in any other programming language. Even if you have
programmed in other languages for many years, you still will be
surprised by the power of these C++ operators.
The Conditional Operator
The conditional operator is C++s only ternary operator, requir-
ing three operands (as opposed to the unarys single-and the binarys
double-operand requirements). The conditional operator is used to
replace i f - el se logic in some situations. The conditional operator is
a two-part symbol, ?: , with a format as follows:
condi t i onal _expr essi on ? expr essi on1 : expr essi on2;
The condi t i onal _expr essi on is any expression in C++ that results
in a True (nonzero) or False (zero) answer. If the result of
condi t i onal _expr essi on is True, expr essi on1 executes. Otherwise, if
the result of condi t i onal _expr essi on is False, expr essi on2 executes.
Only one of the expressions following the question mark ever
executes. Only a single semicolon appears at the end of expr essi on2.
The internal expressions, such as expr essi on1, do not have a semico-
lon. Figure 11.1 illustrates the conditional operator more clearly.
The condi ti onal
operator i s a ternary
operator.
Figure 11.1. Format of the conditional operator.
223
EXAMPLE
C+ + By
If you require simple i f - el se logic, the conditional operator
usually provides a more direct and succinct method, although you
should always prefer readability over compact code.
To glimpse the conditional operator at work, consider the
section of code that follows.
i f ( a > b)
{ ans = 10; }
el se
{ ans = 25; }
You can easily rewrite this kind of i f - el se code by using a single
conditional operator.
If the variable a is greater than the variable b, make the variable ans
equal to 10; otherwise, make ans equal to 25.
a > b ? ( ans = 10) : ( ans = 25) ;
Al t hough par e nt he s e s ar e not r e qui r e d ar ound
condi t i onal _expr essi on to make it work, they usually improve read-
ability. This statements readability is improved by using parenthe-
ses, as follows:
( a > b) ? ( ans = 10) : ( ans = 25) ;
Because each C++ expression has a valuein this case, the
value being assignedthis statement could be even more succinct,
without loss of readability, by assigning ans the answer to the left of
the conditional:
ans = ( a > b) ? ( 10) : ( 25) ;
This expression says: If a is greater than b, assign 10 to ans;
otherwise, assign 25 to ans. Almost any i f - el se statement can be
rewritten as a conditional, and vice versa. You should practice
converting one to the other to familiarize yourself with the condi-
tional operators purpose.
NOTE: Any va l i d i f C++ s t at ement al s o can be a
condi t i onal _expr essi on, including all relational and logical op-
erators as well as any of their possible combinations.
Chapter 11 o Additional C ++ O perators
224
Examples
1. Suppose you are looking over your early C++ programs, and
you notice the following section of code.
i f ( pr oduct i on > t ar get )
{ t ar get *= 1. 10; }
el se
{ t ar get *= . 90; }
You should realize that such a simple i f - el se statement can
be rewritten using a conditional operator, and that more
efficient code results. You can therefore change it to the
following single statement.
( pr oduct i on > t ar get ) ? ( t ar get *= 1. 10) : ( t ar get *= . 90) ;
2. Using a conditional operator, you can write a routine to find
the minimum value between two variables. This is some-
times called a minimum routine. The statement to do this is
mi ni mum= ( var 1 < var 2) ? var 1 : var 2;
If var 1 is less than var 2, the value of var 1 is assigned to mi ni -
mum. If var 2 is less, the value of var 2 is assigned to mi ni mum. If
the variables are equal, the value of var 2 is assigned to
mi ni mum, because it does not matter which is assigned.
3. A maximum routine can be written just as easily:
maxi mum= ( var 1 > var 2) ? var 1 : var 2;
4. Taking the previous examples a step further, you can also
test for the sign of a variable. The following conditional
expression assigns 1 to the variable called si gn if t est var is
less than 0; 0 to si gn if t est var is zero; and +1 to si gn if t est var
is 1 or more.
si gn = ( t est var < 0) ? - 1 : ( t est var > 0) ;
It might be easy to spot why the less-than test results in a 1,
but the second part of the expression can be confusing. This
works well due to C++s 1 and 0 (for True and False, respec-
tively) return values from a relational test. If t est var is 0 or
greater, si gn is assigned the answer ( t est var > 0) . The value
225
EXAMPLE
C+ + By
of ( t est var > 0) is 1 if True (therefore, t est var is more than 0)
or 0 if t est var is equal to 0.
The preceding statement shows C++s efficient conditional
operator. It might also help you understand if you write the
statement using typical i f - el se logic. Here is the same
problem written with a typical i f - el se statement:
i f ( t est var < 0)
{ si gn = - 1; }
el se
{ si gn = ( t est var > 0) ; } / / t est var can onl y be
/ / 0 or mor e her e.
The Inc rement and
Dec rement Operators
C++ offers two unique operators that add or subtract 1 to or
from variables. These are the increment and decrement operators: ++
and . Table 11.1 shows how these operators relate to other types of
expressions you have seen. Notice that the ++and can appear on
either side of the modified variable. If the ++or appears on the left,
it is known as a prefix operator. If the operator appears on the right,
it is a postfix operator.
Table 11.1. The ++ and operators.
Operator Example Description Equivalent Statements
++ i ++; postfix i = i + 1; i += 1;
++ ++i ; prefix i = i + 1; i += 1;
i ; postfix i = i - 1; i - = 1;
i ; prefix i = i - 1; i - = 1;
Any time you have to add 1 or subtract 1 from a variable, you
can use these two operators. As Table 11.1 shows, if you have to
increment or decrement only a single variable, these operators
enable you to do so.
The ++operator
adds 1 to a vari abl e.
The operator
subtracts 1 from a
vari abl e.
Chapter 11 o Additional C ++ O perators
226
Increment and Decrement Efficiency
The increment and decrement operators are straightforward,
efficient methods for adding 1 to a variable and subtracting 1
from a variable. You often have to do this during counting or
processing loops, as discussed in Chapter 12, The whi l e Loop
and beyond.
These two operators compile directly into their assembly lan-
guage equivalents. Almost all computers include, at their
lowest binary machine-language commands, increment and
decrement instructions. If you use C++s increment and decre-
ment operators, you ensure that they compile to these low-level
equivalents.
If, however, you code expressions to add or subtract 1 (as you
do in other programming languages), such as the expression
i = i - 1, you do not actually ensure that C++ compiles
this instruction in its efficient machine-language equivalent.
Whether you use prefix or postfix does not matterif you are
incrementing or decrementing single variables on lines by them-
selves. However, when you combine these two operators with other
operators in a single expression, you must be aware of their differ-
ences. Consider the following program section. Here, all variables
are integers because the increment and decrement operators work
only on integer variables.
Make a equal to 6. Increment a, subtract 1 from it, then assign the result
to b.
a = 6;
b = ++a - 1;
What are the values of a and b after these two statements finish?
The value of a is easy to determine: it is incremented in the second
statement, so it is 7. However, b is either 5 or 6 depending on when
the variable a increments. To determine when a increments, consider
the following rule:
227
EXAMPLE
C+ + By
o If a variable is incremented or decremented with a prefix
operator, the increment or decrement occurs before the
variables value is used in the remainder of the expression.
o If a variable is incremented or decremented with a postfix
operator, the increment or decrement occurs after the
variables value is used in the remainder of the expression.
In the previous code, a contains a prefix increment. Therefore,
its value is first incremented to 7, then 1 is subtracted from 7, and the
result (6) is assigned to b. If a postfix increment is used, as in
a = 6;
b = a++ - 1;
a is 6, therefore, 5 is assigned to b because a does not increment
to 7 until after its value is used in the expression. The precedence
table in Appendix D, C++ Precedence Table, shows that prefix
operators contain much higher precedence than almost every other
operator, especially low-precedence postfix increments and decre-
ments.
TIP: If the order of prefix and postfix confuses you, break
your expressions into two lines of code and type the increment
or decrement before or after the expression that uses it.
By taking advantage of this tip, you can now rewrite the
previous example as follows:
a = 6;
b = a - 1;
a++;
There is now no doubt as to when a is incremented: a incre-
ments after b is assigned to a- 1.
Even parentheses cannot override the postfix rule. Consider
the following statement.
x = p + ( ( ( amt ++) ) ) ;
Chapter 11 o Additional C ++ O perators
228
There are too many unneeded parentheses here, but even the
redundant parentheses are not enough to increment amt before
adding its value to p. Postfix increments and decrements always
occur after their variables are used in the surrounding expression.
CAUTION: Do not attempt to increment or decrement an
expression. You can apply these operators only to variables.
The following expression is invalid:
sal es = ++( r at e * hour s) ; / / Not al l owed! !
Examples
1. As you should with all other C++ operators, keep the prece-
dence table in mind when you evaluate expressions that
increment and decrement. Figures 11.2 and 11.3 show you
some examples that illustrate these operators.
2. The precedence table takes on even more meaning when you
see a section of code such as that shown in Figure 11.3.
3. Considering the precedence tableand, more importantly,
what you know about C++s relational efficiencieswhat is
the value of the ans in the following section of code?
i nt i =1, j =20, k=- 1, l =0, m=1, n=0, o=2, p=1;
ans = i | | j && k++ | | ++l && ++m| | n & ! o | | p;
This, at first, seems to be extremely complicated. Neverthe-
less, you can simply glance at it and determine the value of
ans, as well as the ending value of the rest of the variables.
Recall that when C++ performs a relation | | (or), it ignores
the right side of the | | if the left value is True (any nonzero
value is True). Because any nonzero value is True, C++ does
229
EXAMPLE
C+ + By
Figure 11.2. C++ operators incrementing (above) and decrementing
(below) by order of precedence.
i nt i =1;
i nt j =2;
i nt k=3;
ans = i ++ * j - k;
|
i ++ * j - 2

2 - 2
0
ans = 0, t hen i i ncr ement s by 1 t o i t s f i nal val ue of 2.
i nt i =1;
i nt j =2;
i nt k=3;
ans = ++i * j - k;
|
2 * j - k
4 - k
1
ans = 1, t hen k decr ement s by 1 t o i t s f i nal val ue of 2.
not evaluate the values on the right. Therefore, C++ per-
forms this expression as shown:
ans = i | | j && k++ | | ++l && ++m| | n & ! o | | p;
|
1 ( TRUE)
Chapter 11 o Additional C ++ O perators
230
i nt i =0;
i nt j =- 1;
i nt k=0;
i nt m=1
ans = i ++ && ++j | | k | | m++;
|
i ++ && 0 | | k | | m++
0 | | k | | m++
0 | | m++
1
ans = 1, t hen i i ncr ement s by 1 t o i t s f i nal val ue of 1,
and mi ncr ement s by 1 t o i t s f i nal val ue of 2.
Figure 11.3. Another example of C++ operators and their precedence.
NOTE: Because i is True, C++ evaluates the entire expression
as True and ignores all code after the first | | . Therefore, every
other increment and decrement expression is ignored. Because C++
ignores the other expressions, only ans is changed by this
expression. The other variables, j through p, are never
incremented or decremented, even though several of them
contain increment and decrement operators. If you use rela-
tional operators, be aware of this problem and break out all
increment and decrement operators into statements by them-
selves, placing them on lines before the relational statements
that use their values.
The si zeof Operator
There is another operator in C++ that does not look like an
operator at all. It looks like a built-in function, but it is called the
231
EXAMPLE
C+ + By
si zeof operator. In fact, if you think of si zeof as a function call, you
might not become confused because it works in a similar way. The
format of si zeof follows:
si zeof dat a
or
si zeof ( dat a t ype)
The si zeof operator is unary, because it operates on a single
value. This operator produces a result that represents the size, in
bytes, of the dat a or dat a t ype specified. Because most data types and
variables require different amounts of internal storage on different
computers, the si zeof operator enables programs to maintain con-
sistency on different types of computers.
TIP: Most C++ programmers use parentheses around the
si zeof argument, whether that argument is dat a or dat a t ype.
Because you must use parentheses around dat a t ype arguments
and you can use them around dat a arguments, it doesnt hurt to
always use them.
The si zeof operator is sometimes called a compile-time operator.
At compile time, rather than runtime, the compiler replaces each
occurrence of si zeof in your program with an unsigned integer
value. Because si zeof is used more in advanced C++ programming,
this operator is better utilized later in the book for performing more
advanced programming requirements.
If you use an array as the si zeof argument, C++ returns the
number of bytes you originally reserved for that array. Data inside
the array have nothing to do with its returned si zeof valueeven if
its only a character array containing a short string.
Examples
1. Suppose you want to know the size, in bytes, of floating-
point variables for your computer. You can determine
this by entering the keyword f l oat in parenthesesafter
si zeof as shown in the following program.
The si zeof
operator returns i ts
arguments si ze i n
bytes.
Chapter 11 o Additional C ++ O perators
232
/ / Fi l ename: C11SI ZE1. CPP
/ / Pr i nt s t he si ze of f l oat i ng- poi nt val ues.
#i ncl ude <i ost r eam. h>
mai n( )
{
cout << The si ze of f l oat i ng- poi nt var i abl es on \ n;
cout << t hi s comput er i s << si zeof ( f l oat ) << \ n;
r et ur n 0;
}
This program might produce different results on different
computers. You can use any valid data type as the si zeof
argument. On most PCs, this program probably produces
this output:
The si ze of f l oat i ng- poi nt var i abl es on
t hi s comput er i s: 4
The Comma Operator
Another C++ operator, sometimes called a sequence point, works
a little differently. This is the comma operator (, ), which does not
directly operate on data, but produces a left-to-right evaluation of
expressions. This operator enables you to put more than one expres-
sion on a single line by separating each one with a comma.
You already saw one use of the sequence point comma when
you learned how to declare and initialize variables. In the following
section of code, the comma separates statements. Because the comma
associates from the left, the first variable, i , is declared and initial-
ized before the second variable.
mai n( )
{
i nt i =10, j =25;
/ / Remai nder of t he pr ogr amf ol l ows.
233
EXAMPLE
C+ + By
However, the comma is not a sequence point when it is used
inside function parentheses. Then it is said to separate arguments,
but it is not a sequence point. Consider the pr i nt f ( ) that follows.
pr i nt f ( %d %d %d, i , i ++, ++i ) ;
Many results are possible from such a statement. The commas
serve only to separate arguments of the pr i nt f ( ) , and do not generate
the left-to-right sequence that they otherwise do when they arent
used in functions. With the statement shown here, you are not
ensured of any order! The postfix i ++ might possibly be performed
before the prefix ++i , even though the precedence table does not
require this. Here, the order of evaluation depends on how your
compiler sends these arguments to the pr i nt f ( ) function.
TIP: Do not put increment operators or decrement operators
in function calls because you cannot predict the order in which
they execute.
Examples
1. You can put more than one expression on a line, using the
comma as a sequence point. The following program does
this.
/ / Fi l ename: C11COM1. CPP
/ / I l l ust r at es t he sequence poi nt .
#i ncl ude <i ost r eam. h>
mai n( )
{
i nt num, sq, cube;
num= 5;
/ / Cal cul at e t he squar e and cube of t he number .
sq = ( num* num) , cube = ( num* num* num) ;
cout << The squar e of << num<< i s << sq <<
and t he cube i s << cube;
r et ur n 0;
}
Chapter 11 o Additional C ++ O perators
234
This is not necessarily recommended, however, because it
doesnt add anything to the program and actually decreases
its readability. In this example, the square and cube are
probably better computed on two separate lines.
2. The comma enables some interesting statements. Consider
the following section of code.
i = 10
j = ( i = 12, i + 8) ;
When this code finishes executing, j has the value of 20
even though this is not necessarily clear. In the first state-
ment, i is assigned 10. In the second statement, the comma
causes i to be assigned a value of 12, then j is assigned the
value of i + 8, or 20.
3. In the following section of code, ans is assigned the value
of 12, because the assignment before the comma is per-
formed first. Despite this right-to-left associativity of the
assignment operator, the commas sequence point forces
the assignment of 12 to x before x is assigned to ans.
ans = ( y = 8, x = 12) ;
When this fragment finishes, y contains 8, x contains 12, and
ans also contains 12.
Bitwise Operators
The bitwise operators manipulate internal representations of
data and not just values in variables as the other operators do.
These bitwise operators require an understanding of Appendix As
binary numbering system, as well as a computers memory. This
section introduces the bitwise operators. The bitwise operators are
used for advanced programming techniques and are generally used
in much more complicated programs than this book covers.
Some people program in C++ for years and never learn the
bitwise operators. Nevertheless, understanding them can help you
improve a programs efficiency and enable you to operate at a more
advanced level than many other programming languages allow.
235
EXAMPLE
C+ + By
Bitwise Logic al Operators
There are four bitwise logical operators, and they are shown in
Table 11.2. These operators work on the binary representations of
integer data. This enables systems programmers to manipulate
internal bits in memory and in variables. The bitwise operators are
not just for systems programmers, however. Application program-
mers also can improve their programs efficiency in several ways.
Table 11.2. Bitwise logic al operators.
Operator Meaning
& Bitwise AND
| Bitwise inclusive OR
^ Bitwise exclusive OR
~ Bitwise 1s complement
Each of the bitwise operators makes a bit-by-bit comparison of
internal data. Bitwise operators apply only to character and integer
variables and constants, and not to floating-point data. Because
binary numbers consist of 1s and 0s, these 1s and 0s (called bits) are
compared to each other to produce the desired result for each
bitwise operator.
Before you study the examples, you should understand Table
11.3. It contains truth tables that describe the action of each bitwise
operator on an integersor charactersinternal-bit patterns.
Table 11.3. Truth tables.
Bitwise AND (&)
0 & 0 = 0
0 & 1 = 0
1 & 0 = 0
1 & 1 = 1
Bi twi se operators
make bi t- by- bi t
compari sons of
i nternal data.
continues
Chapter 11 o Additional C ++ O perators
236
Table 11.3. Continued.
Bitwise inclusive OR (| )
0 | 0 = 0
0 | 1 = 1
1 | 0 = 1
1 | 1 = 1
Bitwise exclusive OR (^ )
0 ^ 0 = 0
0 ^ 1 = 1
1 ^ 0 = 1
1 ^ 1 = 0
Bitwise 1s complement (~)
~0 = 1
~1 = 0
In bitwise truth tables, you can replace the 1 and 0 with True
and False, respectively, if it helps you to understand the result better.
For the bitwise AND (&) truth table, both bits being compared by the
& operator must be True for the result to be True. In other words,
True AND True results in True.
TIP: By replacing the 1s and 0s with True and False, you might
be able to relate the bitwise operators to the regular logical
operators, && and | | , that you use for i f comparisons.
The | bitwise operator is sometimes called the bitwise inclusive
OR operator. If one side of the | operator is 1 (True)or if both sides
are 1the result is 1 (True).
The ^operator is called bitwise exclusive OR. It means that either
side of the ^operator must be 1 (True) for the result to be 1 (True), but
both sides cannot be 1 (True) at the same time.
For bi twi se ^, one
si de or the other
but not both must
be 1.
237
EXAMPLE
C+ + By
The ~operator, called bitwise 1s complement, reverses each bit to
its opposite value.
NOTE: Bitwise 1s complement does not negate a number. As
Appendix A, Memory Addressing, Binary, and Hexadecimal
Review, shows, most computers use a 2s complement to
negate numbers. The bitwise 1s complement reverses the bit
pattern of numbers, but it doesnt add the additional 1 as the 2s
complement requires.
You can test and change individual bits inside variables to
check for patterns of data. The following examples help to illustrate
each of the four bitwise operators.
Examples
1. If you apply the bitwise & operator to numerals 9 and 14, you
receive a result of 8. Figure 11.4 shows you why this is so.
When the binary values of 9 (1001) and 14 (1110) are com-
pared on a bitwise & basis, the resulting bit pattern is 8
(1000).
Figure 11.4. Performing bitwise & on 9 and 14.
In a C++ program, you can code this bitwise comparison as
follows.
Make r esul t equal to the binary value of 9 (1001) ANDed to the
binary value of 14 (1110).
r esul t = 9 & 14;
Chapter 11 o Additional C ++ O perators
238
The r esul t variable holds 8, which is the result of the bitwise
&. The 9 (binary 1001) or 14 (binary 1110)or bothalso can
be stored in variables with the same result.
2. When you apply the bitwise | operator to the numbers 9 and
14, you get 15. When the binary values of 9 (1001) and 14
(1110) are compared on a bitwise | basis, the resulting bit
pattern is 15 (1111). r esul t s bits are 1 (True) in every posi-
tion where a 1 appears in both numbers.
In a C++ program, you can code this bitwise comparison as
follows:
r esul t = 9 | 14;
The r esul t variable holds 15, which is the result of the
bitwise | . The 9 or 14 (or both) also can be stored in
variables.
3. The bitwise ^ applied to 9 and 14 produces 7. Bitwise ^ sets
the resulting bits to 1 if one number or the others bit is 1, but
not if both of the matching bits are 1 at the same time.
In a C++ program, you can code this bitwise comparison as
follows:
r esul t = 9 ^ 14;
The r esul t variable holds 7 (binary 0111), which is the result
of the bitwise ^. The 9 or 14 (or both) also can be stored in
variables with the same result.
4. The bitwise ~ simply negates each bit. It is a unary bitwise
operator because you can apply it to only a single value at
any one time. The bitwise ~applied to 9 results in 6, as
shown in Figure 11.5.
Figure 11.5. Performing bitwise ~ on the number 9.
239
EXAMPLE
C+ + By
In a C++ program, you can code this bitwise operation like
this:
r esul t = ~9;
The r esul t variable holds 6, which is the result of the bit-
wise ~. The 9 can be stored in a variable with the same result.
5. You can take advantage of the bitwise operators to perform
tests on data that you cannot do as efficiently in other ways.
For example, suppose you want to know if the user typed an
odd or even number (assuming integers are being input).
You can use the modulus operator (%) to determine whether
the remainderafter dividing the input value by 2is 0
or 1. If the remainder is 0, the number is even. If the remain-
der is 1, the number is odd.
The bitwise operators are more efficient than other operators
because they directly compare bit patterns without using
any mathematical operations.
Because a number is even if its bit pattern ends in a 0 and
odd if its bit pattern ends in 1, you also can test for odd or
even numbers by applying the bitwise & to the data and to a
binary 1. This is more efficient than using the modulus
operator. The following program informs users if their input
value is odd or even using this technique.
Identify the file and include the input/output header file. This
program tests for odd or even input. You need a place to put the
users number, so declare the i nput variable as an integer.
Ask the user for the number to be tested. Put the users answer in
i nput . Use the bitwise operator, &, to test the number. If the bit on
the extreme right in i nput is 1, tell the user that the number is odd.
If the bit on the extreme right in i nput is 0, tell the user that the
number is even.
/ / Fi l ename: C11ODEV. CPP
/ / Uses a bi t wi se & t o det er mi ne whet her a
/ / number i s odd or even.
#i ncl ude <i ost r eam. h>
mai n( )
{
Chapter 11 o Additional C ++ O perators
240
Only bit 6
is different
i nt i nput ; / / Wi l l hol d user s number
cout << What number do you want me t o t est ? ;
ci n >> i nput ;
i f ( i nput & 1) / / Tr ue i f r esul t i s 1;
/ / ot her wi se i t i s f al se ( 0)
{ cout << The number << i nput << i s odd\ n; }
el se
{ cout << The number << i nput << i s even\ n; }
r et ur n 0;
}
6. The only difference between the bit patterns for uppercase
and lowercase characters is bit number 5 (the third bit from
the left, as shown in Appendix A, Memory Addressing,
Binary, and Hexadecimal Review). For lowercase letters, bit
5 is a 1. For uppercase letters, bit 5 is a 0. Figure 11.6 shows
how A and B differ from a and b by a single bit.
Only bit 6
is different
Figure 11.6. Bitwise difference between two uppercase and two lower-
case ASCII letters.
To convert a character to uppercase, you have to turn off
(change to a 0) bit number 5. You can apply a bitwise & to the
input character and 223 (which is 11011111 in binary) to turn
off bit 5 and convert any input character to its uppercase
equivalent. If the number is already in uppercase, this
bitwise & does not change it.
The 223 (binary 11011111) is called a bit mask because it
masks (just as masking tape masks areas not to be painted)
bit 5 so it becomes 0, if it is not already. The following
program does this to ensure that users typed uppercase
characters when they were asked for their initials.
241
EXAMPLE
C+ + By
/ / Fi l ename: C11UPCS1. CPP
/ / Conver t s t he i nput char act er s t o upper case
/ / i f t hey ar en t al r eady.
#i ncl ude <i ost r eam. h>
mai n( )
{
char f i r st , mi ddl e, l ast ; / / Wi l l hol d user s i ni t i al s
i nt bi t mask=223; / / 11011111 i n bi nar y
cout << What i s your f i r st i ni t i al ? ;
ci n >> f i r st ;
cout << What i s your mi ddl e i ni t i al ? ;
ci n >> mi ddl e;
cout << What i s your l ast i ni t i al ? ;
ci n >> l ast ;
/ / Ensur e t hat i ni t i al s ar e i n upper case.
f i r st = f i r st & bi t mask; / / Tur n of f bi t 5 i f
mi ddl e = mi ddl e & bi t mask; / / i t i s not al r eady
l ast = l ast & bi t mask; / / t ur ned of f .
cout << Your i ni t i al s ar e << f i r st << <<
mi ddl e << << l ast ;
r et ur n 0;
}
The following output shows what happens when two of the
initials are typed with lowercase letters. The program con-
verts them to uppercase before printing them again. Al-
though there are other ways to convert to lowercase, none
are as efficient as using the & bitwise operator.
What i s your f i r st i ni t i al ? g
What i s your mi ddl e i ni t i al ? M
What i s your l ast i ni t i al ? p
Your i ni t i al s ar e: G M P
Chapter 11 o Additional C ++ O perators
242
Review Questions
The answers to the review questions are in Appendix B.
1. What set of statements does the conditional operator
replace?
2. Why is the conditional operator called a ternary operator?
3. Rewrite the following conditional operator as an i f - el se
statement.
ans = ( a == b) ? c + 2 : c + 3;
4. True or false: The following statements produce the same
results.
var ++;
and
var = var + 1;
5. Why is using the increment and decrement operators more
efficient than using the addition and subtraction operators?
6. What is a sequence point?
7. Can the output of the following code section be determined?
age = 20;
pr i nt f ( You ar e now %d, and wi l l be %d i n one year ,
age, age++) ;
8. What is the output of the following program section?
char name[ 20] = Mi ke;
cout << The si ze of name i s << si zeof ( name) << \ n;
9. What is the result of each of the following bitwise True-False
expressions?
a. 1 ^ 0 & 1 & 1 | 0
b. 1 & 1 & 1 & 1
c. 1 ^ 1 ^ 1 ^ 1
d. ~( 1 ^ 0)
243
EXAMPLE
C+ + By
Review Exerc ises
1. Write a program that prints the numerals from 1 to 10. Use
ten different cout s and only one variable called r esul t to hold
the value before each cout . Use the increment operator to
add 1 to r esul t before each cout .
2. Write a program that asks users for their ages. Using a single
pr i nt f ( ) that includes a conditional operator, print on-screen
the following if the input age is over 21,
You ar e not a mi nor .
or print this otherwise:
You ar e st i l l a mi nor .
This pr i nt f ( ) might be long, but it helps to illustrate how the
conditional operator can work in statements where i f - el se
logic does not.
3. Use the conditional operatorand no i f - el se statementsto
write the following tax-calculation routine: A family pays no
tax if its annual salary is less than $5,000. It pays a 10 percent
tax if the salary range begins at $5,000 and ends at $9,999. It
pays a 20 percent tax if the salary range begins at $10,000
and ends at $19,999. Otherwise, the family pays a 30 percent
tax.
4. Write a program that converts an uppercase letter to a
lowercase letter by applying a bitmask and one of the bit-
wise logical operators. If the character is already in lower-
case, do not change it.
Summary
Now you have learned almost every operator in the C++
language. As explained in this chapter, conditional, increment, and
decrement are three operators that enable C++ to stand apart from
many other programming languages. You must always be aware of
the precedence table whenever you use these, as you must with all
operators.
Chapter 11 o Additional C ++ O perators
244
The si zeof and sequence point operators act unlike most others.
The si zeof is a compile operator, and it works in a manner similar to
the #def i ne preprocessor directive because they are both replaced by
their values at compile time. The sequence point enables you to have
multiple statements on the same lineor in a single expression.
Reserve the sequence point for declaring variables only because it
can be unclear when its combined with other expressions.
This chapter concludes the discussion on C++ operators. Now
that you can compute just about any result you will ever need, it is
time to discover how to gain more control over your programs. The
next few chapters introduce control loops that give you repetitive
power in C++.
245
EXAMPLE
C+ + By
12
The whi l e Loop
The repetitive capabilities of computers make them good tools for
processing large amounts of information. Chapters 12-15 introduce
you to C++ constructs, which are the control and looping commands
of programming languages. C++ constructs include powerful, but
succinct and efficient, looping commands similar to those of other
languages you already know.
The whi l e loops enable your programs to repeat a series of
statements, over and over, as long as a certain condition is always
met. Computers do not get bored while performing the same tasks
repeatedly. This is one reason why they are so important in business
data processing.
This chapter teaches you the following:
o The whi l e loop
o The concept of loops
o The do- whi l e loop
o Differences between i f and whi l e loops
o The exi t ( ) function
o The br eak statement
o Counters and totals
Chapter 12 o The w hile Loop
246
After completing this chapter, you should understand the first
of several methods C++ provides for repeating program sections.
This chapters discussion of loops includes one of the most impor-
tant uses for looping: creating counter and total variables.
The whi l e Statement
The whi l e statement is one of several C++ construct statements.
Each construct (from construction) is a programming language state-
mentor a series of statementsthat controls looping. The whi l e,
like other such statements, is a looping statement that controls the
execution of a series of other statements. Looping statements cause
parts of a program to execute repeatedly, as long as a certain
condition is being met.
The format of the whi l e statement is
whi l e ( t est expr essi on)
{ bl ock of one or mor e C++ st at ement s; }
The parentheses around t est expr essi on are required. As long
as t est expr essi on is True (nonzero), the block of one or more C++
statements executes repeatedly until t est expr essi on becomes False
(evaluates to zero). Braces are required before and after the body of
the whi l e loop, unless you want to execute only one statement. Each
statement in the body of the whi l e loop requires an ending semi-
colon.
The placeholder t est expr essi on usually contains relational,
and possibly logical, operators. These operators provide the True-
False condition checked in t est expr essi on. If t est expr essi on is False
when the program reaches the whi l e loop for the first time, the body
of the whi l e loop does not execute at all. Regardless of whether the
body of the whi l e loop executes no times, one time, or many times,
the statements following the whi l e loops closing brace execute if t est
expr essi on becomes False.
Because t est expr essi on determines when the loop finishes, the
body of the whi l e loop must change the variables used in t est
expr essi on. Otherwise, t est expr essi on never changes and the whi l e
loop repeats forever. This is known as an infinite loop, and you should
avoid it.
The body of a
whi l e l oop
executes repeatedl y
as l ong as test
expressi on i s True.
247
EXAMPLE
C+ + By
TIP: If the body of the whi l e loop contains only one statement,
the braces surrounding it are not required. It is a good habit to
enclose all whi l e loop statements in braces, however, because if
you have to add statements to the body of the whi l e loop later,
your braces are already there.
The Conc ept of Loops
You use the loop concept in everyday life. Any time you have
to repeat the same procedure, you are performing a loopjust as
your computer does with the whi l e statement. Suppose you are
wrapping holiday gifts. The following statements represent the
looping steps (in whi l e format) that you follow while gift-wrapping.
while (there are still unwrapped gifts)
{ Get the next gift;
Cut the wrapping paper;
Wrap the gift;
Put a bow on the gift;
Fill out a name card for the gift;
Put the wrapped gift with the others; }
Whether you have 3, 15, or 100 gifts to wrap, you use this
procedure (loop) repeatedly until every gift is wrapped. For an
example that is more easily computerized, suppose you want to total
all the checks you wrote in the previous month. You could perform
the following loop.
while (there are still checks from the last month to be totaled)
{ Add the amount of the next check to the total; }
The body of this pseudocode whi l e loop has only one statement,
but that single statement must be performed until you have added
each one of the previous months checks. When this loop ends (when
no more checks from the previous month remain to be totaled), you
have the result.
The body of a whi l e loop can contain one or more C++ state-
ments, including additional whi l e loops. Your programs will be
Chapter 12 o The w hile Loop
248
more readable if you indent the body of a whi l e loop a few spaces to
the right. The following examples illustrate this.
Examples
1. Some programs presented earlier in the book require user
input with ci n. If users do not enter appropriate values, these
programs display an error message and ask the user to enter
another value, which is an acceptable procedure.
Now that you understand the whi l e loop construct, however,
you should put the error message inside a loop. In this way,
users see the message continually until they type proper
input values, rather than once.
The following program is short, but it demonstrates a whi l e
loop that ensures valid keyboard input. It asks users
whether they want to continue. You can incorporate this
program into a larger one that requires user permission to
continue. Put a prompt, such as the one presented here, at
the bottom of a text screen. The text remains on-screen until
the user tells the program to continue executing.
Identify the file and include the necessary header file. In this
program, you want to ensure the user enters Y or N.
You have to store the users answer, so declare the ans variable as a
character. Ask the users whether they want to continue, and get
the response. If the user doesnt type Y or N, ask the user for
another response.
/ / Fi l ename: C12WHI L1. CPP
/ / I nput r out i ne t o ensur e user t ypes a
/ / cor r ect r esponse. Thi s r out i ne can be par t
/ / of a l ar ger pr ogr am.
#i ncl ude <i ost r eam. h>
mai n( )
{
char ans;
cout << Do you want t o cont i nue ( Y/ N) ? ;
ci n >> ans; / / Get user s answer
249
EXAMPLE
C+ + By
whi l e ( ( ans ! = Y ) && ( ans ! = N ) )
{ cout << \ nYou must t ype a Y or an N\ n; / / War n
/ / and ask
cout << Do you want t o cont i nue ( Y/ N) ?; / / agai n.
ci n >> ans;
} / / Body of whi l e l oop ends her e.
r et ur n 0;
}
Notice that the two ci n functions do the same thing. You
must use an initial ci n, outside the whi l e loop, to provide an
answer for the whi l e loop to check. If users type something
other than Y or N, the program prints an error message, asks
for another answer, then checks the new answer. This vali-
dation method is preferred over one where the reader only
has one additional chance to succeed.
The whi l e loop tests the test expression at the top of the loop.
This is why the loop might never execute. If the test is
initially False, the loop does not execute even once. The
output from this program is shown as follows. The program
repeats indefinitely, until the relational test is True (as soon
as the user types either Y or N).
Do you want t o cont i nue ( Y/ N) ? k
You must t ype a Y or an N
Do you want t o cont i nue ( Y/ N) ? c
You must t ype a Y or an N
Do you want t o cont i nue ( Y/ N) ? s
You must t ype a Y or an N
Do you want t o cont i nue ( Y/ N) ? 5
You must t ype a Y or an N
Do you want t o cont i nue ( Y/ N) ? Y
2. The following program is an example of an invalid whi l e
loop. See if you can find the problem.
Chapter 12 o The w hile Loop
250
/ / Fi l ename: C12WHBAD. CPP
/ / Bad use of a whi l e l oop.
#i ncl ude <i ost r eam. h>
mai n( )
{
i nt a=10, b=20;
whi l e ( a > 5)
{ cout << a i s << a << , and b i s << b << \ n;
b = 20 + a; }
r et ur n 0;
}
This whi l e loop is an example of an infinite loop. It is vital
that at least one statement inside the whi l e changes a variable
in the test expression (in this example, the variable a); other-
wise, the condition is always True. Because the variable a
does not change inside the whi l e loop, this program will
never end.
TIP: If you inadvertently write an infinite loop, you must stop
the program yourself. If you use a PC, this typically means
pressing Ctrl-Break. If you are using a UNIX-based system,
your system administrator might have to stop your programs
execution.
3. The following program asks users for a first name, then uses
a whi l e loop to count the number of characters in the name.
This is a string length program; it counts characters until it
reaches the null zero. Remember that the length of a string
equals the number of characters in the string, not including
the null zero.
/ / Fi l ename: C12WHI L2. CPP
/ / Count s t he number of l et t er s i n t he user s f i r st name.
#i ncl ude <i ost r eam. h>
mai n( )
{
char name[ 15] ; / / Wi l l hol d user s f i r st name
251
EXAMPLE
C+ + By
i nt count =0; / / Wi l l hol d t ot al char act er s i n name
/ / Get t he user s f i r st name
cout << What i s your f i r st name? ;
ci n >> name;
whi l e ( name[ count ] > 0) / / Loop unt i l nul l zer o r eached.
{ count ++; } / / Add 1 t o t he count .
cout << Your name has << count << char act er s;
r et ur n 0;
}
The loop continues as long as the value of the next character
in the name array is greater than zero. Because the last charac-
ter in the array is a null zero, the test is False on the names
last character and the statement following the body of the
loop continues.
NOTE: A built-in string function called st r l en( ) determines
the length of strings. You learn about this function in Chap-
ter 22, Character, String, and Numeric Functions.
4. The previous string-length programs whi l e loop is not as
efficient as it could be. Because a whi l e loop fails when its test
expression is zero, there is no need for the greater-than test.
By changing the test expression as the following program
shows, you can improve the efficiency of the string length
count.
/ / Fi l ename: C12WHI L3. CPP
/ / Count s t he number of l et t er s i n t he user s f i r st name.
#i ncl ude <i ost r eam. h>
mai n( )
{
char name[ 15] ; / / Wi l l hol d user s f i r st name
i nt count =0; / / Wi l l hol d t ot al char act er s i n name
/ / Get t he user s f i r st name
Chapter 12 o The w hile Loop
252
cout << What i s your f i r st name? ;
ci n >> name;
whi l e ( name[ count ] ) / / Loop unt i l nul l zer o i s r eached.
{ count ++; } / / Add 1 t o t he count .
cout << Your name has << count << char act er s;
r et ur n 0;
}
The do- whi l e Loop
The do- whi l e statement controls the do- whi l e loop, which is
similar to the whi l e loop except the relational test occurs at the end
(rather than beginning) of the loop. This ensures the body of the loop
executes at least once. The do- whi l e tests for a positive relational test;
as long as the test is True, the body of the loop continues to execute.
The format of the do- whi l e is
do
{ bl ock of one or mor e C++ st at ement s; }
whi l e ( t est expr essi on)
t est expr essi on must be enclosed in parentheses, just as it must
in a whi l e statement.
Examples
1. The following program is just like the first one you saw with
the whi l e loop (C12WHIL1.CPP), except the do- whi l e is used.
Notice the placement of t est expr essi on. Because this expres-
sion concludes the loop, user input does not have to appear
before the loop and again in the body of the loop.
/ / Fi l ename: C12WHI L4. CPP
/ / I nput r out i ne t o ensur e user t ypes a
/ / cor r ect r esponse. Thi s r out i ne mi ght be par t
/ / of a l ar ger pr ogr am.
The body of the
do- whi l e l oop
executes at l east
once.
253
EXAMPLE
C+ + By
#i ncl ude <i ost r eam. h>
mai n( )
{
char ans;
do
{ cout << \ nYou must t ype a Y or an N\ n; / / War n
/ / and ask
cout << Do you want t o cont i nue ( Y/ N) ?; / / agai n.
ci n >> ans; } / / Body of whi l e l oop
/ / ends her e.
whi l e ( ( ans ! = Y ) && ( ans ! = N ) ) ;
r et ur n 0;
}
2. Suppose you are entering sales amounts into the computer
to calculate extended totals. You want the computer to print
the quantity sold, part number, and extended total (quantity
times the price per unit), as the following program does.
/ / Fi l ename: C12I NV1. CPP
/ / Get s i nvent or y i nf or mat i on f r omuser and pr i nt s
/ / an i nvent or y det ai l l i st i ng wi t h ext ended t ot al s.
#i ncl ude <i ost r eam. h>
#i ncl ude <i omani p. h>
mai n( )
{
i nt par t _no, quant i t y;
f l oat cost , ext _cost ;
cout << *** I nvent or y Comput at i on ***\ n\ n; / / Ti t l e
/ / Get i nvent or y i nf or mat i on.
do
{ cout << What i s t he next par t number ( - 999 t o end) ? ;
ci n >> par t _no;
i f ( par t _no ! = - 999)
{ cout << How many wer e bought ? ;
ci n >> quant i t y;
cout << What i s t he uni t pr i ce of t hi s i t em? ;
Chapter 12 o The w hile Loop
254
ci n >> cost ;
ext _cost = cost * quant i t y;
cout << \ n << quant i t y << of # << par t _no <<
wi l l cost << set pr eci si on( 2) <<
ext _cost ;
cout << \ n\ n\ n; / / Pr i nt t wo bl ank l i nes.
}
} whi l e ( par t _no ! = - 999) ; / / Loop onl y i f par t
/ / number i s not - 999.
cout << End of i nvent or y comput at i on\ n;
r et ur n 0;
}
Here is the output from this program:
*** I nvent or y Comput at i on ***
What i s t he next par t number ( - 999 t o end) ? 213
How many wer e bought ? 12
What i s t he uni t pr i ce of t hi s i t em? 5. 66
12 of # 213 wi l l cost 67. 92
What i s t he next par t number ( - 999 t o end) ? 92
How many wer e bought ? 53
What i s t he uni t pr i ce of t hi s i t em? . 23
53 of # 92 wi l l cost 12. 19
What i s t he next par t number ( - 999 t o end) ? - 999
End of i nvent or y comput at i on
The do- whi l e loop controls the entry of the customer sales
information. Notice the trigger that ends the loop. If the
user enters 999 for the part number, the do- whi l e loop quits
because no part numbered 999 exists in the inventory.
However, this program can be improved in several ways.
The invoice can be printed to the printer rather than the
255
EXAMPLE
C+ + By
screen. You learn how to direct your output to a printer in
Chapter 21, Device and Character Input/Output. Also, the
inventory total (the total amount of the entire order) can be
computed. You learn how to total such data in the Counters
and Totals section later in this chapter.
The i f Loop Versus the whi l e
Loop
Some beginning programmers confuse the i f statement with
loop constructs. The whi l e and do- whi l e loops repeat a section of code
multiple times, depending on the condition being tested. The i f
statement may or may not execute a section of code; if it does, it
executes that section only once.
Use an i f statement when you want to conditionally execute a
section of code once, and use a whi l e or do- whi l e loop if you want to
execute a section more than once. Figure 12.1 shows differences
between the i f statement and the two whi l e loops.
Body executes only
once if test is true.
Test at top of loop.
Body loops continuously
as long as test is true.
Test at top of loop.
Figure 12.1. Differences between the i f statement and the two whi l e
loops.
Chapter 12 o The w hile Loop
256
The exi t ( ) Func tion and br eak
Statement
C++ provides the exi t ( ) function as a way to leave a program
early (before its natural finish). The format of exi t ( ) is
exi t ( st at us) ;
where st at us is an optional integer variable or literal. If you are
familiar with your operating systems return codes, st at us enables
you to test the results of C++ programs. In DOS, st at us is sent to the
operating systems er r or l evel environment variable, where it can be
tested by batch files.
Many times, something happens in a program that requires the
programs termination. It might be a major problem, such as a disk
drive error. Perhaps users indicate that they want to quit the
programyou can tell this by giving your users a special value to
type with ci n or scanf ( ) . You can isolate the exi t ( ) function on a line
by itself, or anywhere else that a C++ statement or function can
appear. Typically, exi t ( ) is placed in the body of an i f statement to
end the program early, depending on the result of some relational
test.
Always include the stdlib.h header file when you use exi t ( ) .
This file describes the operation of exi t ( ) to your program. When-
ever you use a function in a program, you should know its corre-
sponding #i ncl ude header file, which is usually listed in the compilers
reference manual.
Instead of exiting an entire program, however, you can use the
br eak statement to exit the current loop. The format of br eak is
br eak;
The br eak statement can go anywhere in a C++ program that
any other statement can go, but it typically appears in the body of a
whi l e or do- whi l e loop, used to leave the loop early. The following
examples illustrate the exi t ( ) function and the br eak statement.
NOTE: The br eak statement exits only the most current loop. If
you have a whi l e loop in another whi l e loop, br eak exits only the
internal loop.
The exi t ( )
functi on provi des an
earl y exi t from your
program.
The br eak
statement ends the
current l oop.
257
EXAMPLE
C+ + By
Examples
1. Here is a simple program that shows you how the exi t ( )
function works. This program looks as though it prints
several messages on-screen, but it doesnt. Because exi t ( )
appears early in the code, this program quits immediately
after mai n( ) s opening brace.
/ / C12EXI T1. CPP
/ / Qui t s ear l y due t o exi t ( ) f unct i on.
#i ncl ude <i ost r eam. h>
#i ncl ude <st dl i b. h> / / Requi r ed f or exi t ( ) .
mai n( )
{
exi t ( 0) ; / / For ces pr ogr amt o end her e.
cout << C++ pr ogr ammi ng i s f un. \ n;
cout << I l i ke l ear ni ng C++ by exampl e! \ n;
cout << C++ i s a power f ul l anguage t hat i s <<
not di f f i cul t t o l ear n. ;
r et ur n 0;
}
2. The br eak statement is not intended to be as strong a pro-
gram exit as the exi t ( ) function. Whereas exi t ( ) ends the
entire program, br eak quits only the loop that is currently
active. In other words, br eak is usually placed inside a whi l e
or do- whi l e loop to simulate a finished loop. The statement
following the loop executes after a br eak occurs, but the
program does not quit as it does with exi t ( ) .
The following program appears to print C++ i s f un! until the
user enters N to stop it. The message prints only once, how-
ever, because the br eak statement forces an early exit from
the loop.
/ / Fi l ename: C12BRK. CPP
/ / Demonst r at es t he br eak st at ement .
#i ncl ude <i ost r eam. h>
mai n( )
Chapter 12 o The w hile Loop
258
{
char user _ans;
do
{ cout << C++ i s f un! \ n;
br eak; / / Causes ear l y exi t .
cout << Do you want t o see t he message agai n ( N/ Y) ? ;
ci n >> user _ans;
} whi l e ( user _ans == Y ) ;
cout << That s al l f or now\ n;
r et ur n 0;
}
This program always produces the following output:
C++ i s f un!
That s al l f or now
You can tell from this programs output that the br eak state-
ment does not allow the do- whi l e loop to reach its natural
conclusion, but causes it to finish early. The final cout prints
because only the current loopand not the entire pro-
gramexits with the br eak statement.
3. Unlike the previous program, br eak usually appears after an
i f statement. This makes it a conditional br eak, which occurs
only if the relational test of the i f statement is True.
A good illustration of this is the inventory program you saw
earlier (C12INV1.CPP). Even though the users enter 999
when they want to quit the program, an additional i f test is
needed inside the do- whi l e. The 999 ends the do- whi l e loop,
but the body of the do- whi l e still needs an i f test, so the
remaining quantity and cost prompts are not given.
If you insert a br eak after testing for the end of the users
input, as shown in the following program, the do- whi l e will
not need the i f test. The br eak quits the do- whi l e as soon as
the user signals the end of the inventory by entering 999 as
the part number.
259
EXAMPLE
C+ + By
/ / Fi l ename: C12I NV2. CPP
/ / Get s i nvent or y i nf or mat i on f r omuser and pr i nt s
/ / an i nvent or y det ai l l i st i ng wi t h ext ended t ot al s.
#i ncl ude <i ost r eam. h>
#i ncl ude <i omani p. h>
mai n( )
{
i nt par t _no, quant i t y;
f l oat cost , ext _cost ;
cout << *** I nvent or y Comput at i on ***\ n\ n; / / Ti t l e
/ / Get i nvent or y i nf or mat i on
do
{ cout << What i s t he next par t number ( - 999 t o end) ? ;
ci n >> par t _no;
i f ( par t _no == - 999)
{ br eak; } / / Exi t t he l oop i f
/ / no mor e par t number s.
cout << How many wer e bought ? ;
ci n >> quant i t y;
cout << What i s t he uni t pr i ce of t hi s i t em? ;
ci n >> cost ;
cout << \ n << quant i t y << of # << par t _no <<
wi l l cost << set pr eci si on( 2) << cost *quant i t y;
cout << \ n\ n\ n; / / Pr i nt t wo bl ank l i nes.
} whi l e ( par t _no ! = - 999) ; / / Loop onl y i f par t
/ / number i s not - 999.
cout << End of i nvent or y comput at i on\ n;
r et ur n 0;
}
4. You can use the following program to control the two other
programs. This program illustrates how C++ can pass in-
formation to DOS with exi t ( ) . This is your first example of a
menu program. Similar to a restaurant menu, a C++ menu
program lists possible user choices. The users decide what
they want the computer to do from the menus available
options. The mailing list application in Appendix F, The
Mailing List Application, uses a menu for its user options.
Chapter 12 o The w hile Loop
260
This program returns either a 1 or a 2 to its operating system,
depending on the users selection. It is then up to the oper-
ating system to test the exi t value and run the proper
program.
/ / Fi l ename: C12EXI T2. CPP
/ / Asks user f or hi s or her sel ect i on and r et ur ns
/ / t hat sel ect i on t o t he oper at i ng syst emwi t h exi t ( ) .
#i ncl ude <i ost r eam. h>
#i ncl ude <st dl i b. h>
mai n( )
{
i nt ans;
do
{ cout << Do you want t o: \ n\ n;
cout << \ t 1. Run t he wor d pr ocessor \ n\ n;
cout << \ t 2. Run t he dat abase pr ogr am\ n\ n;
cout << What i s your sel ect i on? ;
ci n >> ans;
} whi l e ( ( ans ! = 1) && ( ans ! = 2) ) ; / / Ensur es user
/ / ent er s 1 or 2.
exi t ( ans) ; / / Ret ur n val ue t o oper at i ng syst em.
r et ur n 0; / / Ret ur n does not ever execut e due t o exi t ( ) .
}
Counters and Totals
Counting is important for many applications. You might have
to know how many customers you have or how many people scored
over a certain average in your class. You might want to count how
many checks you wrote in the previous month with your computer-
ized checkbook system.
Before you develop C++ routines to count occurrences, think of
how you count in your own mind. If you were adding a total number
of something, such as the stamps in your stamp collection or the
261
EXAMPLE
C+ + By
number of wedding invitations you sent out, you would probably
do the following:
Start at 0, and add 1 for each item being counted. When you are finished,
you should have the total number (or the total count).
This is all you do when you count with C++: Assign 0 to a
variable and add 1 to it every time you process another data value.
The increment operator (++) is especially useful for counting.
Examples
1. To illustrate using a counter, the following program prints
Comput er s ar e f un! on-screen 10 times. You can write a
program that has 10 cout statements, but that would not be
efficient. It would also be too cumbersome to have 5000 cout
statements, if you wanted to print that same message 5000
times.
By adding a whi l e loop and a counter that stops after a
certain total is reached, you can control this printing, as the
following program shows.
/ / Fi l ename: C12CNT1. CPP
/ / Pr ogr amt o pr i nt a message 10 t i mes.
#i ncl ude <i ost r eam. h>
mai n( )
{
i nt ct r = 0; / / Hol ds t he number of t i mes pr i nt ed.
do
{ cout << Comput er s ar e f un! \ n;
ct r ++; / / Add one t o t he count ,
/ / af t er each cout .
} whi l e ( ct r < 10) ; / / Pr i nt agai n i f f ewer
/ / t han 10 t i mes.
r et ur n 0;
}
Chapter 12 o The w hile Loop
262
The output from this program is shown as follows. Notice
that the message prints exactly 10 times.
Comput er s ar e f un!
Comput er s ar e f un!
Comput er s ar e f un!
Comput er s ar e f un!
Comput er s ar e f un!
Comput er s ar e f un!
Comput er s ar e f un!
Comput er s ar e f un!
Comput er s ar e f un!
Comput er s ar e f un!
The heart of the counting process in this program is the
statement that follows.
ct r ++;
You learned earlier that the increment operator adds 1 to a
variable. In this program, the counter variable is
incremented each time the do- whi l e loops. Because the only
operation performed on this line is the increment of ct r , the
prefix increment (++ct r ) produces the same results.
2. The previous program not only added to the counter vari-
able, but also performed the loop a specific number of times.
This is a common method of conditionally executing parts of
a program for a fixed number of times.
The following program is a password program. A password
is stored in an integer variable. The user must correctly enter
the matching password in three attempts. If the user does
not type the correct password in that time, the program
ends. This is a common method that dial-up computers use.
They enable a caller to try the password a fixed number of
times, then hang up the phone if that limit is exceeded. This
helps deter people from trying hundreds of different pass-
words at any one sitting.
If users guess the correct password in three tries, they see the
secret message.
263
EXAMPLE
C+ + By
/ / Fi l ename: C12PASS1. CPP
/ / Pr ogr amt o pr ompt f or a passwor d and
/ / check i t agai nst an i nt er nal one.
#i ncl ude <i ost r eam. h>
#i ncl ude <st dl i b. h>
mai n( )
{
i nt st or ed_pass = 11862;
i nt num_t r i es = 0; / / Count er f or passwor d at t empt s.
i nt user _pass;
whi l e ( num_t r i es < 3) / / Loop onl y t hr ee
/ / t i mes.
{ cout << What i s t he passwor d ( You get 3 t r i es. . . ) ? ;
ci n >> user _pass;
num_t r i es++; / / Add 1 t o count er .
i f ( user _pass == st or ed_pass)
{ cout << You ent er ed t he cor r ect passwor d. \ n;
cout << The cash saf e i s behi nd t he pi ct ur e <<
of t he shi p. \ n;
exi t ( 0) ;
}
el se
{ cout << You ent er ed t he wr ong passwor d. \ n;
i f ( num_t r i es == 3)
{ cout << Sor r y, you get no mor e chances; }
el se
{ cout << You get << ( 3- num_t r i es) <<
mor e t r i es. . . \ n; }
}
} / / End of whi l e l oop.
exi t ( 0) ;
r et ur n 0;
}
This program gives users three chances in case they type
some mistakes. After three unsuccessful attempts, the pro-
gram quits without displaying the secret message.
Chapter 12 o The w hile Loop
264
3. The following program is a letter-guessing game. It includes
a message telling users how many tries they made before
guessing the correct letter. A counter counts the number of
these tries.
/ / Fi l ename: C12GUES. CPP
/ / Let t er - guessi ng game.
#i ncl ude <i ost r eam. h>
mai n( )
{
i nt t r i es = 0;
char comp_ans, user _guess;
/ / Save t he comput er s l et t er
comp_ans = T ; / / Change t o a di f f er ent
/ / l et t er i f desi r ed.
cout << I amt hi nki ng of a l et t er . . . ;
do
{ cout << What i s your guess? ;
ci n >> user _guess;
t r i es++; / / Add 1 t o t he guess- count i ng var i abl e.
i f ( user _guess > comp_ans)
{ cout << Your guess was t oo hi gh\ n;
cout << \ nTr y agai n. . . ;
}
i f ( user _guess < comp_ans)
{ cout << Your guess was t oo l ow\ n;
cout << \ nTr y agai n. . . ;
}
} whi l e ( user _guess ! = comp_ans) ; / / Qui t when a
/ / mat ch i s f ound.
/ / They got i t r i ght , l et t hemknow.
cout << *** Congr at ul at i ons! You got i t r i ght ! \ n;
cout << I t t ook you onl y << t r i es <<
t r i es t o guess. ;
r et ur n 0;
}
265
EXAMPLE
C+ + By
Here is the output of this program:
I amt hi nki ng of a l et t er . . . What i s your guess? E
Your guess was t oo l ow
Tr y agai n. . . What i s your guess? X
Your guess was t oo hi gh
Tr y agai n. . . What i s your guess? H
Your guess was t oo l ow
Tr y agai n. . . What i s your guess? O
Your guess was t oo l ow
Tr y agai n. . . What i s your guess? U
Your guess was t oo hi gh
Tr y agai n. . . What i s your guess? Y
Your guess was t oo hi gh
Tr y agai n. . . What i s your guess? T
*** Congr at ul at i ons! You got i t r i ght !
I t t ook you onl y 7 t r i es t o guess.
Produc ing Totals
Writing a routine to add values is as easy as counting. Instead
of adding 1 to the counter variable, you add a value to the total
variable. For instance, if you want to find the total dollar amount of
checks you wrote during December, you can start at nothing (0) and
add the amount of every check written in December. Instead of
building a count, you are building a total.
When you want C++ to add values, just initialize a t ot al
variable to zero, then add each value to the total until you have
included all the values.
Chapter 12 o The w hile Loop
266
Examples
1. Suppose you want to write a program that adds your grades
for a class you are taking. The teacher has informed you that
you earn an A if you can accumulate over 450 points.
The following program keeps asking you for values until
you type 1. The 1 is a signal that you are finished entering
grades and now want to see the total. This program also
prints a congratulatory message if you have enough points
for an A.
/ / Fi l ename: C12GRAD1. CPP
/ / Adds gr ades and det er mi nes whet her you ear ned an A.
#i ncl ude <i ost r eam. h>
i ncl ude <i omani p. h>
mai n( )
{
f l oat t ot al _gr ade=0. 0;
f l oat gr ade; / / Hol ds i ndi vi dual gr ades.
do
{ cout << What i s your gr ade? ( - 1 t o end) ;
ci n >> gr ade;
i f ( gr ade >= 0. 0)
{ t ot al _gr ade += gr ade; } / / Add t o t ot al .
} whi l e ( gr ade >= 0. 0) ; / / Qui t when - 1 ent er ed.
/ / Cont r ol begi ns her e i f no mor e gr ades.
cout << \ n\ nYou made a t ot al of << set pr eci si on( 1) <<
t ot al _gr ade << poi nt s\ n;
i f ( t ot al _gr ade >= 450. 00)
{ cout << ** You made an A! ! ; }
r et ur n 0;
}
Notice that the - 1 response is not added to the total number
of points. This program checks for the - 1 before adding to
t ot al _gr ade. Here is the output from this program:
267
EXAMPLE
C+ + By
What i s your gr ade? ( - 1 t o end) 87. 6
What i s your gr ade? ( - 1 t o end) 92. 4
What i s your gr ade? ( - 1 t o end) 78. 7
What i s your gr ade? ( - 1 t o end) - 1
You made a t ot al of 258. 7 poi nt s
2. The following program is an extension of the grade-
calculating program. It not only totals the points, but also
computes their average.
To calculate the average grade, the program must first
determine how many grades were entered. This is a subtle
problem because the number of grades to be entered is
unknown in advance. Therefore, every time the user enters a
valid grade (not 1), the program must add 1 to a counter as
well as add that grade to the t ot al variable. This is a combi-
nation counting and totaling routine, which is common in
many programs.
/ / Fi l ename: C12GRAD2. CPP
/ / Adds up gr ades, comput es aver age,
/ / and det er mi nes whet her you ear ned an A.
#i ncl ude <i ost r eam. h>
#i ncl ude <i omani p. h>
mai n( )
{
f l oat t ot al _gr ade=0. 0;
f l oat gr ade_avg = 0. 0;
f l oat gr ade;
i nt gr ade_ct r = 0;
do
{ cout << What i s your gr ade? ( - 1 t o end) ;
ci n >> gr ade;
i f ( gr ade >= 0. 0)
{ t ot al _gr ade += gr ade; / / Add t o t ot al .
gr ade_ct r ++; } / / Add t o count .
} whi l e ( gr ade >= 0. 0) ; / / Qui t when - 1 ent er ed.
Chapter 12 o The w hile Loop
268
/ / Cont r ol begi ns her e i f no mor e gr ades.
gr ade_avg = ( t ot al _gr ade / gr ade_ct r ) ; / / Comput e
/ / aver age.
cout << \ nYou made a t ot al of << set pr eci si on( 1) <<
t ot al _gr ade << poi nt s. \ n;
cout << Your aver age was << gr ade_avg << \ n;
i f ( t ot al _gr ade >= 450. 0)
{ cout << ** You made an A! ! ; }
r et ur n 0;
}
Below is the output of this program. Congratulations! You
are on your way to becoming a master C++ programmer.
What i s your gr ade? ( - 1 t o end) 67. 8
What i s your gr ade? ( - 1 t o end) 98. 7
What i s your gr ade? ( - 1 t o end) 67. 8
What i s your gr ade? ( - 1 t o end) 92. 4
What i s your gr ade? ( - 1 t o end) - 1
You made a t ot al of 326. 68 poi nt s.
Your aver age was 81. 7
Review Questions
The answers to the review questions are in Appendix B.
1. What is the difference between the whi l e loop and the
do- whi l e loop?
2. What is the difference between a total variable and a counter
variable?
3. Which C++ operator is most useful for counting?
4. True or false: Braces are not required around the body of
whi l e and do- whi l e loops.
269
EXAMPLE
C+ + By
5. What is wrong with the following code?
whi l e ( sal es > 50)
cout << Your sal es ar e ver y good t hi s mont h. \ n;
cout << You wi l l get a bonus f or your hi gh sal es\ n;
6. What file must you include as a header file if you use exi t ( ) ?
7. How many times does this pr i nt f ( ) print?
i nt a=0;
do
{ pr i nt f ( Car ef ul \ n) ;
a++; }
whi l e ( a > 5) ;
8. How can you inform DOS of the program exit status?
9. What is printed to the screen in the following section of
code?
a = 1;
whi l e ( a < 4)
{ cout << Thi s i s t he out er l oop\ n;
a++;
whi l e ( a <= 25)
{ br eak;
cout << Thi s pr i nt s 25 t i mes\ n; }
}
Review Exerc ises
1. Write a program with a do- whi l e loop that prints the numer-
als from 10 to 20 (inclusive), with a blank line between each
number.
2. Write a weather-calculator program that asks for a list of the
previous 10 days temperatures, computes the average, and
prints the results. You have to compute the total as the input
occurs, then divide that total by 10 to find the average. Use a
whi l e loop for the 10 repetitions.
Chapter 12 o The w hile Loop
270
3. Rewrite the program in Exercise 2 using a do- whi l e loop.
4. Write a program, similar to the weather calculator in Exer-
cise 2, but generalize it so it computes the average of any
number of days temperatures. (Hint: You have to count the
number of temperatures to compute the final average.)
5. Write a program that produces your own ASCII table on-
screen. Dont print the first 31 characters because they are
nonprintable. Print the codes numbered 32 through 255 by
storing their numbers in integer variables and printing their
ASCII values using pr i nt f ( ) and the %c format code.
Summary
This chapter showed you two ways to produce a C++ loop: the
whi l e loop and the do- whi l e loop. These two variations of whi l e loops
differ in where they test their t est condi t i on statements. The whi l e
tests at the beginning of its loop, and the do- whi l e tests at the end.
Therefore, the body of a do- whi l e loop always executes at least once.
You also learned that the exi t ( ) function and br eak statement add
flexibility to the whi l e loops. The exi t ( ) function terminates the
program, and the br eak statement terminates only the current loop.
This chapter explained two of the most important applications
of loops: counters and totals. Your computer can be a wonderful tool
for adding and counting, due to the repetitive capabilities offered
with whi l e loops.
The next chapter extends your knowledge of loops by showing
you how to create a determinate loop, called the f or loop. This feature
is useful when you want a section of code to loop for a specified
number of times.
Part III
C++ Constructs
273
EXAMPLE
C+ + By
13
The f or Loop
The f or loop enables you to repeat sections of your program for a
specific number of times. Unlike the whi l e and do- whi l e loops, the f or
loop is a determinate loop. This means when you write your program
you can usually determine how many times the loop iterates. The
whi l e and do- whi l e loops repeat only until a condition is met. The f or
loop does this and more: It continues looping until a count (or
countdown) is reached.
After the final f or loop count is reached, execution continues
with the next statement, in sequence. This chapter focuses on the f or
loop construct by introducing
o The f or statement
o The concept of f or loops
o Nested f or loops
The f or loop is a helpful way of looping through a section of
code when you want to count, or sum , specified amounts, but it does
not replace the whi l e and do- whi l e loops.
Chapter 13 o The for Loop
274
The f or Statement
The f or statement encloses one or more C++ statements that
form the body of the loop. These statements in the loop continuously
repeat for a specified number of times. You, as the programmer,
control the number of loop repetitions.
The format of the f or loop is
f or ( st ar t expr essi on; t est expr essi on; count expr essi on)
{ Bl ock of one or mor e C++ st at ement s; }
C++ evaluates the st ar t expr essi on before the loop begins.
Typically, the st ar t expr essi on is an assignment statement (such as
ct r =1; ), but it can be any legal expression you specify. C++ evaluates
st ar t expr essi on only once, at the top of the loop.
CAUTION: Do not put a semicolon after the right parenthesis.
If you do, the f or loop interprets the body of the loop as zero
statements long! It would continue loopingdoing nothing
each timeuntil the t est expr essi on becomes False.
Every time the body of the loop repeats, the count expr essi on
executes, usually incrementing or decrementing a variable. The t est
expr essi on evaluates to True (nonzero) or False (zero), then deter-
mines whether the body of the loop repeats again.
TIP: If only one C++ statement resides in the f or loops body,
braces are not required, but they are recommended. If you add
more statements, the braces are there already, reminding you
that they are now needed.
The Conc ept of f or Loops
You use the concept of f or loops throughout your day-to-day
life. Any time you have to repeat a certain procedure a specified
number of times, that repetition becomes a good candidate for a
computerized f or loop.
The f or l oop
i terates for a
speci fi ed number
of ti mes.
275
EXAMPLE
C+ + By
To illustrate the concept of a for loop further, suppose you are
installing 10 new shutters on your house. You must do the following
steps for each shutter:
1. Move the ladder to the location of the shutter.
2. Take a shutter, hammer, and nails up the ladder.
3. Hammer the shutter to the side of the house.
4. Climb down the ladder.
You must perform each of these four steps exactly 10 times,
because you have 10 shutters. After 10 times, you dont install
another shutter because the job is finished. You are looping through
a procedure that has several steps (the block of the loop). These steps
are the body of the loop. It is not an endless loop because there are
a fixed number of shutters; you run out of shutters only after you
install all 10.
For a less physical example that might be more easily comput-
erized, suppose you have to fill out three tax returns for each of your
teenage children. (If you have three teenage children, you probably
need more than a computer to help you get through the day!) For
each child, you must perform the following steps:
1. Add the total income.
2. Add the total deductions.
3. Fill out a tax return.
4. Put it in an envelope.
5. Mail it.
You then must repeat this entire procedure two more times.
Notice how the sentence before these steps began: For each child. This
signals an idea similar to the f or loop construct.
NOTE: The f or loop tests the t est expr essi on at the top of the
loop. If the t est expr essi on is False when the f or loop begins, the
body of the loop never executes.
Chapter 13 o The for Loop
276
The Choice of Loops
Any loop construct can be written with a f or loop, a whi l e loop,
or a do- whi l e loop. Generally, you use the f or loop when you
want to count or loop a specific number of times, and reserve
the whi l e and do- whi l e loops for looping until a False condition
is met.
Examples
1. To give you a glimpse of the f or loops capabilities, this
example shows you two programs: one that uses a f or loop
and one that does not. The first one is a counting program.
Before studying its contents, look at the output. The results
illustrate the f or loop concept very well.
Identify the program and include the necessary header file. You
need a counter, so make ct r an integer variable.
1. Add one to the counter.
2. If the counter is less than or equal to 10, print its value and
repeat step one.
The program with a f or loop follows:
/ / Fi l ename: C13FOR1. CPP
/ / I nt r oduces t he f or l oop.
#i ncl ude <i ost r eam. h>
mai n( )
{
i nt ct r ;
f or ( ct r =1; ct r <=10; ct r ++) / / St ar t ct r at one.
/ / I ncr ement t hr ough l oop.
{ cout << ct r << \ n; } / / Body of f or l oop.
r et ur n 0;
}
277
EXAMPLE
C+ + By
This programs output is
1
2
3
4
5
6
7
8
9
10
Here is the same program using a do- whi l e loop:
Identify the program and include the necessary header file. You need
a counter, so make ct r an integer variable.
1. Add one to the counter.
2. Print the value of the counter.
3. If the counter is less than or equal to 10, repeat step one.
/ / Fi l ename: C13WHI 1. CPP
/ / Si mul at i ng a f or l oop wi t h a do- whi l e l oop.
#i ncl ude <i ost r eam. h>
mai n( )
{
i nt ct r =1;
do
{ cout << ct r << \ n; / / Body of do- whi l e l oop.
ct r ++; }
whi l e ( ct r <= 10) ;
r et ur n 0;
}
Notice that the f or loop is a cleaner way of controlling the
looping process. The f or loop does several things that re-
quire extra statements in a whi l e loop. With f or loops, you do
not have to write extra code to initialize variables and incre-
ment or decrement them. You can see at a glance (in the
Chapter 13 o The for Loop
278
expressions in the f or statement) exactly how the loop
executes, unlike the do- whi l e, which forces you to look at the
bottom of the loop to see how the loop stops.
2. Both of the following sample programs add the numbers
from 100 to 200. The first one uses a f or loop; the second one
does not. The first example starts with a st ar t expr essi on
bigger than 1, thus starting the loop with a bigger count
expr essi on as well.
This program has a f or loop:
/ / Fi l ename: C13FOR2. CPP
/ / Demonst r at es t ot al i ng usi ng a f or l oop.
#i ncl ude <i ost r eam. h>
mai n( )
{
i nt t ot al , ct r ;
t ot al = 0; / / Hol ds a t ot al of 100 t o 200.
f or ( ct r =100; ct r <=200; ct r ++) / / ct r i s 100, 101,
/ / 102, . . . 200
{ t ot al += ct r ; } / / Add val ue of ct r t o each i t er at i on.
cout << The t ot al i s << t ot al << \ n;
r et ur n 0;
}
The same program without a f or loop follows:
/ / Fi l ename: C13WHI 2. CPP
/ / A t ot al i ng pr ogr amusi ng a do- whi l e l oop.
#i ncl ude <i ost r eam. h>
mai n( )
{
i nt t ot al =0; / / I ni t i al i ze t ot al
i nt num=100; / / St ar t i ng val ue
do
{ t ot al += num; / / Add t o t ot al
num++; / / I ncr ement count er
279
EXAMPLE
C+ + By
} whi l e ( num<= 200) ;
cout << The t ot al i s << t ot al << \ n; ;
r et ur n 0;
}
Both programs produce this output:
The t ot al i s 15150
The body of the loop in both programs executes 101 times.
The starting value is 101, not 1 as in the previous example.
Notice that the f or loop is less complex than the do- whi l e
because the initialization, testing, and incrementing are
performed in the single f or statement.
TIP: Notice how the body of the f or loop is indented. This is a
good habit to develop because it makes it easier to see the
beginning and ending of the loops body.
3. The body of the f or loop can have more than one statement.
The following example requests five pairs of data values:
childrens first names and their ages. It prints the teacher
assigned to each child, based on the childs age. This illus-
trates a f or loop with cout functions, a ci n function, and an i f
statement in its body. Because exactly five children are
checked, the f or loop ensures the program ends after the
fifth child.
/ / Fi l ename: C13FOR3. CPP
/ / Pr ogr amt hat uses a l oop t o i nput and pr i nt
/ / t he t eacher assi gned t o each chi l d.
#i ncl ude <i ost r eam. h>
mai n( )
{
char chi l d[ 25] ; / / Hol ds chi l d s f i r st name
i nt age; / / Hol ds chi l d s age
i nt ct r ; / / The f or l oop count er var i abl e
f or ( ct r =1; ct r <=5; ct r ++)
{ cout << What i s t he next chi l d s name? ;
Chapter 13 o The for Loop
280
ci n >> chi l d;
cout << What i s t he chi l d s age? ;
ci n >> age;
i f ( age <= 5)
{ cout << \ n << chi l d << has Mr s.
<< J ones f or a t eacher \ n; }
i f ( age == 6)
{ cout << \ n << chi l d << has Mi ss
<< Smi t h f or a t eacher \ n; }
i f ( age >= 7)
{ cout << \ n << chi l d << has Mr .
<< Ander son f or a t eacher \ n; }
} / / Qui t s af t er 5 t i mes
r et ur n 0;
}
Below is the output from this program. You can improve this
program even more after learning the swi t ch statement in the
next chapter.
What i s t he next chi l d s name? J oe
What i s t he chi l d s age? 5
J oe has Mr s. J ones f or a t eacher
What i s t he next chi l d s name? Lar r y
What i s t he chi l d s age? 6
Lar r y has Mi ss Smi t h f or a t eacher
What i s t he next chi l d s name? J ul i e
What i s t he chi l d s age? 9
J ul i e has Mr . Ander son f or a t eacher
What i s t he next chi l d s name? Manny
What i s t he chi l d s age? 6
Manny has Mi ss Smi t h f or a t eacher
What i s t he next chi l d s name? Lor i
What i s t he chi l d s age? 5
Lor i has Mr s. J ones f or a t eacher
281
EXAMPLE
C+ + By
4. The previous examples used an increment as the count
expr essi on. You can make the f or loop increment the loop
variable by any value. It does not have to increment by 1.
The following program prints the even numbers from 1 to
20. It then prints the odd numbers from 1 to 20. To do this,
two is added to the counter variable (rather than one, as
shown in the previous examples) each time the loop
executes.
/ / Fi l ename: C13EVOD. CPP
/ / Pr i nt s t he even number s f r om1 t o 20,
/ / t hen t he odd number s f r om1 t o 20.
#i ncl ude <i ost r eam. h>
mai n( )
{
i nt num; / / The f or l oop var i abl e
cout << Even number s bel ow 21\ n; / / Ti t l e
f or ( num=2; num<=20; num+=2)
{ cout << num<< ; } / / Pr i nt s ever y ot her number .
cout << \ nOdd number s bel ow 20\ n; / / A second t i t l e
f or ( num=1; num<=20; num+=2)
{ cout << num<< ; } / / Pr i nt s ever y ot her number .
r et ur n 0;
}
There are two loops in this program. The body of each one
consists of a single pr i nt f ( ) function. In the first half of the
program, the loop variable, num, is 2 and not 1. If it were 1,
the number 1 would print first, as it does in the odd number
section.
The two cout statements that print the titles are not part of
either loop. If they were, the program would print a title
before each number. The following shows the result of
running this program.
Chapter 13 o The for Loop
282
Even number s bel ow 21
2 4 6 8 10 12 14 16 18 20
Odd number s bel ow 20
1 3 5 7 9 11 13 15 17 19
5. You can decrement the loop variable as well. If you do, the
value is subtracted from the loop variable each time through
the loop.
The following example is a rewrite of the counting program.
It produces the reverse effect by showing a countdown.
/ / Fi l ename: C13CNTD1. CPP
/ / Count down t o t he l i f t of f .
#i ncl ude <i ost r eam. h>
mai n( )
{
i nt ct r ;
f or ( ct r =10; ct r ! =0; ct r - - )
{ cout << ct r << \ n; } / / Pr i nt ct r as i t
/ / count s down.
cout << *** Bl ast of f ! ***\ n;
r et ur n 0;
}
When decrementing a loop variable, the initial value should
be larger than the end value being tested. In this example,
the loop variable, ct r , counts down from 10 to 1. Each time
through the loop (each iteration), ct r is decremented by one.
You can see how easy it is to control a loop by looking at this
programs output, as follows.
10
9
8
7
6
5
4
3
283
EXAMPLE
C+ + By
2
1
*** Bl ast Of f ! ***
TIP: This programs f or loop test illustrates a redundancy
that you can eliminate, thanks to C++. The t est expr essi on,
ct r ! =0; tells the f or loop to continue looping until ct r is not
equal to zero. However, if ct r becomes zero (a False value),
there is no reason to add the additional ! =0 (except for clarity).
You can rewrite the f or loop as
f or ( ct r =10; ct r ; ct r - - )
without loss of meaning. This is more efficient and such an
integral part of C++ that you should become comfortable with
it. There is little loss of clarity once you adjust to it.
6. You also can make a f or loop test for something other than a
literal value. The following program combines much of what
you have learned so far. It asks for student grades and
computes an average. Because there might be a different
number of students each semester, the program first asks the
user for the number of students. Next, the program iterates
until the user enters an equal number of scores. It then com-
putes the average based on the total and the number of
student grades entered.
/ / Fi l ename: C13FOR4. CPP
/ / Comput es a gr ade aver age wi t h a f or l oop.
#i ncl ude <i ost r eam. h>
#i ncl ude <i omani p. h>
mai n( )
{
f l oat gr ade, avg;
f l oat t ot al =0. 0;
i nt num; / / Tot al number of gr ades.
i nt l oopvar ; / / Used t o cont r ol t he f or l oop
cout << \ n*** Gr ade Cal cul at i on ***\ n\ n; / / Ti t l e
Chapter 13 o The for Loop
284
cout << How many st udent s ar e t her e? ;
ci n >> num; / / Get t ot al number t o ent er
f or ( l oopvar =1; l oopvar <=num; l oopvar ++)
{ cout << \ nWhat i s t he next st udent s gr ade? ;
ci n >> gr ade;
t ot al += gr ade; } / / Keep a r unni ng t ot al
avg = t ot al / num;
cout << \ n\ nThe aver age of t hi s cl ass i s <<
set pr eci si on( 1) << avg;
r et ur n 0;
}
Due to the f or loop, the total and the average calculations do
not have to be changed if the number of students changes.
7. Because characters and integers are so closely associated in
C++, you can increment character variables in a f or loop.
The following program prints the letters A through Z with a
simple f or loop.
/ / Fi l ename: C13FOR5. CPP
/ / Pr i nt s t he al phabet wi t h a si mpl e f or l oop.
#i ncl ude <i ost r eam. h>
mai n( )
{
char l et t er ;
cout << Her e i s t he al phabet : \ n;
f or ( l et t er = A ; l et t er <= Z ; l et t er ++) / / Loops A t o Z
{ cout << << l et t er ; }
r et ur n 0;
}
This program produces the following output:
Her e i s t he al phabet :
A B C D E F G H I J K L M N O P Q R S T U V WX Y Z
285
EXAMPLE
C+ + By
8. A f or expression can be a blank, or null expression. In the
following f or loop, all the expressions are blank:
f or ( ; ; )
{ pr i nt f ( Over and over . . . ) ; }
This f or loop iterates forever. Although you should avoid
infinite loops, your program might dictate that you make a
f or loop expression blank. If you already initialized the st ar t
expr essi on earlier in the program, you are wasting computer
time to repeat it in the f or loopand C++ does not require it.
The following program omits the st ar t expr essi on and the
count expr essi on, leaving only the f or loops t est expr essi on.
Most the time, you have to omit only one of them. If you use
a f or loop without two of its expressions, consider replacing
it with a whi l e loop or a do- whi l e loop.
/ / Fi l ename: C13FOR6. CPP
/ / Uses onl y t he t est expr essi on i n
/ / t he f or l oop t o count by f i ves.
#i ncl ude <i ost r eam. h>
mai n( )
{
i nt num=5; / / St ar t i ng val ue
cout << \ nCount i ng by 5s: \ n; / / Ti t l e
f or ( ; num<=100; ) / / Cont ai ns onl y t he t est expr essi on.
{ cout << num<< \ n;
num+=5; / / I ncr ement expr essi on out si de t he l oop.
} / / End of t he l oop s body
r et ur n 0;
}
The output from this program follows:
Count i ng by 5s:
5
10
15
Chapter 13 o The for Loop
286
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
Nested f or Loops
Any C++ statement can go inside the body of a f or loopeven
another f or loop! When you put a loop in a loop, you are creating a
nested loop. The clock in a sporting event works like a nested loop.
You might think this is stretching the analogy a little far, but it truly
works. A football game counts down from 15 minutes to 0. It does
this four times. The first countdown loops from 15 to 0 (for each
minute). That countdown is nested in another that loops from 1 to 4
(for each of the four quarters).
If your program has to repeat a loop more than one time, it is a
good candidate for a nested loop. Figure 13.1 shows two outlines of
nested loops. You can think of the inside loop as looping faster
than the outside loop. In the first example, the inside f or loop counts
from 1 to 10 before the outside loop (the variable out ) can finish its
first iteration. When the outside loop finally does iterate a second
time, the inside loop starts over.
Use nested l oops
when you want to
repeat a l oop more
than once.
287
EXAMPLE
C+ + By
Inside
Loop
First
Inner
Loop
Outside
Loop
Outside
Loop
Second
Inner
Loop
Figure 13.1. Outlines of two nested loops.
The second nested loop outline shows two loops in an outside
loop. Both of these loops execute in their entirety before the outside
loop finishes its first iteration. When the outside loop starts its
second iteration, the two inside loops repeat again.
Notice the order of the braces in each example. The inside loop
always finishes, and therefore its ending brace must come before the
outside loops ending brace. Indention makes this much clearer
because you can align the braces of each loop.
Nested loops become important when you use them for array
and table processing in Chapter 23, Introducing Arrays.
NOTE: In nested loops, the inside loop (or loops) execute
completely before the outside loops next iteration.
Chapter 13 o The for Loop
288
Examples
1. The following program contains a loop in a loopa nested
loop. The inside loop counts and prints from 1 to 5. The
outside loop counts from 1 to 3. The inside loop repeats, in
its entirety, three times. In other words, this program prints
the values 1 to 5 and does so three times.
/ / Fi l ename: C13NEST1. CPP
/ / Pr i nt t he number s 1- 5 t hr ee t i mes.
/ / usi ng a nest ed l oop.
#i ncl ude <i ost r eam. h>
mai n( )
{
i nt t i mes, num; / / Out er and i nner f or l oop var i abl es
f or ( t i mes=1; t i mes<=3; t i mes++)
{
f or ( num=1; num<=5; num++)
{ cout << num; } / / I nner l oop body
cout << \ n;
} / / End of out er l oop
r et ur n 0;
}
The indention follows the standard of f or loops; every
statement in each loop is indented a few spaces. Because the
inside loop is already indented, its body is indented another
few spaces. The programs output follows:
12345
12345
12345
2. The outside loops counter variable changes each time
through the loop. If one of the inside loops control variables
is the outside loops counter variable, you see effects such as
those shown in the following program.
289
EXAMPLE
C+ + By
/ / Fi l ename: C13NEST2. CPP
/ / An i nsi de l oop cont r ol l ed by t he out er l oop s
/ / count er var i abl e.
#i ncl ude <i ost r eam. h>
mai n( )
{
i nt out er , i nner ;
f or ( out er =5; out er >=1; out er - - )
{ f or ( i nner =1; i nner <=out er ; i nner ++)
{ cout << i nner ; } / / End of i nner l oop.
cout << \ n;
}
r et ur n 0;
}
The output from this program follows. The inside loop
repeats five times (as out er counts down from 5 to 1) and
prints from five numbers to one number.
12345
1234
123
12
1
The following table traces the two variables through this
program. Sometimes you have to play computer when
learning a new concept such as nested loops. By executing a
line at a time and writing down each variables contents, you
create this table.
The out er variable The i nner variable
5 1
5 2
5 3
5 4
5 5
4 1
4 2
continues
Chapter 13 o The for Loop
290
The out er variable The i nner variable
4 3
4 4
3 1
3 2
3 3
2 1
2 2
1 1
Tip for Mathematicians
The f or statement is identical to the mathematical summation
symbol. When you write programs to simulate the summation
symbol, the f or statement is an excellent candidate. A nested
f or statement is good for double summations.
For example, the following summation
i = 30
( i / 3 * 2)
i = 1
can be rewritten as
t ot al = 0;
f or ( i =1; i <=30; i ++)
{ t ot al += ( i / 3 * 2) ; }
4. A factorial is a mathematical number used in probability
theory and statistics. A factorial of a number is the multi-
plied product of every number from 1 to the number in
question.
291
EXAMPLE
C+ + By
For example, the factorial of 4 is 24 because 4 3 2 1 = 24.
The factorial of 6 is 720 because 6 5 4 3 2 1 = 720. The
factorial of 1 is 1 by definition.
Nested loops are good candidates for writing a factorial
number-generating program. The following program asks
the user for a number, then prints the factorial of that
number.
/ / Fi l ename: C13FACT. CPP
/ / Comput es t he f act or i al of number s t hr ough
/ / t he user s number .
#i ncl ude <i ost r eam. h>
mai n( )
{
i nt out er , num, f act , t ot al ;
cout << What f act or i al do you want t o see? ;
ci n >> num;
f or ( out er =1; out er <= num; out er ++)
{ t ot al = 1; / / I ni t i al i ze t ot al f or each f act or i al .
f or ( f act =1; f act <= out er ; f act ++)
{ t ot al *= f act ; } / / Comput e each f act or i al .
}
cout << The f act or i al f or << num<< i s
<< t ot al ;
r et ur n 0;
}
The following shows the factorial of seven. You can run this
program, entering different values when asked, and see
various factorials. Be careful: factorials multiply quickly.
(A factorial of 11 wont fit in an integer variable.)
What f act or i al do you want t o see? 7
The f act or i al f or 7 i s 5040
Chapter 13 o The for Loop
292
Review Questions
The answers to the review questions are in Appendix B.
1. What is a loop?
2. True or false: The body of a f or loop contains at most one
statement.
3. What is a nested loop?
4. Why might you want to leave one or more expressions out
of the f or statements parentheses?
5. Which loop moves fastest: the inner loop or the outer
loop?
6. What is the output from the following program?
f or ( ct r =10; ct r >=1; ct r - =3)
{ cout << ct r << \ n; }
7. True or false: A f or loop is better to use than a whi l e loop
when you know in advance exactly how many iterations a
loop requires.
8. What happens when the t est expr essi on becomes False in a
f or statement?
9. True or false: The following program contains a valid nested
loop.
f or ( i =1; i <=10; i ++) ;
{ f or ( j =1; j <=5; j ++)
{ cout << i << j ; }
}
10. What is the output of the following section of code?
i =1;
st ar t =1;
end=5;
st ep=1;
293
EXAMPLE
C+ + By
f or ( ; st ar t >=end; )
{ cout << i << \ n;
st ar t +=st ep;
end- - ; }
Review Exerc ises
1. Write a program that prints the numerals 1 to 15 on-screen.
Use a f or loop to control the printing.
2. Write a program to print the numerals 15 to 1 on-screen. Use
a f or loop to control the printing.
3. Write a program that uses a f or loop to print every odd
number from 1 to 100.
4. Write a program that asks the user for her or his age. Use a
f or loop to print Happy Birthday! for every year of the
users age.
5. Write a program that uses a f or loop to print the ASCII
characters from 32 to 255 on-screen. (Hint: Use the %c conver-
sion character to print integer variables.)
6. Using the ASCII table numbers, write a program to print the
following output, using a nested f or loop. (Hint: The outside
loop should loop from 1 to 5, and the inside loops start
variable should be 65, the value of ASCII A.)
A
AB
ABC
ABCD
ABCDE
Summary
This chapter taught you how to control loops. Instead of
writing extra code around a whi l e loop, you can use the f or loop to
control the number of iterations at the time you define the loop. All
Chapter 13 o The for Loop
294
f or loops contain three parts: a st ar t expr essi on, a t est expr essi on,
and a count expr essi on.
You have now seen C++s three loop constructs: the whi l e loop,
the do- whi l e loop, and the f or loop. They are similar, but behave
differently in how they test and initialize variables. No loop is better
than the others. The programming problem should dictate which
loop to use. The next chapter (Chapter 14, Other Loop Options)
shows you more methods for controlling your loops.
295
EXAMPLE
C+ + By
14
Other Loop
Options
Now that you have mastered the looping constructs, you should
learn some loop-related statements. This chapter teaches the con-
cepts of timing loops, which enable you to slow down your programs.
Slowing program execution can be helpful if you want to display a
message for a fixed period of time or write computer games with
slower speeds so they are at a practical speed for recreational use.
You can use two additional looping commands, the br eak and
cont i nue statements, to control the loops. These statements work
with whi l e loops and f or loops.
This chapter introduces you to the following:
o Timing loops
o The br eak statement with f or loops
o The cont i nue statement with f or loops
When you master these concepts, you will be well on your way
toward writing powerful programs that process large amounts of
data.
Chapter 14 o O ther Loop O ptions
296
Timing Loops
Computers are fast, and at times you would probably like them
to be even faster. Sometimes, however, you want to slow down the
computer. Often, you have to slow the execution of games because
the computers speed makes the game unplayable. Messages that
appear on-screen many times clear too fast for the user to read if you
dont delay them.
A nested loop is a perfect place for a timing loop, which simply
cycles through a f or or whi l e loop many times. The larger the end
value of the f or loop, the longer the time in which the loop repeats.
A nested loop is appropriate for displaying error messages to
your user. If the user requested a reportbut had not entered
enough data for your program to print the reportyou might print
a warning message on-screen for a few seconds, telling users that
they cannot request the report yet. After displaying the message for
a few seconds, you can clear the message and give the user another
chance. (The example program in Appendix F, The Mailing List
Application, uses timing loops to display error messages.)
There is no way to determine how many iterations a timing
loop takes for one second (or minute or hour) of delay because
computers run at different speeds. You therefore have to adjust your
timing loops end value to set the delay to your liking.
Examples
1. Timing loops are easy to writesimply put an empty f or
loop inside the program. The following program is a rewrit-
ten version of the countdown program (C13CNTD1.CPP)
you saw in Chapter 13. Each number in the countdown is
delayed so the countdown does not seem to take place
instantly. (Adjust the delay value if this program runs too
slowly or too quickly on your computer.)
Identify the program and include the input/output header file. You
need a counter and a delay, so make cd and del ay integer variables.
Start the counter at 10, and start the del ay at 1.
1. If the del ay is less than or equal to 30,000, add 1 to its value
and repeat step one.
Ti mi ng l oops make
the computer wai t.
297
EXAMPLE
C+ + By
2. Print the value of the counter.
3. If the counter is greater than or equal to 0, subtract 1 from its
value and repeat step one.
Print a blast-off message.
/ / Fi l ename: C14CNTD1. CPP
/ / Count down t o t he l i f t of f wi t h a del ay.
#i ncl ude <i ost r eam. h>
mai n( )
{
i nt cd, del ay;
f or ( cd=10; cd>=0; cd- - )
{ { f or ( del ay=1; del ay <=30000; del ay++) ; } / / Del ay
/ / pr ogr am.
cout << cd << \ n; / / Pr i nt count down val ue.
} / / End of out er l oop
cout << Bl ast of f ! ! ! \ n;
r et ur n 0;
}
2. The following program asks users for their ages. If a user
enters an age less than 0, the program beeps (by printing an
alarm character, \ a), then displays an error message for a few
seconds by using a nested timing loop. Because an integer
does not hold a large enough value (on many computers) for
a long timing loop, you must use a nested timing loop.
(Depending on the speed of your computer, adjust the
numbers in the loop to display the message longer or
shorter.)
The program uses a rarely seen pr i nt f ( ) conversion charac-
ter, \ r , inside the loop. As you might recall from Chapter 7,
Simple Input and Output, \ r is a carriage-return character.
This conversion character moves the cursor to the beginning
of the current line, enabling the program to print blanks on
that same line. This process overwrites the error message
and it appears as though the error disappears from the
screen after a brief pause.
Chapter 14 o O ther Loop O ptions
298
/ / Fi l ename: C14TI M. CPP
/ / Di spl ays an er r or message f or a f ew seconds.
#i ncl ude <st di o. h>
mai n( )
{
i nt out er , i nner , age;
pr i nt f ( What i s your age? ) ;
scanf ( %d, &age) ;
whi l e ( age <= 0)
{ pr i nt f ( *** Your age cannot be t hat smal l ! ***) ;
/ / Ti mi ng l oop her e
f or ( out er =1; out er <=30000; out er ++)
{ f or ( i nner =1; i nner <=500; i nner ++) ; }
/ / Er ase t he message
pr i nt f ( \ r \ n\ n) ;
pr i nt f ( What i s your age? ) ;
scanf ( %d, &age) ; / / Ask agai n
}
pr i nt f ( \ n\ nThanks, I di d not t hi nk you woul d act ual l y t el l ) ;
pr i nt f ( me your age! ) ;
r et ur n 0;
}
NOTE: Notice the inside loop has a semicolon (; ) after the f or
statementwith no loop body. There is no need for a loop body
here because the computer is only cycling through the loop to
waste some time.
The br eak and f or Statements
The f or loop was designed to execute for a specified number of
times. On rare occasions, you might want the f or loop to quit before
299
EXAMPLE
C+ + By
the counting variable has reached its final value. As with whi l e loops,
you use the br eak statement to quit a f or loop early.
The br eak statement is nested in the body of the f or loop.
Programmers rarely put br eak on a line by itself, and it almost always
comes after an i f test. If the br eak were on a line by itself, the loop
would always quit early, defeating the purpose of the f or loop.
Examples
1. The following program shows what can happen when C++
encounters an unconditional br eak statement (one not pre-
ceeded by an i f statement).
Identify the program and include the input/output header files.
You need a variable to hold the current number, so make num
an integer variable. Print a Here are the numbers message.
1. Make numequal to 1. If num is less than or equal to
20, add one to it each time through the loop.
2. Print the value of num.
3. Break out of the loop.
Print a goodbye message.
/ / Fi l ename: C14BRAK1. CPP
/ / A f or l oop def eat ed by t he br eak st at ement .
#i ncl ude <i ost r eam. h>
mai n( )
{
i nt num;
cout << Her e ar e t he number s f r om1 t o 20\ n;
f or ( num=1; num<=20; num++)
{ cout << num<< \ n;
br eak; } / / Thi s l i ne exi t s t he f or l oop i mmedi at el y.
cout << That s al l , f ol ks! ;
r et ur n 0;
}
Chapter 14 o O ther Loop O ptions
300
The following shows you the result of running this program.
Notice the br eak immediately terminates the f or loop. The f or
loop might as well not be in this program.
Her e ar e t he number s f r om1 t o 20
1
That s al l , f ol ks!
2. The following program is an improved version of the pre-
ceding example. It asks users if they want to see another
number. If they do, the f or loop continues its next iteration.
If they dont, the br eak statement terminates the f or loop.
/ / Fi l ename: C14BRAK2. CPP
/ / A f or l oop r unni ng at t he user s r equest .
#i ncl ude <i ost r eam. h>
mai n( )
{
i nt num; / / Loop count er var i abl e
char ans;
cout << Her e ar e t he number s f r om1 t o 20\ n;
f or ( num=1; num<=20; num++)
{ cout << num<< \ n;
cout << Do you want t o see anot her ( Y/ N) ? ;
ci n >> ans;
i f ( ( ans == N ) | | ( ans == n ) )
{ br eak; } / / Wi l l exi t t he f or l oop
/ / i f user want s t o.
}
cout << \ nThat s al l , f ol ks! \ n;
r et ur n 0;
}
The following display shows a sample run of this program.
The f or loop prints 20 numbers, as long as the user does not
answer N to the prompt. Otherwise, the br eak terminates the
f or loop early. The statement after the body of the loop
always executes next if the br eak occurs.
301
EXAMPLE
C+ + By
Her e ar e t he number s f r om1 t o 20
1
Do you want t o see anot her ( Y/ N) ? Y
2
Do you want t o see anot her ( Y/ N) ? Y
3
Do you want t o see anot her ( Y/ N) ? Y
4
Do you want t o see anot her ( Y/ N) ? Y
5
Do you want t o see anot her ( Y/ N) ? Y
6
Do you want t o see anot her ( Y/ N) ? Y
7
Do you want t o see anot her ( Y/ N) ? Y
8
Do you want t o see anot her ( Y/ N) ? Y
9
Do you want t o see anot her ( Y/ N) ? Y
10
Do you want t o see anot her ( Y/ N) ? N
That s al l , f ol ks!
If you nest one loop inside another, the br eak terminates the
most active loop (the innermost loop in which the br eak
statement resides).
3. Use the conditional br eak (an i f statement followed by a br eak)
when you are missing data. For example, when you process
data files or large amounts of user data-entry, you might
expect 100 input numbers and receive only 95. You can use a
br eak to terminate the f or loop before it iterates the 96th time.
Suppose the teacher that used the grade-averaging program
in the preceding chapter (C13FOR4.CPP) entered an incor-
rect total number of students. Maybe she typed 16, but there
are only 14 students. The previous f or loop looped 16 times,
no matter how many students there are, because it relies on
the teachers count.
Chapter 14 o O ther Loop O ptions
302
The following grade averaging program is more sophisti-
cated than the last one. It asks the teacher for the total num-
ber of students, but if the teacher wants, she can enter 99 as
a students score. The 99 is not averaged; it is used as a
trigger value to break out of the f or loop before its normal
conclusion.
/ / Fi l ename: C14BRAK3. CPP
/ / Comput es a gr ade aver age wi t h a f or l oop,
/ / al l owi ng an ear l y exi t wi t h a br eak st at ement .
#i ncl ude <i ost r eam. h>
#i ncl ude <i omani p. h>
mai n( )
{
f l oat gr ade, avg;
f l oat t ot al =0. 0;
i nt num, count =0; / / Tot al number of gr ades and count er
i nt l oopvar ; / / Used t o cont r ol f or l oop
cout << \ n*** Gr ade Cal cul at i on ***\ n\ n; / / Ti t l e
cout << How many st udent s ar e t her e? ;
ci n >> num; / / Get t ot al number t o ent er .
f or ( l oopvar =1; l oopvar <=num; l oopvar ++)
{ cout << \ nWhat i s t he next st udent s <<
gr ade? ( - 99 t o qui t ) ;
ci n >> gr ade;
i f ( gr ade < 0. 0) / / A negat i ve number
/ / t r i gger s br eak.
{ br eak; } / / Leave t he l oop ear l y.
count ++;
t ot al += gr ade; } / / Keep a r unni ng t ot al .
avg = t ot al / count ;
cout << \ n\ nThe aver age of t hi s cl ass i s <<
set pr eci si on( 1) << avg;
r et ur n 0;
}
Notice that gr ade is tested for less than 0, not 99.0. You
cannot reliably use floating-point values to compare for
303
EXAMPLE
C+ + By
equality (due to their bit-level representations). Because no
grade is negative, any negative number triggers the br eak
statement. The following shows how this program works.
*** Gr ade Cal cul at i on ***
How many st udent s ar e t her e? 10
What i s t he next st udent s gr ade? ( - 99 t o qui t ) 87
What i s t he next st udent s gr ade? ( - 99 t o qui t ) 97
What i s t he next st udent s gr ade? ( - 99 t o qui t ) 67
What i s t he next st udent s gr ade? ( - 99 t o qui t ) 89
What i s t he next st udent s gr ade? ( - 99 t o qui t ) 94
What i s t he next st udent s gr ade? ( - 99 t o qui t ) - 99
The aver age of t hi s cl ass i s: 86. 8
The cont i nue Statement
The br eak statement exits a loop early, but the cont i nue state-
ment forces the computer to perform another iteration of the loop.
If you put a cont i nue statement in the body of a f or or a whi l e loop, the
computer ignores any statement in the loop that follows cont i nue.
The format of cont i nue is
cont i nue;
You use the cont i nue statement when data in the body of the
loop is bad, out of bounds, or unexpected. Instead of acting on the
bad data, you might want to go back to the top of the loop and try
another data value. The following examples help illustrate the use of
the cont i nue statement.
The cont i nue
statement causes
C++ to ski p al l
remai ni ng state-
ments i n a l oop.
Chapter 14 o O ther Loop O ptions
304
TIP: The cont i nue statement forces a new iteration of any of the
three loop constructs: the f or loop, the whi l e loop, and the
do- whi l e loop.
Figure 14.1 shows the difference between the br eak and cont i nue
statements.
Figure 14.1. The difference between br eak and cont i nue.
Examples
1. Although the following program seems to print the numbers
1 through 10, each followed by C++ Programming, it does
not. The cont i nue in the body of the f or loop causes an early
finish to the loop. The first cout in the f or loop executes, but
the second does notdue to the cont i nue.
br eak terminates
loop immediately
cont i nue causes loop to perform
another iteration
305
EXAMPLE
C+ + By
/ / Fi l ename: C14CON1. CPP
/ / Demonst r at es t he use of t he cont i nue st at ement .
#i ncl ude <i ost r eam. h>
mai n( )
{
i nt ct r ;
f or ( ct r =1; ct r <=10; ct r ++) / / Loop 10 t i mes.
{ cout << ct r << ;
cont i nue; / / Causes body t o end ear l y.
cout << C++ Pr ogr ammi ng\ n;
}
r et ur n 0;
}
This program produces the following output:
1 2 3 4 5 6 7 8 9 10
On some compilers, you receive a warning message when
you compile this type of program. The compiler recognizes
that the second cout is unreachable codeit never executes
due to the cont i nue statement.
Because of this fact, most programs do not use a cont i nue,
except after an i f statement. This makes it a conditional
cont i nue statement, which is more useful. The following two
examples demonstrate the conditional use of cont i nue.
2. This program asks users for five lowercase letters, one at a
time, and prints their uppercase equivalents. It uses the
ASCII table (see Appendix C, ASCII Table) to ensure that
users type lowercase letters. (These are the letters whose
ASCII numbers range from 97 to 122.) If users do not type a
lowercase letter, the program ignores the mistake with the
cont i nue statement.
/ / Fi l ename: C14CON2. CPP
/ / Pr i nt s upper case equi val ent s of f i ve l ower case l et t er s.
#i ncl ude <i ost r eam. h>
mai n( )
Chapter 14 o O ther Loop O ptions
306
{
char l et t er ;
i nt ct r ;
f or ( ct r =1; ct r <=5; ct r ++)
{ cout << Pl ease ent er a l ower case l et t er ;
ci n >> l et t er ;
i f ( ( l et t er < 97) | | ( l et t er > 122) ) / / See i f
/ / out - of - r ange.
{ cont i nue; } / / Go get anot her
l et t er - = 32; / / Subt r act 32 f r omASCI I val ue.
/ / t o get upper case.
cout << The upper case equi val ent i s <<
l et t er << \ n;
}
r et ur n 0;
}
Due to the cont i nue statement, only lowercase letters are
converted to uppercase.
3. Suppose you want to average the salaries of employees in
your company who make over $10,000 a year, but you have
only their monthly gross pay figures. The following program
might be useful. It prompts for each monthly employee
salary, annualizes it (multiplying by 12), and computes an
average. The cont i nue statement ensures that salaries less
than or equal to $10,000 are ignored in the average calcu-
lation. It enables the other salaries to fall through.
If you enter - 1 as a monthly salary, the program quits and
prints the result of the average.
/ / Fi l ename: C14CON3. CPP
/ / Aver age sal ar i es over $10, 000
#i ncl ude <i ost r eam. h>
#i ncl ude <i omani p. h>
mai n( )
{
f l oat mont h, year ; / / Mont hl y and year l y sal ar i es
f l oat avg=0. 0, t ot al =0. 0;
i nt count =0;
307
EXAMPLE
C+ + By
do
{ cout << What i s t he next mont hl y sal ar y ( - 1) <<
t o qui t ) ? ;
ci n >> mont h;
i f ( ( year =mont h*12. 00) <= 10000. 00) / / Do not add
{ cont i nue; } / / l ow sal ar i es.
i f ( mont h < 0. 0)
{ br eak; } / / Qui t i f user ent er ed - 1.
count ++; / / Add 1 t o val i d count er .
t ot al += year ; / / Add year l y sal ar y t o t ot al .
} whi l e ( mont h > 0. 0) ;
avg = t ot al / ( f l oat ) count ; / / Comput e aver age.
cout << \ n\ nThe aver age of hi gh sal ar i es <<
i s $ << set pr eci si on( 2) << avg;
r et ur n 0;
}
Notice this program uses both a cont i nue and a br eak state-
ment. The program does one of three things, depending on
each users input. It adds to the total, continues another
iteration if the salary is too low, or exits the whi l e loop (and
the average calculation) if the user types a - 1.
The following display is the output from this program:
What i s t he next mont hl y sal ar y ( - 1 t o qui t ) ? 500. 00
What i s t he next mont hl y sal ar y ( - 1 t o qui t ) ? 2000. 00
What i s t he next mont hl y sal ar y ( - 1 t o qui t ) ? 750. 00
What i s t he next mont hl y sal ar y ( - 1 t o qui t ) ? 4000. 00
What i s t he next mont hl y sal ar y ( - 1 t o qui t ) ? 5000. 00
What i s t he next mont hl y sal ar y ( - 1 t o qui t ) ? 1200. 00
What i s t he next mont hl y sal ar y ( - 1 t o qui t ) ? - 1
The aver age of hi gh sal ar i es i s $36600. 00
Chapter 14 o O ther Loop O ptions
308
Review Questions
The answers to the review questions are in Appendix B.
1. For what do you use timing loops?
2. Why do timing loop ranges have to be adjusted for different
types of computers?
3. Why do cont i nue and br eak statements rarely appear without
an i f statement controlling them?
4. What is the output from the following section of code?
f or ( i =1; i <=10; i ++)
{ cont i nue;
cout << ***** \ n;
}
5. What is the output from the following section of code?
f or ( i =1; i <=10; i ++)
{ cout << ***** \ n;
br eak;
}
6. To perform a long timing loop, why do you generally have
to use a nested loop?
Review Exerc ises
1. Write a program that prints C++ i s f un on-screen for ten
seconds. (Hint: You might have to adjust the timing loop.)
2. Make the program in Exercise 1 flash the message C++ i s f un
for ten seconds. (Hint: You might have to use several timing
loops.)
3. Write a grade averaging program for a class of 20 students.
Ignore any grade less than 0 and continue until all 20 student
grades are entered, or until the user types 99 to end the
program early.
309
EXAMPLE
C+ + By
4. Write a program that prints the numerals from 1 to 14 in one
column. To the right of the even numbers, print each
numbers square. To the right of the odd numbers, print each
numbers cube (the number raised to its third power).
Summary
In this chapter, you learned several additional ways to use and
modify your programs loops. By adding timing loops, cont i nue
statements, and br eak statements, you can better control how each
loop behaves. Being able to exit early (with the br eak statement) or
continue the next loop iteration early (with the cont i nue statement)
gives you more freedom when processing different types of data.
The next chapter (Chapter 15, The swi t ch and got o State-
ments) shows you a construct of C++ that does not loop, but relies
on the br eak statement to work properly. This is the swi t ch statement,
and it makes your program choices much easier to write.
Chapter 14 o O ther Loop O ptions
310
311
EXAMPLE
C+ + By
15
The swi t ch and
got o Statements
This chapter focuses on the swi t ch statement. It also improves the i f
and el se- i f constructs by streamlining the multiple-choice deci-
sions your programs make. The swi t ch statement does not replace
the i f statement, but it is better to use swi t ch when your programs
must perform one of many different actions.
The swi t ch and br eak statements work together. Almost every
swi t ch statement you use includes at least one br eak statement in the
body of the swi t ch. To conclude this chapterand this section of the
book on C++ constructsyou learn the got o statement, although it
is rarely used.
This chapter introduces the following:
o The swi t ch statement used for selection
o The got o statement used for branching from one part of your
program to another
If you have mastered the i f statement, you should have little
trouble with the concepts presented here. By learning the swi t ch
statement, you should be able to write menus and multiple-choice
data-entry programs with ease.
Chapter 15 o The sw itch and goto Statem ents
312
The swi t ch Statement
The swi t ch statement is sometimes called the multiple-choice
statement. The swi t ch statement enables your program to choose
from several alternatives. The format of the swi t ch statement is a little
longer than the format of other statements you have seen. Here is the
swi t ch statement:
swi t ch ( expr essi on)
{ case ( expr essi on1) : { one or mor e C++ st at ement s; }
case ( expr essi on2) : { one or mor e C++ st at ement s; }
case ( expr essi on3) : { one or mor e C++ st at ement s; }
.
.
.
def aul t : { one or mor e C++ st at ement s; }
}
The expr essi on can be an integer expression, a character, a
literal, or a variable. The subexpressions (expr essi on1, expr essi on2,
and so on) can be any other integer expression, character, literal, or
variable. The number of case expressions following the swi t ch line is
determined by your application. The one or mor e C++ st at ement s is any
block of C++ code. If the block is only one statement long, you do not
need the braces, but they are recommended.
The def aul t line is optional; most (but not all) swi t ch statements
include the default. The def aul t line does not have to be the last line
of the swi t ch body.
If expr essi on matches expr essi on1, the statements to the right of
expr essi on1 execute. If expr essi on matches expr essi on2, the statements
to the right of expr essi on2 execute. If none of the expressions match
the s wi t ch expr essi on, the default case block executes. The case
expression does not need parentheses, but the parentheses some-
times make the value easier to find.
TIP: Use a br eak statement after each case block to keep execu-
tion from falling through to the remaining case statements.
Use the swi t ch
statement when your
program makes a
mul ti pl e- choi ce
sel ecti on.
313
EXAMPLE
C+ + By
Using the swi t ch statement is easier than its format might lead
you to believe. Anywhere an i f - el se- i f combination of statements
can go, you can usually put a clearer swi t ch statement. The swi t ch
statement is much easier to follow than an i f -in-an-i f -in-an-i f
statement, as you have had to write previously.
However, the i f and el se- i f combinations of statements are not
difficult to follow. When the relational test that determines the
choice is complex and contains many && and | | operators, the i f
statement might be a better candidate. The swi t ch statement is
preferred whenever multiple-choice possibilities are based on a
single literal, variable, or expression.
TIP: Arrange case statements in the most-often to least-often
executed order to improve your programs speed.
The following examples clarify the swi t ch statement. They
compare the swi t ch statement to i f statements to help you see the
difference.
Examples
1. Suppose you are writing a program to teach your child how
to count. Your program will ask the child for a number. It
then beeps (rings the computers alarm bell) as many times
as necessary to match that number.
The following program assumes the child presses a number
key from 1 to 5. This program uses the i f - el se- i f combina-
tion to accomplish this counting-and-beeping teaching
method.
Identify the program and include the necessary header file. You
want to sound a beep and move the cursor to the next line, so
define a global variable called BEEP that does this. You need a
variable to hold the users answer, so make num an integer variable.
Ask the user for a number. Assign the users number to num. If num
is 1, call BEEP once. If num is 2, call BEEP twice. If numis 3, call BEEP
three times. If num is 4, call BEEP four times. If num is 5, call BEEP five
times.
Chapter 15 o The sw itch and goto Statem ents
314
/ / Fi l ename: C15BEEP1. CPP
/ / Beeps a desi gnat ed number of t i mes.
#i ncl ude <i ost r eam. h>
/ / Def i ne a beep cout t o save r epeat i ng pr i nt f ( ) s
/ / t hr oughout t he pr ogr am.
#def i ne BEEP cout << \ a \ n
mai n( )
{
i nt num;
/ / Request a number f r omt he chi l d
/ / ( you mi ght have t o hel p) .
cout << Pl ease ent er a number ;
ci n >> num;
/ / Use mul t i pl e i f st at ement s t o beep.
i f ( num== 1)
{ BEEP; }
el se i f ( num== 2)
{ BEEP; BEEP; }
el se i f ( num== 3)
{ BEEP; BEEP; BEEP; }
el se i f ( num== 4)
{ BEEP; BEEP; BEEP; BEEP; }
el se i f ( num== 5)
{ BEEP; BEEP; BEEP; BEEP; BEEP; }
r et ur n 0;
}
No beeps are sounded if the child enters something other
than 1 through 5. This program takes advantage of the
#def i ne preprocessor directive to define a shortcut to an
alarm cout function. In this case, the BEEP is a little clearer to
read, as long as you remember that BEEP is not a command,
but is replaced with the cout everywhere it appears.
One drawback to this type of i f -in-an-i f program is its
readability. By the time you indent the body of each i f and
el se, the program is too far to the right. There is no room for
more than five or six possibilities. More importantly, this
315
EXAMPLE
C+ + By
type of logic is difficult to follow. Because it involves a
multiple-choice selection, a swi t ch statement is much better
to use, as you can see with the following, improved version.
/ / Fi l ename: C15BEEP2. CPP
/ / Beeps a cer t ai n number of t i mes usi ng a swi t ch.
#i ncl ude <i ost r eam. h>
/ / Def i ne a beep cout t o save r epeat i ng cout s
/ / t hr oughout t he pr ogr am.
#def i ne BEEP cout << \ a \ n
mai n( )
{
i nt num;
/ / Request f r omt he chi l d ( you mi ght have t o hel p) .
cout << Pl ease ent er a number ;
ci n >> num;
swi t ch ( num)
{ case ( 1) : { BEEP;
br eak; }
case ( 2) : { BEEP; BEEP;
br eak; }
case ( 3) : { BEEP; BEEP; BEEP;
br eak; }
case ( 4) : { BEEP; BEEP; BEEP; BEEP;
br eak; }
case ( 5) : { BEEP; BEEP; BEEP; BEEP; BEEP;
br eak; }
}
r et ur n 0;
}
This example is much clearer than the previous one. The
value of numcontrols the executiononly the case that
matches numexecutes. The indention helps separate each
case.
If the child enters a number other than 1 through 5, no beeps
are sounded because there is no case expression to match
any other value and there is no default case.
Chapter 15 o The sw itch and goto Statem ents
316
Because the BEEP preprocessor directive is so short, you can
put more than one on a single line. This is not a requirement,
however. The block of statements following a case can also
be more than one statement long.
If more than one case expression is the same, only the first
expression executes.
2. If the child does not enter a 1, 2, 3, 4, or 5, nothing happens
in the previous program. What follows is the same program
modified to take advantage of the def aul t option. The def aul t
block of statements executes if none of the previous cases
match.
/ / Fi l ename: C15BEEP3. CPP
/ / Beeps a desi gnat ed number of t i mes usi ng a swi t ch.
#i ncl ude <i ost r eam. h>
/ / Def i ne a beep cout t o save r epeat i ng cout s
/ / t hr oughout t he pr ogr am.
#def i ne BEEP cout << \ a \ n
mai n( )
{
i nt num;
/ / Request a number f r omt he chi l d ( you mi ght have t o hel p) .
cout << Pl ease ent er a number ;
ci n >> num;
swi t ch ( num)
{ case ( 1) : { BEEP;
br eak; }
case ( 2) : { BEEP; BEEP;
br eak; }
case ( 3) : { BEEP; BEEP; BEEP;
br eak; }
case ( 4) : { BEEP; BEEP; BEEP; BEEP;
br eak; }
case ( 5) : { BEEP; BEEP; BEEP; BEEP; BEEP;
br eak; }
def aul t : { cout << You must ent er a number f r om <<
1 t o 5\ n;
317
EXAMPLE
C+ + By
cout << Pl ease r un t hi s pr ogr amagai n\ n;
br eak; }
}
r et ur n 0;
}
The br eak at the end of the def aul t case might seem redun-
dant. After all, no other case statements execute by falling
through from the default case. It is a good habit to put a
br eak after the def aul t case anyway. If you move the def aul t
higher in the swi t ch (it doesnt have to be the last swi t ch
option), you are more inclined to move the br eak with it
(where it is then needed).
3. To show the importance of using br eak statements in each
case expression, here is the same beeping program without
any br eak statements.
/ / Fi l ename: C15BEEP4. CPP
/ / I ncor r ect l y beeps usi ng a swi t ch.
#i ncl ude <i ost r eam. h>
/ / Def i ne a beep pr i nt f ( ) t o save r epeat i ng cout s
/ / t hr oughout t he pr ogr am.
#def i ne BEEP cout << \ a \ n
mai n( )
{
i nt num;
/ / Request a number f r omt he chi l d
/ / ( you mi ght have t o hel p) .
cout << Pl ease ent er a number ;
ci n >> num;
swi t ch ( num) / / War ni ng!
{ case ( 1) : { BEEP; } / / Wi t hout a br eak, t hi s code
case ( 2) : { BEEP; BEEP; } / / f al l s t hr ough t o t he
case ( 3) : { BEEP; BEEP; BEEP; } / / r est of t he beeps!
case ( 4) : { BEEP; BEEP; BEEP; BEEP; }
case ( 5) : { BEEP; BEEP; BEEP; BEEP; BEEP; }
def aul t : { cout << You must ent er a number <<
f r om1 t o 5\ n;
Chapter 15 o The sw itch and goto Statem ents
318
cout << Pl ease r un t hi s pr ogr amagai n\ n; }
}
r et ur n 0;
}
If the user enters a 1, the program beeps 15 times! The br eak
is not there to stop the execution from falling through to the
other cases. Unlike other programming languages such as
Pascal, C++s swi t ch statement requires that you insert br eak
statements between each case if you want only one case
executed. This is not necessarily a drawback. The trade-off of
having to specify br eak statements gives you more control in
how you handle specific cases, as shown in the next example.
4. This program controls the printing of end-of-day sales totals.
It first asks for the day of the week. If the day is Monday
through Thursday, a daily total is printed. If the day is a
Friday, a weekly total and a daily total are printed. If the day
happens to be the end of the month, a monthly sales total is
printed as well.
In a real application, these totals would come from the disk
drive rather than be assigned at the top of the program.
Also, rather than individual sales figures being printed, a
full daily, weekly, and monthly report of many sales totals
would probably be printed. You are on your way to learning
more about expanding the power of your C++ programs. For
now, concentrate on the swi t ch statement and its possibilities.
Each type of report for sales figures is handled through a
hierarchy of case statements. Because the daily amount is the
last case, it is the only report printed if the day of the week is
Monday through Thursday. If the day of the week is Friday,
the second case prints the weekly sales total and then falls
through to the daily total (because Fridays daily total must
be printed as well). If it is the end of the month, the first case
executes, falling through to the weekly total, then to the
daily sales total as well. Other languages that do not offer
this fall through flexibility are more limiting.
319
EXAMPLE
C+ + By
/ / Fi l ename: C15SALE. CPP
/ / Pr i nt s dai l y, weekl y, and mont hl y sal es t ot al s.
#i ncl ude <i ost r eam. h>
#i ncl ude <st di o. h>
mai n( )
{
f l oat dai l y=2343. 34; / / Lat er , t hese f i gur es
f l oat weekl y=13432. 65; / / come f r oma di sk f i l e
f l oat mont hl y=43468. 97; / / i nst ead of bei ng assi gned
/ / as t hey ar e her e.
char ans;
i nt day; / / Day val ue t o t r i gger cor r ect case.
/ / Mont h i s assi gned 1 t hr ough 5 ( f or Monday t hr ough
/ / Fr i day) or 6 i f i t i s t he end of t he mont h. Assume
/ / a weekl y and a dai l y pr i nt s i f i t i s t he end of t he
/ / mont h, no mat t er what t he day i s.
cout << I s t hi s t he end of t he mont h? ( Y/ N) ;
ci n >> ans;
i f ( ( ans== Y ) | | ( ans== y ) )
{ day=6; } / / Mont h val ue
el se
{ cout << What day number , 1 t hr ough 5 ( f or Mon- Fr i ) <<
i s i t ? ;
ci n >> day; }
swi t ch ( day)
{ case ( 6) : pr i nt f ( The mont hl y t ot al i s %. 2f \ n,
mont hl y) ;
case ( 5) : pr i nt f ( The weekl y t ot al i s %. 2f \ n,
weekl y) ;
def aul t : pr i nt f ( The dai l y t ot al i s %. 2f \ n, dai l y) ;
}
r et ur n 0;
}
5. The order of the case statements is not fixed. You can rear-
range the statements to make them more efficient. If only
one or two cases are being selected most of the time, put
those cases near the top of the swi t ch statement.
Chapter 15 o The sw itch and goto Statem ents
320
For example, in the previous program, most of the companys
reports are daily, but the daily option is third in the case
statements. By rearranging the case statements so the daily
report is at the top, you can speed up this program because
C++ does not have to scan two case expressions that it rarely
executes.
/ / Fi l ename: C15DEPT1. CPP
/ / Pr i nt s message dependi ng on t he depar t ment ent er ed.
#i ncl ude <i ost r eam. h>
mai n( )
{
char choi ce;
do / / Di spl ay menu and ensur e t hat user ent er s a
/ / cor r ect opt i on.
{ cout << \ nChoose your depar t ment : \ n;
cout << S - Sal es \ n;
cout << A - Account i ng \ n;
cout << E - Engi neer i ng \ n;
cout << P - Payr ol l \ n;
cout << What i s your choi ce? ;
ci n >> choi ce;
/ / Conver t choi ce t o upper case ( i f t hey
/ / ent er ed l ower case) wi t h t he ASCI I t abl e.
i f ( ( choi ce>=97) && ( choi ce<=122) )
{ choi ce - = 32; } / / Subt r act enough t o make
/ / upper case.
} whi l e ( ( choi ce! = S ) &&( choi ce! = A ) &&
( choi ce! = E ) &&( choi ce! = P ) ) ;
/ / Put Engi neer i ng f i r st because i t occur s most of t en.
swi t ch ( choi ce)
{ case ( E ) : { cout << \ n Your meet i ng i s at 2: 30;
br eak; }
case ( S ) : { cout << \ n Your meet i ng i s at 8: 30;
br eak; }
case ( A ) : { cout << \ n Your meet i ng i s at 10: 00;
br eak; }
case ( P ) : { cout << \ n Your meet i ng has been <<
cancel ed;
321
EXAMPLE
C+ + By
br eak; }
}
r et ur n 0;
}
The got o Statement
Early programming languages did not offer the flexible con-
structs that C++ gives you, such as f or loops, whi l e loops, and swi t ch
statements. Their only means of looping and comparing was with
the got o statement. C++ still includes a got o, but the other constructs
are more powerful, flexible, and easier to follow in a program.
The got o statement causes your program to jump to a different
location, rather than execute the next statement in sequence. The
format of the got o statement is
got o st at ement l abel
A st at ement l abel is named just as variables are (see Chapter 4,
Variables and Literals). A st at ement l abel cannot have the same
name as a C++ command, a C++ function, or another variable in the
program. If you use a got o statement, there must be a st at ement l abel
elsewhere in the program to which the got o branches. Execution then
continues at the statement with the st at ement l abel .
The st at ement l abel precedes a line of code. Follow all st at ement
l abel s with a colon (: ) so C++ recognizes them as labels, not
variables. You have not seen statement labels in the C++ programs
so far in this book because none of the programs needed them. A
st at ement l abel is optional unless you have a got o statement.
The following four lines of code each has a different st at ement
l abel . This is not a program, but individual lines that might be
included in a program. Notice that the st at ement l abel s are on the left.
pay: cout << Pl ace checks i n t he pr i nt er \ n;
Agai n: ci n >> name;
EndI t : cout << That i s al l t he pr ocessi ng. \ n;
CALC: amount = ( t ot al / . 5) * 1. 15;
The got o causes
executi on to j ump to
some statement
other than the
next one.
Chapter 15 o The sw itch and goto Statem ents
322
The statement labels are not intended to replace comments,
although their names reflect the code that follows. Statement labels
give got o statements a tag to go to. When your program finds the got o,
it branches to the statement labeled by the st at ement l abel . The
program then continues to execute sequentially until the next got o
changes the order again (or until the program ends).
TIP: Use identifying line labels. A repetitive calculation de-
serves a label such as Cal cI t and not x15z. Even though both are
allowed, the first one is a better indication of the codes pur-
pose.
Use got o Judiciously
The got o is not considered a good programming statement
when overused. There is a tendency, especially for beginning
programmers, to include too many got o statements in a pro-
gram. When a program branches all over the place, it becomes
difficult to follow. Some people call programs with many got o
statements spaghetti code.
To eliminate got o statements and write better structured pro-
grams, use the other looping and swi t ch constructs seen in the
previous few chapters.
The got o is not necessarily a bad statementif used judiciously.
Starting with the next chapter, you begin to break your pro-
grams into smaller modules called functions, and the got o
becomes less and less important as you write more and more
functions.
For now, become familiar with got o so you can understand
programs that use it. Some day, you might have to correct the
code of someone who used the got o.
323
EXAMPLE
C+ + By
Examples
1. The following program has a problem that is a direct result
of the got o, but it is still one of the best illustrations of the
got o statement. The program consists of an endless loop (or an
infinite loop). The first three lines (after the opening brace)
execute, then the got o in the fourth line causes execution to
loop back to the beginning and repeat the first three lines.
The got o continues to do this until you press Ctrl-Break or
ask your system administrator to cancel the program.
Identify the program and include the input/output header file. You
want to print a message, but split it over three lines. You want the
message to keep repeating, so label the first line, then use a got o to
jump back to that line.
/ / Fi l ename: C15GOTO1. CPP
/ / Pr ogr amt o show use of got o. Thi s pr ogr amends
/ / onl y when t he user pr esses Ct r l - Br eak.
#i ncl ude <i ost r eam. h>
mai n( )
{
Agai n: cout << Thi s message \ n;
cout << \ t keeps r epeat i ng \ n;
cout << \ t \ t over and over \ n;
got o Agai n; / / Repeat cont i nuousl y.
r et ur n 0;
}
Notice the st at ement l abel (Agai n in the previous example)
has a colon to separate it from the rest of the line, but there is
not a colon with the label at the got o statement. Here is the
result of running this program.
Thi s message
keeps r epeat i ng
over and over
Thi s message
keeps r epeat i ng
over and over
Chapter 15 o The sw itch and goto Statem ents
324
Thi s message
keeps r epeat i ng
over and over
Thi s message
keeps r epeat i ng
over and over
Thi s message
keeps r epeat i ng
over and over
Thi s message
keeps r epeat i ng
over and over
Thi s message
keeps r epeat i ng
over and over
Thi s message
2. It is sometimes easier to read your programs code when you
write the statement labels on separate lines. Remember that
writing maintainable programs is the goal of every good
programmer. Making your programs easier to read is a
prime consideration when you write them. The following
program is the same repeating program shown in the previ-
ous example, except the statement label is placed on a
separate line.
/ / Fi l ename: C15GOTO2. CPP
/ / Pr ogr amt o show use of got o. Thi s pr ogr amends
/ / onl y when t he user pr esses Ct r l - Br eak.
#i ncl ude <i ost r eam. h>
mai n( )
{
Agai n:
cout << Thi s message \ n;
cout << \ t keeps r epeat i ng \ n;
cout << \ t \ t over and over \ n;
got o Agai n; / / Repeat cont i nuousl y
r et ur n 0;
}
325
EXAMPLE
C+ + By
The line following the statement label is the one that ex-
ecutes next, after control is passed (by the got o) to the label.
Of course, these are silly examples. You probably dont want
to write programs with infinite loops. The got o is a statement
best preceded with an i f ; this way the got o eventually stops
branching without intervention from the user.
3. The following program is one of the worst-written programs
ever! It is the epitome of spaghetti code! However, do your
best to follow it and understand its output. By understand-
ing the flow of this output, you can hone your understand-
ing of the got o. You might also appreciate the fact that the
rest of this book uses the got o only when needed to make the
program clearer.
/ / Fi l ename: C15GOTO3. CPP
/ / Thi s pr ogr amdemonst r at es t he over use of got o.
#i ncl ude <i ost r eam. h>
mai n( )
{
got o Her e;
Fi r st :
cout << A \ n;
got o Fi nal ;
Ther e:
cout << B \ n;
got o Fi r st ;
Her e:
cout << C \ n;
got o Ther e;
Fi nal :
r et ur n 0;
}
At first glance, this program appears to print the first three
letters of the alphabet, but the got o statements make them
print in the reverse order, C, B, A. Although the program is
Chapter 15 o The sw itch and goto Statem ents
326
not a well-designed program, some indention of the lines
without statement labels make it a little more readable. This
enables you to quickly separate the statement labels from the
remaining code, as you can see from the following program.
/ / Fi l ename: C15GOTO4. CPP
/ / Thi s pr ogr amdemonst r at es t he over use of got o.
#i ncl ude <i ost r eam. h>
mai n( )
{
got o Her e;
Fi r st :
cout << A \ n;
got o Fi nal ;
Ther e:
cout << B \ n;
got o Fi r st ;
Her e:
cout << C \ n;
got o Ther e;
Fi nal :
r et ur n 0;
}
This programs listing is slightly easier to follow than the
previous one, even though both do the same thing. The
remaining programs in this book with statement labels also
use such indention.
You certainly realize that this output is better produced by
the following three lines.
cout << C \ n;
cout << B \ n;
cout << A \ n;
The got o warning is worth repeating: Use got o sparingly and
only when its use makes your program more readable and
maintainable. Usually, you can use much better commands.
327
EXAMPLE
C+ + By
Review Questions
The answers to the review questions are in Appendix B.
1. How does got o change the order in which a program nor-
mally executes?
2. What statement can substitute for an i f - el se- i f construct?
3. Which statement almost always ends each case statement in
a swi t ch?
4. True or false: The order of your case statements has no
bearing on the efficiency of your program.
5. Rewrite the following section of code using a swi t ch
statement.
i f ( num== 1)
{ cout << Al pha; }
el se i f ( num== 2)
{ cout << Bet a; }
el se i f ( num== 3)
{ cout << Gamma; }
el se
{ cout << Ot her ; }
6. Rewrite the following program using a do- whi l e loop.
Ask:
cout << What i s your f i r st name? ;
ci n >> name;
i f ( ( name[ 0] < A ) | | ( name[ 0] > Z ) )
{ got o Ask; } / / Keep aski ng unt i l t he user
/ / ent er s a val i d l et t er .
Chapter 15 o The sw itch and goto Statem ents
328
Review Exerc ises
1. Write a program using the swi t ch statement that asks users
for their age, then prints a message saying You can vote! if
they are 18, You can adopt! if they are 21, or Are you
really that young? for any other age.
2. Write a menu-driven program for your local TV cable com-
pany. Here is how to assess charges: If you are within 20
miles outside the city limits, you pay $12.00 per month; 21 to
30 miles outside the city limits, you pay $23.00 per month; 31
to 50 miles outside the city limits, you pay $34.00. No one
outside 50 miles receives the service. Prompt the users with
a menu for their residences distance from the city limits.
3. Write a program that calculates parking fees for a multilevel
parking garage. Ask whether the driver is in a car or a truck.
Charge the driver $2.00 for the first hour, $3.00 for the
second, and $5.00 for more than 2 hours. If it is a truck, add
$1.00 to the total fee. (Hint: Use one swi t ch and one i f state-
ment.)
4. Modify the previous parking problem so the charge depends
on the time of day the vehicle is parked. If the vehicle is
parked before 8 a.m., charge the fees in Exercise 3. If the
vehicle is parked after 8 a.m. and before 5 p.m., charge an
extra usage fee of 50 cents. If the vehicle is parked after 5
p.m., deduct 50 cents from the computed price. You must
prompt users for the starting time in a menu, as follows.
1. Bef or e 8 a. m.
2. Bef or e 5 p. m.
3. Af t er 5 p. m.
Summary
You now have seen the swi t ch statement and its options. With
it, you can improve the readability of a complicated i f - el se- i f
selection. The swi t ch is especially good when several outcomes are
possible, based on the users choice.
329
EXAMPLE
C+ + By
The got o statement causes an unconditional branch, and can be
difficult to follow at times. The got o statement is not used much now,
and you can almost always use a better construct. However, you
should be acquainted with as much C++ as possible in case you have
to work on programs others have written.
This ends the section on program control. The next section
introduces user-written functions. So far, you have been using
C++s built-in functions, such as st r cpy( ) and pr i nt f ( ) . Now its time
to write your own.
Chapter 15 o The sw itch and goto Statem ents
330
331
EXAMPLE
C+ + By
16
Writing C++
Func tions
Computers never become bored. They perform the same input,
output, and computations your program requiresfor as long as
you want them to do it. You can take advantage of their repetitive
natures by looking at your programs in a new way: as a series of
small routines that execute whenever you need them, however
many times you require.
This chapter approaches its subject a little differently than the
previous chapters do. It concentrates on teaching you to write your
own functions, which are modules of code that you execute and
control from the mai n( ) function. So far, the programs in this book
have consisted of a single long function called mai n( ) . As you learn
here, the mai n( ) functions primary purpose is to control the execu-
tion of other functions that follow it.
This chapter introduces the following:
o The need for functions
o How to trace functions
o How to write functions
o How to call and return from functions
Chapter 16 o W riting C ++ Functions
332
This chapter stresses the use of structured programming, some-
times called modular programming. C++ was designed in a way that
the programmer can write programs in several modules rather than
in one long block. By breaking the program into several smaller
routines (functions), you can isolate problems, write correct pro-
grams faster, and produce programs that are easier to maintain.
Func tion Basic s
When you approach an application that has to be programmed,
it is best not to sit down at the keyboard and start typing. Rather, first
think about the program and what it is supposed to do. One of the
best ways to attack a program is to start with the overall goal, then
divide this goal into several smaller tasks. You should never lose
sight of the overall goal, but think also of how individual pieces can
fit together to accomplish such a goal.
When you finally do sit down to begin coding the problem,
continue to think in terms of those pieces fitting together. Dont
approach a program as if it were one giant problem; rather, continue
to write those small pieces individually.
This does not mean you must write separate programs to do
everything. You can keep individual pieces of the overall program
togetherif you know how to write functions. Then you can use the
same functions in many different programs.
C++ programs are not like BASIC or FORTRAN programs.
C++ was designed to force you to think in a modular, or subroutine-
like, functional style. Good C++ programmers write programs that
consist of many small functions, even if their programs execute one
or more of these functions only once. Those functions work together
to produce a program quicker and easier than if the program had to
be written from scratch.
TIP: Rather than code one long program, write several smaller
routines, called functions. One of those functions must be
called mai n( ) . The mai n( ) function is always the first to execute.
It doesnt have to be first in a program, but it usually is.
C++ programs
shoul d consi st of
many smal l
functi ons.
333
EXAMPLE
C+ + By
Breaking Down Problems
If your program does very much, break it into several func-
tions. Each function should do only one primary task. For example,
if you were writing a C++ program to retrieve a list of characters
from the keyboard, alphabetize them, then print them to the screen,
you couldbut shouldntwrite all these instructions in one big
mai n( ) function, as the following C++ skeleton (program outline)
shows:
mai n( )
{
/ / :
/ / C++ code t o r et r i eve a l i st of char act er s.
/ / :
/ / C++ code t o al phabet i ze t he char act er s.
/ / :
/ / C++ code t o pr i nt t he al phabet i zed l i st on- scr een.
/ / :
r et ur n 0;
}
This skeleton is not a good way to write this program. Even
though you can type this program in only a few lines of code, it is
much better to begin breaking every program into distinct tasks so
this process becomes a habit to you. You should not use mai n( ) to do
everythingin fact, use mai n( ) to do very little except call each of the
functions that does the actual work.
A better way to organize this program is to write a separate
function for each task the program is supposed to do. This doesnt
mean that each function has to be only one line long. Rather, it means
you make every function a building block that performs only one
distinct task in the program.
The following program outline shows you a better way to write
the program just described:
mai n( )
{
get l et t er s( ) ; / / Cal l s a f unct i on t o r et r i eve t he number s.
al phabet i ze( ) ; / / Cal l s a f unct i on t o al phabet i ze
/ / l et t er s.
Chapter 16 o W riting C ++ Functions
334
pr i nt l et t er s( ) ; / / Cal l s a f unct i on t o pr i nt l et t er s
/ / on- scr een.
r et ur n 0; / / Ret ur ns t o t he oper at i ng syst em.
}
get l et t er s( )
{
/ / :
/ / C++ code t o get a l i st of char act er s.
/ / :
r et ur n 0; / / Ret ur ns t o mai n( ) .
}
al phabet i ze( )
{
/ / :
/ / C++ code t o al phabet i ze t he char act er s
/ / :
r et ur n 0; / / Ret ur ns t o mai n( ) .
}
pr i nt l et t er s( )
{
/ / :
/ / C++ code t o pr i nt t he al phabet i zed l i st on- scr een
/ / :
r et ur n 0; / / Ret ur ns t o mai n( ) .
}
The program outline shows you a much better way of writing
this program. It takes longer to type, but its much more organized.
The only action the mai n( ) function takes is to control the other
functions by calling them in a certain order. Each separate function
executes its instructions, then returns to mai n( ) , whereupon mai n( )
calls the next function until no more functions remain. The mai n( )
function then returns control of the computer to the operating
system.
Do not be too concerned about the 0 that follows the r et ur n
statement. C++ functions return values. So far, the functions youve
seen have returned zero, and that return value has been ignored.
335
EXAMPLE
C+ + By
Chapter 19, Function Return Values and Prototypes, describes
how you can use the return value for programming power.
TIP: A good rule of thumb is that a function should not be
more than one screen in length. If it is longer, you are probably
doing too much in one function and should therefore break it
into two or more functions.
The first function called mai n( ) is what you previously used to
hold the entire program. From this point, in all but the smallest of
programs, mai n( ) simply controls other functions that do the work.
These listings are not examples of real C++ programs; instead,
they are skeletons, or outlines, of programs. From these outlines, it
is easier to develop the actual full program. Before going to the
keyboard to write a program such as this, know that there are four
distinct sections: a primary function-calling mai n( ) function, a key-
board data-entry function, an alphabetizing function, and a print-
ing function.
Never lose sight of the original programming problem. (Using
the approach just described, you never will!) Look again at the mai n( )
calling routine in the preceding program. Notice that you can glance
at mai n( ) and get a feel for the overall program, without the remain-
ing statements getting in the way. This is a good example of
structured, modular programming. A large programming problem
is broken into distinct, separate modules called functions, and each
function performs one primary job in a few C++ statements.
More Func tion Basic s
Little has been said about naming and writing functions, but
you probably understand much of the goals of the previous listing
already. C++ functions generally adhere to the following rules:
1. Every function must have a name.
2. Function names are made up and assigned by the program-
mer (you!) following the same rules that apply to naming
The mai n( )
functi on i s usual l y
a cal l i ng functi on
that control s the
remai nder of the
program.
Chapter 16 o W riting C ++ Functions
336
variables: They can contain up to 32 characters, they must
begin with a letter, and they can consist of letters, numbers,
and the underscore (_ ) character.
3. All function names have one set of parentheses immediately
following them. This helps you (and C++) differentiate them
from variables. The parentheses may or may not contain
something. So far, all such parentheses in this book have
been empty (you learn more about functions in Chapter 18,
Passing Values).
4. The body of each function, starting immediately after the
closing parenthesis of the function name, must be enclosed
by braces. This means a block containing one or more state-
ments makes up the body of each function.
TIP: Use meaningful function names. Cal c_bal ance( ) is more
descriptive than xy3( ) .
Although the outline shown in the previous listing is a good
example of structured code, it can be improved by using the under-
score character (_ ) in the function names. Do you see how get _l et t er s( )
and pr i nt _l et t er s( ) are much easier to read than are get l et t er s( ) and
pr i nt l et t er s( ) ?
CAUTION: Be sure to use the underscore character (_) and not
the hyphen (- ) when naming functions and variables. If you use
a hyphen, C++ produces misleading error messages.
The following listing shows you an example of a C++ function.
You can already tell quite a bit about this function. You know, for
instance, that it isnt a complete program because it has no mai n( )
function. (All programs must have a mai n( ) function.) You know also
that the function name is cal c_i t because parentheses follow this
name. These parentheses happen to have something in them (you
learn more about this in Chapter 18). You know also that the body
of the function is enclosed in a block of braces. Inside that block is a
Al l programs must
have a mai n( )
functi on.
337
EXAMPLE
C+ + By
smaller block, the body of a whi l e loop. Finally, you recognize that the
r et ur n statement is the last line of the function.
cal c_i t ( i nt n)
{
/ / Funct i on t o pr i nt t he squar e of a number .
i nt squar e;
whi l e ( squar e <= 250)
{ squar e = n * n;
cout << The squar e of << n <<
i s << squar e << \ n;
n++; } / / A bl ock i n t he f unct i on.
r et ur n 0;
}
TIP: Not all functions require a r et ur n statement for their last
line, but it is recommended that you always include one
because it helps to show your intention to return to the calling
function at that point. Later in the book, you learn that the
r et ur n is required in certain instances. For now, develop the
habit of including a r et ur n statement.
Calling and Returning
Func tions
You have been reading much about function calling and
returning control. Although you might already understand these
phrases from their context, you can probably learn them better
through an illustration of what is meant by a function call.
A function call in C++ is like a detour on a highway. Imagine
you are traveling along the road of the primary function called
mai n( ) and then run into a function-calling statement. You must
temporarily leave the mai n( ) function and execute the function that
was called. After that function finishes (its r et ur n statement is
A functi on cal l i s l i ke
a temporary program
detour.
Chapter 16 o W riting C ++ Functions
338
reached), program control reverts to mai n( ) . In other words, when
you finish a detour, you return to the main route and continue the
trip. Control continues as mai n( ) calls other functions.
NOTE: Generally, the primary function that controls function
calls and their order is called a calling function. Functions
controlled by the calling function are called the called functions.
A complete C++ program, with functions, will make this
concept clear. The following program prints several messages to the
screen. Each message printed is determined by the order of the
functions. Before worrying too much about what this program does,
take a little time to study its structure. Notice that there are three
functions defined in the program: mai n( ) , next _f un( ) , and t hi r d_f un( ) .
A fourth function is used also, but it is the built-in C++ pr i nt f ( )
function. The three defined functions appear sequentially. The body
of each is enclosed in braces, and each has a r et ur n statement at its
end.
As you will see from the program, there is something new
following the #i ncl ude directive. The first line of every function that
mai n( ) calls is listed here and also appears above the actual function.
C++ requires these prototypes. For now, just ignore them and study
the overall format of multiple-function programs. Chapter 19, Func-
tion Return Values and Prototypes, explains prototypes.
/ / C16FUN1. CPP
/ / The f ol l owi ng pr ogr ami l l ust r at es f unct i on cal l s.
#i ncl ude <st di o. h>
next _f un( ) ; / / Pr ot ot ypes.
t hi r d_f un( ) ;
mai n( ) / / mai n( ) i s al ways t he f i r st C++ f unct i on execut ed.
{
pr i nt f ( Fi r st f unct i on cal l ed mai n( ) \ n) ;
next _f un( ) ; / / Second f unct i on i s cal l ed her e.
t hi r d_f un( ) ; / / Thi s f unct i on i s cal l ed her e.
pr i nt f ( mai n( ) i s compl et ed \ n) ; / / Al l cont r ol
/ / r et ur ns her e.
339
EXAMPLE
C+ + By
r et ur n 0; / / Cont r ol i s r et ur ned t o
/ / t he oper at i ng syst em.
} / / Thi s br ace concl udes mai n( ) .
next _f un( ) / / Second f unct i on.
/ / Par ent heses al ways r equi r ed.
{
pr i nt f ( I nsi de next _f un( ) \ n) ; / / No var i abl es ar e
/ / def i ned i n t he pr ogr am.
r et ur n 0; / / Cont r ol i s now r et ur ned t o mai n( ) .
}
t hi r d_f un( ) / / Last f unct i on i n t he pr ogr am.
{
pr i nt f ( I nsi de t hi r d_f un( ) \ n) ;
r et ur n 0; / / Al ways r et ur n f r omal l f unct i ons.
}
The output of this program follows:
Fi r st f unct i on cal l ed mai n( )
I nsi de next _f un( )
I nsi de t hi r d_f un( )
mai n( ) i s compl et ed
Figure 16.1 shows a tracing of this programs execution. Notice
that mai n( ) controls which of the other functions is called, as well as
the order of the calling. Control always returns to the calling function
after the called function finishes.
To call a function, simply type its nameincluding the paren-
thesesand follow it with a semicolon. Remember that semicolons
follow all executable statements in C++, and a function call (some-
times called a function invocation) is an executable statement. The
execution is the functions code being called. Any function can call
any other function. In the previous program, mai n( ) is the only
function that calls other functions.
Now you can tell that the following statement is a function call:
pr i nt _t ot al ( ) ;
Chapter 16 o W riting C ++ Functions
340
Figure 16.1. Tracing function calls.
Because pr i nt _t ot al is not a C++ command or built-in function
name, it must be a variable or a written functions name. Only
function names end with the parentheses, so it must be a function
call or the start of a functions code. Of the last two possibilities, it
must be a call to a function because it ends with a semicolon. If it
didnt have a semicolon, it would have to be the start of a function
definition.
When you define a function (by typing the function name and
its subsequent code inside braces), you never follow the name with
a semicolon. Notice in the previous program that mai n( ) , next _f un( ) ,
and t hi r d_f un( ) have no semicolons when they appear in the body
of the program. A semicolon follows their names only in mai n( ) ,
where these functions are called.
341
EXAMPLE
C+ + By
CAUTION: Never define a function in another function. All
function code must be listed sequentially, throughout the
program. A functions closing brace must appear before an-
other functions code can be listed.
Examples
1. Suppose you are writing a program that does the following.
First, it asks users for their departments. Then, if they are in
accounting, they receive the accounting departments report.
If they are in engineering, they receive the engineering
departments report. Finally, if they are in marketing, they
receive the marketing departments report.
The skeleton of such a program follows. The code for mai n( )
is shown in its entirety, but only a skeleton of the other
functions is shown. The swi t ch statement is a perfect
function-calling statement for such multiple-choice
selections.
/ / Skel et on of a depar t ment al r epor t pr ogr am.
#i ncl ude <i ost r eam. h>
mai n( )
{
i nt choi ce;
do
{ cout << Choose your depar t ment f r omt he <<
f ol l owi ng l i st \ n;
cout << \ t 1. Account i ng \ n;
cout << \ t 2. Engi neer i ng \ n;
cout << \ t 3. Mar ket i ng \ n;
cout << What i s your choi ce? ;
ci n >> choi ce;
} whi l e ( ( choi ce<1) | | ( choi ce>3) ) ; / / Ensur e 1, 2,
/ / or 3 i s chosen.
swi t ch choi ce
{ case( 1) : { acct _r epor t ( ) ; / / Cal l account i ng f unct i on.
Chapter 16 o W riting C ++ Functions
342
br eak; } / / Don t f al l t hr ough.
case( 2) : { eng_r epor t ( ) ; / / Cal l engi neer i ng f unct i on.
br eak; }
case( 3) : { mt g_r epor t ( ) ; / / Cal l mar ket i ng f unct i on.
br eak; }
}
r et ur n 0; / / Pr ogr amr et ur ns t o t he oper at i ng
/ / syst emwhen f i ni shed.
}
acct _r epor t ( )
{
/ / :
/ / Account i ng r epor t code goes her e.
/ / :
r et ur n 0;
}
eng_r epor t ( )
{
/ / :
/ / Engi neer i ng r epor t code goes her e.
/ / :
r et ur n 0;
}
mt g_r epor t ( )
{
/ / :
/ / Mar ket i ng r epor t code goes her e.
/ / :
r et ur n 0;
}
The bodies of swi t ch statements normally contain function
calls. You can tell that these case statements execute func-
tions. For instance, acct _r epor t ( ) ; (which is the first line of
the first case) is not a variable name or a C++ command. It
is the name of a function defined later in the program. If
users enter 1 at the menu, the function called acct _r epor t ( )
executes. When it finishes, control returns to the first case
343
EXAMPLE
C+ + By
body, and its br eak statement causes the swi t ch statement to
end. The mai n( ) function returns to DOS (or to your inte-
grated C++ environment if you are using one) when its
r et ur n statement executes.
2. In the previous example, the mai n( ) routine is not very
modular. It displays the menu, but not in a separate func-
tion, as it should. Remember that mai n( ) does very little
except control the other functions, which do all the work.
Here is a rewrite of this sample program, with a fourth
function to print the menu to the screen. This is truly a
modular example, with each function performing a single
task. Again, the last three functions are shown only as
skeleton code because the goal here is simply to illustrate
function calling and returning.
/ / Second skel et on of a depar t ment al r epor t pr ogr am.
#i ncl ude <i ost r eam. h>
mai n( )
{
i nt choi ce;
do
{ menu_pr i nt ( ) ; / / Cal l f unct i on t o pr i nt t he menu.
ci n >> choi ce;
} whi l e ( ( choi ce<1) | | ( choi ce>3) ) ; / / Ensur e 1, 2,
/ / or 3 i s chosen.
swi t ch choi ce
{ case( 1) : { acct _r epor t ( ) ; / / Cal l account i ng f unct i on.
br eak; } / / Don t f al l t hr ough.
case( 2) : { eng_r epor t ( ) ; / / Cal l engi neer i ng f unct i on.
br eak; }
case( 3) : { mt g_r epor t ( ) ; / / Cal l mar ket i ng f unct i on.
br eak; }
}
r et ur n 0; / / Pr ogr amr et ur ns t o t he oper at i ng syst em
/ / when f i ni shed.
}
menu_pr i nt ( )
{
Chapter 16 o W riting C ++ Functions
344
cout << Choose your depar t ment f r omt he f ol l owi ng"
" l i st \ n;
cout << \ t 1. Account i ng \ n;
cout << \ t 2. Engi neer i ng \ n;
cout << \ t 3. Mar ket i ng \ n;
cout << What i s your choi ce? ;
r et ur n 0; / / Ret ur n t o mai n( ) .
}
acct _r epor t ( )
{
/ / :
/ / Account i ng r epor t code goes her e.
/ / :
r et ur n 0;
}
eng_r epor t ( )
{
/ / :
/ / Engi neer i ng r epor t code goes her e.
/ / :
r et ur n 0;
}
mt g_r epor t ( )
{
/ / :
/ / Mar ket i ng r epor t code goes her e.
/ / :
r et ur n 0;
}
The menu-printing function doesnt have to follow mai n( ) .
Because its the first function called, however, it seems best
to define it there.
3. Readability is the key, so programs broken into separate
functions result in better written code. You can write and
test each function, one at a time. After you write a general
outline of the program, you can list a bunch of function calls
in mai n( ) , and define their skeletons after mai n( ) .
345
EXAMPLE
C+ + By
The body of each function initially should consist of a single
r et ur n statement, so the program compiles in its skeleton
format. As you complete each function, you can compile and
test the program. This enables you to develop more accurate
programs faster. The separate functions enable others (who
might later modify your program) to find the particular
function easily and without affecting the rest of the program.
Another useful habit, popular with many C++ programmers,
is to separate functions from each other with a comment
consisting of a line of asterisks (*) or dashes (- ). This makes it
easy, especially in longer programs, to see where a function
begins and ends. What follows is another listing of the
previous program, but now with its four functions more
clearly separated by this type of comment line.
/ / Thi r d skel et on of a depar t ment al r epor t pr ogr am.
#i ncl ude <i ost r eam. h>
mai n( )
{
i nt choi ce;
do
{ menu_pr i nt ( ) ; / / Cal l f unct i on t o pr i nt t he menu.
ci n >> choi ce;
} whi l e ( ( choi ce<1) | | ( choi ce>3) ) ; / / Ensur e 1, 2,
/ / or 3 i s chosen.
swi t ch choi ce
{ case( 1) : { acct _r epor t ( ) ; / / Cal l account i ng f unct i on.
br eak; } / / Don t f al l t hr ough.
case( 2) : { eng_r epor t ( ) ; / / Cal l engi neer i ng f unct i on.
br eak; }
case( 3) : { mt g_r epor t ( ) ; / / Cal l mar ket i ng f unct i on.
br eak; }
}
r et ur n 0; / / Pr ogr amr et ur ns t o t he oper at i ng syst em
/ / when f i ni shed.
}
/ / ********************************************************
menu_pr i nt ( )
Chapter 16 o W riting C ++ Functions
346
{
cout << Choose your depar t ment f r omt he f ol l owi ng"
" l i st \ n;
cout << \ t 1. Account i ng \ n;
cout << \ t 2. Engi neer i ng \ n;
cout << \ t 3. Mar ket i ng \ n;
cout << What i s your choi ce? ;
r et ur n 0; / / Ret ur n t o mai n( ) .
}
/ / *********************************************************
acct _r epor t ( )
{
/ / :
/ / Account i ng r epor t code goes her e.
/ / :
r et ur n 0;
}
/ / *********************************************************
eng_r epor t ( )
{
/ / :
/ / Engi neer i ng r epor t code goes her e.
/ / :
r et ur n 0;
}
/ / *********************************************************
mt g_r epor t ( )
{
/ / :
/ / Mar ket i ng r epor t code goes her e.
/ / :
r et ur n 0;
}
Due to space limitations, not all program listings in this book
separate the functions in this manner. You might find,
however, that your listings are easier to follow if you put
these separating comments between your functions. The
application in Appendix F, The Mailing List Application,
347
EXAMPLE
C+ + By
for example, uses these types of comments to separate its
functions.
4. You can execute a function more than once simply by calling
it from more than one place in a program. If you put a
function call in the body of a loop, the function executes
repeatedly until the loop finishes.
The following program prints the message C++ i s Fun!
several times on-screenforward and backwardusing
functions. Notice that mai n( ) does not make every function
call. The second function, name_pr i nt ( ) , calls the function
named r ever se_pr i nt ( ) . Trace the execution of this programs
cout s.
/ / Fi l ename: C16FUN2. CPP
/ / Pr i nt s C++ i s Fun! sever al t i mes on- scr een.
#i ncl ude <i ost r eam. h>
name_pr i nt ( ) ;
r ever se_pr i nt ( ) ;
one_per _l i ne( ) ;
mai n( )
{
i nt ct r ; / / To cont r ol l oops
f or ( ct r =1; ct r <=5; ct r ++)
{ name_pr i nt ( ) ; } / / Cal l s f unct i on f i ve t i mes.
one_per _l i ne( ) ; / / Cal l s t he pr ogr am s l ast
/ / f unct i on once.
r et ur n 0;
}
/ / *********************************************************
name_pr i nt ( )
{
/ / Pr i nt s C++ i s Fun! acr oss a l i ne, separ at ed by t abs.
cout << C++ i s Fun! \ t C++ i s Fun! \ t C++ i s Fun!
\ t C++ i s Fun! \ n;
cout << C++ i s F u n ! \ t C++ i s F u n ! <<
\ t C++ i s F u n ! \ n;
Chapter 16 o W riting C ++ Functions
348
r ever se_pr i nt ( ) ; / / Cal l next f unct i on f r omher e.
r et ur n 0; / / Ret ur ns t o mai n( ) .
}
/ / *********************************************************
r ever se_pr i nt ( )
{
/ / Pr i nt s sever al C++ i s Fun! messages,
/ / i n r ever se, separ at ed by t abs.
cout << ! nuF si ++C\ t ! nuF si ++C\ t ! nuF si ++C\ t \ n;
r et ur n 0; / / Ret ur ns t o name_pr i nt ( ) .
}
/ / *********************************************************
one_per _l i ne( )
{
/ / Pr i nt s C++ i s Fun! down t he scr een.
cout << C++\ n \ ni \ ns\ n \ nF\ nu\ nn\ n! \ n;
r et ur n 0; / / Ret ur ns t o mai n( )
}
Here is the output from this program:
C++ i s Fun! C++ i s Fun! C++ i s Fun! C++ i s Fun!
C++ i s F u n ! C++ i s F u n ! C++ i s F u n !
! nuF si ++C ! nuF si ++C ! nuF si ++C
C++ i s Fun! C++ i s Fun! C++ i s Fun! C++ i s Fun!
C++ i s F u n ! C++ i s F u n ! C++ i s F u n !
! nuF si ++C ! nuF si ++C ! nuF si ++C
C++ i s Fun! C++ i s Fun! C++ i s Fun! C++ i s Fun!
C++ i s F u n ! C++ i s F u n ! C++ i s F u n !
! nuF si ++C ! nuF si ++C ! nuF si ++C
C++ i s Fun! C++ i s Fun! C++ i s Fun! C++ i s Fun!
C++ i s F u n ! C++ i s F u n ! C++ i s F u n !
! nuF si ++C ! nuF si ++C ! nuF si ++C
C++ i s Fun! C++ i s Fun! C++ i s Fun! C++ i s Fun!
C++ i s F u n ! C++ i s F u n ! C++ i s F u n !
! nuF si ++C ! nuF si ++C ! nuF si ++C
C++
349
EXAMPLE
C+ + By
i
s
F
u
n
!
Review Questions
The answers to the review questions are in Appendix B.
1. True or false: A function should always include a r et ur n
statement as its last command.
2. What is the name of the first function executed in a C++
program?
3. Which is better: one long function or several smaller
functions? Why?
4. How do function names differ from variable names?
5. How can you use comments to help visually separate
functions?
6. What is wrong with the following program section?
cal c_i t ( )
{
cout << Get t i ng r eady t o cal cul at e t he squar e of 25 \ n;
sq_25( )
{
cout << The squar e of 25 i s << ( 25*25) ;
r et ur n 0;
}
cout << That i s a bi g number ! \ n;
r et ur n 0;
}
Chapter 16 o W riting C ++ Functions
350
7. Is the following a variable name, a function call, a function
definition, or an expression?
scan_names( ) ;
8. True or false: The following line in a C++ program is a
function call.
cout << C++ i s Fun! \ n;
Summary
You have now been exposed to truly structured programs.
Instead of typing a long program, you can break it into separate
functions. This method isolates your routines so surrounding code
doesnt clutter your program and add confusion.
Functions introduce just a little more complexity, involving the
way variable values are recognized by the programs functions. The
next chapter (Chapter 17, Variable Scope) shows you how vari-
ables are handled between functions, and helps strengthen your
structured programming skills.
Part IV
Variable Scope and
Modular Programming
353
EXAMPLE
C+ + By
17
Variable Sc ope
The concept of variable scope is most important when you write
functions. Variable scope determines which functions recognize
certain variables. If a function recognizes a variable, the variable is
visible to that function. Variable scope protects variables in one
function from other functions that might overwrite them. If a
function doesnt need access to a variable, that function shouldnt be
able to see or change the variable. In other words, the variable
should not be visible to that particular function.
This chapter introduces you to
o Global and local variables
o Passing arguments
o Automatic and static variables
o Passing parameters
The previous chapter introduced the concept of using a differ-
ent function for each task. This concept is much more useful when
you learn about local and global variable scope.
Chapter 17 o Variable Scope
354
Global Versus Loc al
Variables
If you have programmed only in BASIC, the concept of local
and global variables might be new to you. In many interpreted
versions of BASIC, all variables are global, meaning the entire
program knows each variable and has the capability to change any
of them. If you use a variable called SALES at the top of the program,
even the last line in the program can use SALES. (If you dont know
BASIC, dont despairthere will be one less habit you have to
break!)
Global variables can be dangerous. Parts of a program can
inadvertently change a variable that shouldnt be changed. For
example, suppose you are writing a program that keeps track of a
grocery stores inventory. You might keep track of sales percent-
ages, discounts, retail prices, wholesale prices, produce prices,
dairy prices, delivered prices, price changes, sales tax percentages,
holiday markups, post-holiday markdowns, and so on.
The huge number of prices in such a system is confusing. When
writing a program to keep track of every price, it would be easy to
mistakenly call both the dairy prices d_pr i ces and the delivered
prices d_pr i ces. Either C++ will not enable you to do this (you cant
define the same variable twice) or you will overwrite a value used
for something else. Whatever happens, keeping track of all these
differentbut similarly namedprices makes this program con-
fusing to write.
Global variables can be dangerous because code can inadvert-
ently overwrite a variable initialized elsewhere in the program. It is
better to make every variable local in your programs. Then, only
functions that should be able to change the variables can do so.
Local variables can be seen (and changed) only from the
function in which they are defined. Therefore, if a function defines
a variable as local, that variables scope is protected. The variable
cannot be used, changed, or erased by any other function without
special programming that you learn about shortly.
If you use only one function, mai n( ) , the concept of local and
global is academic. You know from Chapter 16, Writing C++
Functions, however, that single-function programs are not recom-
mended. It is best to write modular, structured programs made up
Gl obal vari abl es are
vi si bl e across many
program functi ons.
Local vari abl es are
vi si bl e onl y i n the
bl ock where they are
defi ned.
355
EXAMPLE
C+ + By
of many smaller functions. Therefore, you should know how to
define variables as local to only those functions that use them.
Defining Variable Sc ope
When you first learned about variables in Chapter 4, Variables
and Literals, you learned you can define variables in two places:
o Before they are used inside a function
o Before a function name, such as mai n( )
All examples in this book have declared variables with the first
method. You have yet to see an example of the second method.
Because most these programs have consisted entirely of a single
mai n( ) function, there has been no reason to differentiate the two
methods. It is only after you start using several functions in one
program that these two variable definition methods become critical.
The following rules, specific to local and global variables, are
important:
o A variable is local if and only if you define it after the opening
brace of a block, usually at the top of a function.
o A variable is global if and only if you define it outside a
function.
All variables you have seen so far have been local. They have all
been defined immediately after the opening braces of mai n( ) . There-
fore, they have been local to mai n( ) , and only mai n( ) can use them.
Other functions have no idea these variables even exist because they
belong to mai n( ) only. When the function (or block) ends, all its local
variables are destroyed.
TIP: All local variables disappear (lose their definition) when
their block ends.
Global variables are visible (known) from their point of
definition to the end of the program. If you define a global variable,
any line throughout the rest of the programno matter how many
functions and code lines follow itis able to use that global variable.
Gl obal vari abl es are
vi si bl e from thei r
defi ni ti on through
the remai nder of the
program.
Chapter 17 o Variable Scope
356
Examples
1. The following section of code defines two local variables,
i and j .
mai n( )
{
i nt i , j ; / / Local because t hey r e
/ / def i ned af t er t he br ace.
/ / Rest of mai n( ) goes her e.
}
These variables are visible to mai n( ) and not to any other
function that might follow or be called by mai n( ) .
2. The following section of code defines two global variables, g
and h.
#i ncl ude <i ost r eam. h>
i nt g, h; / / Gl obal because t hey r e
/ / def i ned bef or e a f unct i on.
mai n( )
{
/ / mai n( ) s code goes her e.
}
It doesnt matter whether your #i ncl ude lines go before or
after global variable declarations.
3. Global variables can appear before any function. In the
following program, mai n( ) uses no variables. However, both
of the two functions after mai n( ) can use sal es and pr of i t
because these variables are global.
/ / Fi l ename: C17GLO. CPP
/ / Pr ogr amt hat cont ai ns t wo gl obal var i abl es.
#i ncl ude <i ost r eam. h>
do_f un( ) ;
t hi r d_f un( ) ; / / Pr ot ot ype di scussed l at er .
mai n( )
{
cout << No var i abl es def i ned i n mai n( ) \ n\ n;
do_f un( ) ; / / Cal l t he f i r st f unct i on.
357
EXAMPLE
C+ + By
r et ur n 0;
}
f l oat sal es, pr of i t ; / / Two gl obal var i abl es.
do_f un( )
{
sal es = 20000. 00; / / Thi s var i abl e i s vi si bl e
/ / f r omt hi s poi nt down.
pr of i t = 5000. 00; / / As i s t hi s one. They ar e
/ / bot h gl obal .
cout << The sal es i n t he second f unct i on ar e <<
sal es << \ n;
cout << The pr of i t i n t he second f unct i on i s <<
pr of i t << \ n\ n;
t hi r d_f un( ) ; / / Cal l t he t hi r d f unct i on t o
/ / show t hat gl obal s ar e vi si bl e.
r et ur n 0;
}
t hi r d_f un( )
{
cout << I n t he t hi r d f unct i on: \ n;
cout << The sal es i n t he t hi r d f unct i on ar e <<
sal es << \ n;
cout << The pr of i t i n t he t hi r d f unct i on i s <<
pr of i t << \ n;
/ / I f sal es and pr of i t wer e l ocal , t hey woul d not be
/ / vi si bl e by mor e t han one f unct i on.
r et ur n 0;
}
Notice that the mai n( ) function can never use sal es and pr of i t
because they are not visible to mai n( ) even though they are
global. Remember, global variables are visible only from
their point of definition downward in the program. State-
ments that appear before global variable definitions can-
not use those variables. Here is the result of running this
program.
Chapter 17 o Variable Scope
358
No var i abl es def i ned i n mai n( )
The sal es i n t he second f unct i on ar e 20000
The pr of i t i n t he second f unct i on i s 5000
I n t he t hi r d f unct i on:
The sal es i n t he t hi r d f unct i on ar e 20000
The pr of i t i n t he t hi r d f unct i on i s 5000
TIP: Declare all global variables at the top of your pro-
grams. Even though you can define them later (between any
two functions), you can find them faster if you declare them at
the top.
4. The following program uses both local and global variables.
It should now be obvious to you that j and p are local and i
and z are global.
/ / Fi l ename: C17GLLO. CPP
/ / Pr ogr amwi t h bot h l ocal and gl obal var i abl es.
/ / Local Var i abl es Gl obal Var i abl es
/ / j , p i , z
#i ncl ude <i ost r eam. h>
pr _agai n( ) ; / / Pr ot ot ype
i nt i = 0; / / Gl obal var i abl e because i t s
/ / def i ned out si de mai n( ) .
mai n( )
{
f l oat p ; / / Local t o mai n( ) onl y.
p = 9. 0; / / Put s val ue i n gl obal var i abl e.
cout << i << , << p << \ n; / / Pr i nt s gl obal i
/ / and l ocal p.
pr _agai n( ) ; / / Cal l s next f unct i on.
r et ur n 0; / / Ret ur ns t o DOS.
}
359
EXAMPLE
C+ + By
f l oat z = 9. 0; / / Gl obal var i abl e because i t s
/ / def i ned bef or e a f unct i on.
pr _agai n( )
{
i nt j = 5; / / Local t o onl y pr _agai n( ) .
cout << j << , << z; / / Thi s can t pr i nt p! .
cout << , << i << \ n;
r et ur n 0; / / Ret ur n t o mai n( ) .
}
Even though j is defined in a function that mai n( ) calls, mai n( )
cannot use j because j is local to pr _agai n( ) . When pr _agai n( )
finishes, j is no longer defined. The variable z is global from
its point of definition down. This is why mai n( ) cannot print
z. Also, the function pr _agai n( ) cannot print p because p is
local to mai n( ) only.
Make sure you can recognize local and global variables
before you continue. A little study here makes the rest of this
chapter easy to understand.
5. Two variables can have the same name, as long as they are
local to two different functions. They are distinct variables,
even though they are named identically.
The following short program uses two variables, both
named age. They have two different values, and they are
considered to be two different variables. The first age is local
to mai n( ) , and the second age is local to get _age( ) .
/ / Fi l ename: C17LOC1. CPP
/ / Two di f f er ent l ocal var i abl es wi t h t he same name.
#i ncl ude <i ost r eam. h>
get _age( ) ; / / Pr ot ot ype
mai n( )
{
i nt age;
cout << What i s your age? ;
ci n >> age;
get _age( ) ; / / Cal l t he second f unct i on.
cout << mai n( ) s age i s st i l l << age << \ n;
Chapter 17 o Variable Scope
360
r et ur n 0;
}
get _age( )
{
i nt age; / / A di f f er ent age. Thi s one
/ / i s l ocal t o get _age( ) .
cout << What i s your age agai n? ;
ci n >> age;
r et ur n 0;
}
The output of this program follows. Study this output
carefully. Notice that mai n( ) s last cout does not print the
newly changed age. Rather, it prints the age known to
mai n( ) the age that is local to mai n( ) . Even though they are
named the same, mai n( ) s age has nothing to do with
get _age( ) s age. They might as well have two different vari-
able names.
What i s your age? 28
What i s your age agai n? 56
mai n( ) s age i s st i l l 28
You should be careful when naming variables. Having two
variables with the same name is misleading. It would be
easy to become confused while changing this program later.
If these variables truly have to be separate, name them
differently, such as ol d_age and new_age, or ag1 and ag2. This
helps you remember that they are different.
6. There are a few times when overlapping local variable
names does not add confusion, but be careful about overdo-
ing it. Programmers often use the same variable name as the
counter variable in a f or loop. For example, the two local
variables in the following program have the same name.
/ / Fi l ename: C17LOC2. CPP
/ / Usi ng t wo l ocal var i abl es wi t h t he same name
Vari abl es l ocal to
mai n( ) cannot be
used i n another
functi on that
mai n( ) cal l s.
361
EXAMPLE
C+ + By
/ / as count i ng var i abl es.
#i ncl ude <i ost r eam. h>
do_f un( ) ; / / Pr ot ot ype
mai n( )
{
i nt ct r ; / / Loop count er .
f or ( ct r =0; ct r <=10; ct r ++)
{ cout << mai n( ) s ct r i s << ct r << \ n; }
do_f un( ) ; / / Cal l second f unct i on.
r et ur n 0;
}
do_f un( )
{
i nt ct r ;
f or ( ct r =10; ct r >=0; ct r - - )
{ cout << do_f un( ) s ct r i s << ct r << \ n; }
r et ur n 0; / / Ret ur n t o mai n( ) .
}
Although this is a nonsense program that simply prints 0
through 10 and then prints 10 through 0, it shows that using
ct r for both function names is not a problem. These variables
do not hold important data that must be processed; rather,
they are f or loop-counting variables. Calling them both ct r
leads to little confusion because their use is limited to con-
trolling f or loops. Because a f or loop initializes and incre-
ments variables, the one function never relies on the other
functions ct r to do anything.
7. Be careful about creating local variables with the same name
in the same function. If you define a local variable early in a
function and then define another local variable with the
same name inside a new block, C++ uses only the innermost
variable, until its block ends.
The following example helps clarify this confusing problem.
The program contains one function with three local vari-
ables. See if you can find these three variables.
Chapter 17 o Variable Scope
362
/ / Fi l ename: C17MULI . CPP
/ / Pr ogr amwi t h mul t i pl e l ocal var i abl es cal l ed i .
#i ncl ude <i ost r eam. h>
mai n( )
{
i nt i ; / / Out er i
i = 10;
{ i nt i ; / / New bl ock s i
i = 20; / / Out er i st i l l hol ds a 10.
cout << i << << i << \ n; / / Pr i nt s 20 20.
{ i nt i ; / / Anot her new bl ock and l ocal var i abl e.
i = 30; / / I nner most i onl y.
cout << i << << i <<
<< i << \ n; / / Pr i nt s 30 30 30.
} / / I nner most i i s now gone f or ever .
} / / Second i i s gone f or ever ( i t s bl ock ended) .
cout << i << << i << <<
i << \ n; / / Pr i nt s 10 10 10.
r et ur n 0;
} / / mai n( ) ends and so do i t s var i abl es.
All local variables are local to the block in which they are
defined. This program has three blocks, each one nested
within another. Because you can define local variables
immediately after an opening brace of a block, there are
three distinct i variables in this program.
The local i disappears completely when its block ends (when
the closing brace is reached). C++ always prints the variable
that it interprets as the most localthe one that resides
within the innermost block.
Use Global Variables Sparingly
You might be asking yourself, Why do I have to understand
global and local variables? At this point, that is an understandable
363
EXAMPLE
C+ + By
question, especially if you have been programming mostly in
BASIC. Here is the bottom line: Global variables can be dangerous.
Code can inadvertently overwrite a variable that was initialized in
another place in the program. It is better to have every variable in
your program be local to the function that has to access it.
Read the last sentence again. Even though you now know how
to make variables global, you should avoid doing so! Try to never
use another global variable. It might seem easier to use global
variables when you write programs having more than one function:
If you make every variable used by every function global, you never
have to worry whether one is visible or not to any given function. On
the other hand, a function can accidentally change a global variable
when that was not your intention. If you keep variables local only to
functions that need them, you protect their values, and you also keep
your programs fully modular.
The Need for Passing Variables
You just learned the difference between local and global vari-
ables. You saw that by making your variables local, you protect their
values because the function that sees the variable is the only one that
can modify it.
What do you do, however, if you have a local variable you want
to use in two or more functions? In other words, you might need a
variable to be both added from the keyboard in one function and
printed in another function. If the variable is local only to the first
function, how can the second one access it?
You have two solutions if more than one function has to share
a variable. One, you can declare the variable globally. This is not a
good idea because you want only those two functions to have access
to the variable, but all functions have access to it when its global. The
other alternativeand the better one by faris to pass the local
variable from one function to another. This has a big advantage: The
variable is only known to those two functions. The rest of the
program still has no access to it.
Chapter 17 o Variable Scope
364
CAUTION: Never pass a global variable to a function. There
is no reason to pass global variables anyway because they are
already visible to all functions.
When you pass a local variable from one function to another,
you pass an argument from the first function to the next. You can pass
more than one argument (variable) at a time, if you want several
local variables to be sent from one function to another. The receiving
function receives a parameter (variable) from the function that sends
it. You shouldnt worry too much about what you call themeither
arguments or parameters. The important thing to remember is that
you are sending local variables from one function to another.
NOTE: You have already passed arguments to parameters
when you passed data to the cout operator. The literals, vari-
ables, and expressions in the cout parentheses are arguments.
The built-in cout function receives these values (called param-
eters on the receiving end) and displays them.
A little more terminology is needed before you see some
examples. When a function passes an argument, it is called the
calling function. The function that receives the argument (called a
parameter when it is received) is called the receiving function. Figure
17.1 explains these terms.
You pass an
argument when you
pass one l ocal
vari abl e to another
functi on.
Figure 17.1. The calling and receiving functions.
To pass a local variable from one function to another, you must
place the local variable in parentheses in both the calling func-
tion and the receiving function. For example, the local and global
If a functi on name
has empty
parentheses, nothi ng
i s bei ng passed to i t.
365
EXAMPLE
C+ + By
examples presented earlier did not pass local variables from mai n( )
to do_f un( ) . If a function name has empty parentheses, nothing is
being passed to it. Given this, the following line passes two vari-
ables, t ot al and di scount , to a function called do_f un( ) .
do_f un( t ot al , di scount ) ;
It is sometimes said that a variable or function is defined. This
has nothing to do with the #def i ne preprocessor directive, which
defines literals. You define variables with statements such as the
following:
i nt i , j ;
i nt m=9;
f l oat x;
char ar a[ ] = Tul sa;
These statements tell the program that you need these variables
to be reserved. A function is defined when the C++ compiler reads
the first statement in the function that describes the name and when
it reads any variables that might have been passed to that function
as well. Never follow a function definition with a semicolon, but
always follow the statement that calls a function with a semicolon.
NOTE: To some C++ purists, a variable is only declared when
you write i nt i ; and only truly defined when you assign it a
value, such as i =7; . They say that the variable is both declared
and defined when you declare the variable and assign it a value
at the same time, such as i nt i =7; .
The following program contains two function definitions,
mai n( ) and pr _i t ( ) .
To practice passing a variable to a function, declare i as an integer variable
and make it equal to five. The passing (or calling) function is mai n( ) , and
the receiving function is pr _i t ( ) . Pass the i variable to the pr _i t ( )
function, then go back to mai n( ) .
Chapter 17 o Variable Scope
366
mai n( ) / / The mai n( ) f unct i on def i ni t i on.
{
i nt i =5; / / Def i nes an i nt eger var i abl e.
pr _i t ( i ) ; / / Cal l s t he pr _i t ( ) .
/ / f unct i on and passes i t i .
r et ur n 0; / / Ret ur ns t o t he oper at i ng syst em.
}
pr _i t ( i nt i ) / / The pr _i t ( ) f unct i on def i ni t i on.
{
cout << i << \ n; / / Cal l s t he cout oper at or .
r et ur n 0; / / Ret ur ns t o mai n( ) .
}
Because a passed parameter is treated like a local variable in the
receiving function, the cout in pr _i t ( ) prints a 5, even though the
mai n( ) function initialized this variable.
When you pass arguments to a function, the receiving function
is not aware of the data types of the incoming variables. Therefore,
you must include each parameters data type in front of the
parameters name. In the previous example, the definition of pr _i t ( )
(the first line of the function) contains the type, i nt , of the incoming
variable i . Notice that the mai n( ) calling function does not have to
indicate the variable type. In this example, mai n( ) already knows the
type of variable i (an integer); only pr _i t ( ) has to know that i is an
integer.
TIP: Always declare the parameter types in the receiving
function. Precede each parameter in the functions parentheses
with i nt , f l oat , or whatever each passed variables data type is.
Examples
1. Here is a mai n( ) function that contains three local variables.
mai n( ) passes one of these variables to the first function and
two of them to the second function.
367
EXAMPLE
C+ + By
/ / Fi l ename: C17LOC3. CPP
/ / Pass t hr ee l ocal var i abl es t o f unct i ons.
#i ncl ude <i ost r eam. h>
#i ncl ude <i omani p. h>
pr _i ni t ( char i ni t i al ) ; / / Pr ot ot ypes di scussed l at er .
pr _ot her ( i nt age, f l oat sal ar y) ;
mai n( )
{
char i ni t i al ; / / Thr ee var i abl es l ocal t o
/ / mai n( ) .
i nt age;
f l oat sal ar y;
/ / Fi l l t hese var i abl es i n mai n( ) .
cout << What i s your i ni t i al ? ;
ci n >> i ni t i al ;
cout << What i s your age? ;
ci n >> age;
cout << What i s your sal ar y? ;
ci n >> sal ar y;
pr _i ni t ( i ni t i al ) ; / / Cal l pr _i ni t ( ) and
/ / pass i t i ni t i al .
pr _ot her ( age, sal ar y) ; / / Cal l pr _ot her ( ) and
/ / pass i t age and sal ar y.
r et ur n 0;
}
pr _i ni t ( char i ni t i al ) / / Never put a semi col on i n
/ / t he f unct i on def i ni t i on.
{
cout << Your i ni t i al i s << i ni t i al << \ n;
r et ur n 0; / / Ret ur n t o mai n( ) .
}
pr _ot her ( i nt age, f l oat sal ar y) / / Must t ype bot h par amet er s.
{
cout << You l ook young f or << age << \ n;
cout << And << set pr eci si on( 2) << sal ar y <<
Chapter 17 o Variable Scope
368
i s a LOT of money! ;
r et ur n 0; / / Ret ur n t o mai n( ) .
}
2. A receiving function can contain its own local variables.
As long as the names are not the same, these local variables
do not conflict with the passed ones. In the following pro-
gram, the second function receives a passed variable from
mai n( ) and defines its own local variable called pr i ce_per .
/ / Fi l ename: C17LOC4. CPP
/ / Second f unct i on has i t s own l ocal var i abl e.
#i ncl ude <i ost r eam. h>
#i ncl ude <i omani p. h>
comput e_sal e( i nt gal l ons) ; / / Pr ot ot ypes di scussed l at er .
mai n( )
{
i nt gal l ons;
cout << Ri char d s Pai nt Ser vi ce \ n;
cout << How many gal l ons of pai nt di d you buy? ;
ci n >> gal l ons; / / Get gal l ons i n mai n( ) .
comput e_sal e( gal l ons) ; / / Comput e t ot al i n f unct i on.
r et ur n 0;
}
comput e_sal e( i nt gal l ons)
{
f l oat pr i ce_per = 12. 45; / / Local t o comput e_sal e( ) .
cout << The t ot al i s << set pr eci si on( 2) <<
( pr i ce_per *( f l oat ) gal l ons) << \ n;
/ / Had t o t ype cast gal l ons because i t was i nt eger .
r et ur n 0; / / Ret ur n t o mai n( ) .
}
3. The following sample code lines test your skill at recog-
nizing calling functions and receiving functions. Being able
to recognize the difference is half the battle of understanding
them.
369
EXAMPLE
C+ + By
do_i t ( )
The preceding fragment must be the first line of a new
function because it does not end with a semicolon.
do_i t 2( sal es) ;
This line calls a function called do_i t 2( ) . The calling function
passes the variable called sal es to do_i t 2( ) .
pr _i t ( f l oat t ot al )
The preceding line is the first line of a function that receives
a floating-point variable from another function that called it.
All receiving functions must specify the type of each variable
being passed.
pr _t hem( f l oat t ot al , i nt number )
This is the first line of a function that receives two vari-
ablesone is a floating-point variable and the other is an
integer. This line cannot be calling the function pr _t hem
because there is no semicolon at the end of the line.
Automatic Versus Static
Variables
The terms automatic and static describe what happens to local
variables when a function returns to the calling procedure. By
default, all local variables are automatic, meaning that they are
erased when their function ends. You can designate a variable as
automatic by prefixing its definition with the term aut o. The aut o
keyword is optional with local variables because they are automatic
be default.
The two statements after mai n( ) s opening brace declare auto-
matic local variables:
mai n( )
{
i nt i ;
aut o f l oat x;
/ / Rest of mai n( ) goes her e.
Chapter 17 o Variable Scope
370
Because aut o is the default, you did not have to include the term
aut o with x.
NOTE: C++ programmers rarely use the aut o keyword with
local variables because they are automatic by default.
The opposite of an automatic variable is a static variable. All
global variables are static and, as mentioned, all static variables
retain their values. Therefore, if a local variable is static, it too retains
its value when its function endsin case the function is called a
second time. To declare a variable as static, place the st at i c keyword
in front of the variable when you define it. The following code
section defines three variables, i , j , and k. The variable i is automatic,
but j and k are static.
my_f un( ) / / St ar t of new f unct i on def i ni t i on.
{
i nt i ;
st at i c j =25; / / Bot h j and k ar e st at i c var i abl es.
st at i c k=30;
Always assign an initial value to a static variable when you
declare it, as shown here in the last two lines. This initial value is
placed in the static variable only the first time my_f un( ) executes. If
you dont assign a static variable an initial value, C++ initializes it to
zero.
TIP: Static variables are good to use when you write functions
that keep track of a count or add to a total. If the counting or
totaling variables were local and automatic, their values would
disappear when the function finisheddestroying the totals.
Automati c vari abl es
are l ocal and
di sappear when thei r
functi on ends.
If l ocal vari abl es are
stati c, thei r val ues
remai n i n case the
functi on i s cal l ed
agai n.
371
EXAMPLE
C+ + By
Automatic and Static Rules for Local Variables
Local automatic variables disappear when their block ends. All
local variables are automatic by default. You can prefix a
variable (when you define it) with the aut o keyword, or you can
omit it; the variable is still automatic and its value is destroyed
when its local block ends.
Local static variables do not lose their values when their
function ends. They remain local to that function. When the
function is called after the first time, the static variables value
is still in place. You declare a static variable by placing the
st at i c keyword before the variables definition.
Examples
1. Consider this program:
/ / Fi l ename: C17STA1. CPP
/ / Tr i es t o use a st at i c var i abl e
/ / wi t hout a st at i c decl ar at i on.
#i ncl ude <i ost r eam. h>
t r i pl e_i t ( i nt ct r ) ;
mai n( )
{
i nt ct r ; / / Used i n t he f or l oop t o
/ / cal l a f unct i on 25 t i mes.
f or ( ct r =1; ct r <=25; ct r ++)
{ t r i pl e_i t ( ct r ) ; } / / Pass ct r t o a f unct i on
/ / cal l ed t r i pl e_i t ( ) .
r et ur n 0;
}
t r i pl e_i t ( i nt ct r )
{
i nt t ot al =0, ans; / / Local aut omat i c var i abl es.
Chapter 17 o Variable Scope
372
/ / Tr i pl es what ever val ue i s passed t o i t
/ / and adds t he t ot al .
ans = ct r * 3; / / Tr i pl e number passed.
t ot al += ans; / / Add t r i pl e number s as t hi s i s cal l ed.
cout << The number << ct r << mul t i pl i ed by 3 i s
<< ans << \ n;
i f ( t ot al > 300)
{ cout << The t ot al of t r i pl e number s i s over 300 \ n; }
r et ur n 0;
}
This is a nonsense program that doesnt do much, yet you
might sense something is wrong. The program passes num-
bers from 1 to 25 to the function called t r i pl e_i t . The function
triples the number and prints it.
The variable called t ot al is initially set to 0. The idea here is to
add each tripled number and print a message when the total
is larger than 300. However, the cout never executes. For each
of the 25 times that this subroutine is called, t ot al is reset to 0.
The t ot al variable is an automatic variable, with its value
erased and initialized every time its procedure is called. The
next example corrects this.
2. If you want t ot al to retain its value after the procedure ends,
you must make it static. Because local variables are automatic
by default, you have to include the st at i c keyword to over-
ride this default. Then the value of the t ot al variable is
retained each time the subroutine is called.
The following corrects the mistake in the previous program.
/ / Fi l ename: C17STA2. CPP
/ / Uses a st at i c var i abl e wi t h t he st at i c decl ar at i on.
#i ncl ude <i ost r eam. h>
t r i pl e_i t ( i nt ct r ) ;
mai n( )
373
EXAMPLE
C+ + By
{
i nt ct r ; / / Used i n t he f or l oop t o
/ / cal l a f unct i on 25 t i mes.
f or ( ct r =1; ct r <=25; ct r ++)
{ t r i pl e_i t ( ct r ) ; } / / Pass ct r t o a f unct i on
/ / cal l ed t r i pl e_i t ( ) .
r et ur n 0;
}
t r i pl e_i t ( i nt ct r )
{
st at i c i nt t ot al =0; / / Local and st at i c
i nt ans; / / Local and aut omat i c
/ / t ot al i s set t o 0 onl y t he f i r st t i me t hi s
/ / f unct i on i s cal l ed.
/ / Tr i pl es what ever val ue i s passed t o i t and adds
/ / t he t ot al .
ans = ct r * 3; / / Tr i pl e number passed.
t ot al += ans; / / Add t r i pl e number s as t hi s i s cal l ed.
cout << The number << ct r << mul t i pl i ed by 3 i s
<< ans << \ n;
i f ( t ot al > 300)
{ cout << The t ot al of t r i pl e number s i s over 300 \ n; }
r et ur n 0;
}
This programs output follows. Notice that the functions
cout is triggered, even though t ot al is a local variable. Be-
cause t ot al is static, its value is not erased when the function
finishes. When mai n( ) calls the function a second time, t ot al s
previous value (at the time you left the routine) is still there.
The number 1 mul t i pl i ed by 3 i s 3
The number 2 mul t i pl i ed by 3 i s 6
The number 3 mul t i pl i ed by 3 i s 9
The number 4 mul t i pl i ed by 3 i s 12
Chapter 17 o Variable Scope
374
The number 5 mul t i pl i ed by 3 i s 15
The number 6 mul t i pl i ed by 3 i s 18
The number 7 mul t i pl i ed by 3 i s 21
The number 8 mul t i pl i ed by 3 i s 24
The number 9 mul t i pl i ed by 3 i s 27
The number 10 mul t i pl i ed by 3 i s 30
The number 11 mul t i pl i ed by 3 i s 33
The number 12 mul t i pl i ed by 3 i s 36
The number 13 mul t i pl i ed by 3 i s 39
The number 14 mul t i pl i ed by 3 i s 42
The number 15 mul t i pl i ed by 3 i s 45
The number 16 mul t i pl i ed by 3 i s 48
The number 17 mul t i pl i ed by 3 i s 51
The number 18 mul t i pl i ed by 3 i s 54
The number 19 mul t i pl i ed by 3 i s 57
The number 20 mul t i pl i ed by 3 i s 60
The number 21 mul t i pl i ed by 3 i s 63
The number 22 mul t i pl i ed by 3 i s 66
The number 23 mul t i pl i ed by 3 i s 69
The number 24 mul t i pl i ed by 3 i s 72
The number 25 mul t i pl i ed by 3 i s 75
This does not mean that local static variables become global.
The main program cannot refer, use, print, or change t ot al
because it is local to the second function. Static simply
means that the local variables value is still there if the
program calls the function again.
Three Issues of Parameter
Passing
To have a complete understanding of programs with several
functions, you have to learn three additional concepts:
o Passing arguments (variables) by value (also called by
copy)
o Passing arguments (variables) by address (also called by
reference)
o Returning values from functions
375
EXAMPLE
C+ + By
The first two concepts deal with the way local variables are
passed and received. The third concept describes how receiving
functions send values back to the calling functions. Chapter 18,
Passing Values, concludes this discussion by explaining these
three methods for passing parameters and returning values.
Review Questions
The answers to the review questions are in Appendix B.
1. True or false: A function should always include a r et ur n
statement as its last command, even though r et ur n is not
required.
2. When a local variable is passed, is it called an argument or a
parameter?
3. True or false: A function that is passed variables from an-
other function cannot also have its own local variables.
4. What must appear inside the receiving functions parenthe-
ses, other than the variables passed to it?
5. If a function keeps track of a total or count every time it is
called, should the counting or totaling variable be automatic
or static?
6. When would you pass a global variable to a function? (Be
carefulthis might be a trick question!)
7. How many arguments are there in the following statement?
pr i nt f ( The r ai n has f al l en %d i nches. , r ai nf ) ;
Review Exerc ises
1. Write a program that asks, in mai n( ) , for the age of the users
dog. Write a second function called peopl e( ) that computes
the dogs age in human years (by multiplying the dogs age
by seven).
Chapter 17 o Variable Scope
376
2. Write a function that counts the number of times it is called.
Name the function count _i t ( ) . Do not pass it anything. In the
body of count _i t ( ) , print the following message:
The number of t i mes t hi s f unct i on has been cal l ed i s: ##
where ##is the number. (Hint: Because the variable must be
local, make it static and initialize it to zero when you first
define it.)
3. The following program contains several problems. Some of
these problems produce errors. One problem is not an error,
but a bad location for a variable declaration. (Hint: Find all
the global variables.) See if you can spot some of the prob-
lems, and rewrite the program so it works better.
/ / Fi l ename: C17BAD. CPP
/ / Pr ogr amwi t h bad uses of var i abl e decl ar at i ons.
#i ncl ude <i ost r eam. h>
#def i ne NUM 10
do_var _f un( ) ; / / Pr ot ot ypes di scussed l at er .
char ci t y[ ] = Mi ami ;
i nt count ;
mai n( )
{
i nt abc;
count = NUM;
abc = 5;
do_var _f un( ) ;
cout << abc << << count << << pgm_var <<
<< xyz;
r et ur n 0;
}
i nt pgm_var = 7;
do_var _f un( )
377
EXAMPLE
C+ + By
{
char xyz = A ;
xyz = b ;
cout << xyz << << pgm_var << abc << << ci t y;
r et ur n 0;
}
Summary
Parameter passing is necessary because local variables are
better than global. Local variables are protected in their own rou-
tines, but sometimes they must be shared with other routines. If
local data are to remain in those variables (in case the function is
called again in the same program), the variables should be static
because otherwise their automatic values disappear.
Most the information in this chapter becomes more obvious as
you use functions in your own programs. Chapter 18, Passing
Values, covers the actual passing of parameters in more detail and
shows you two different ways to pass them.
Chapter 17 o Variable Scope
378
379
EXAMPLE
C+ + By
18
Passing Values
C++ passes variables between functions using two different meth-
ods. The one you use depends on how you want the passed variables
to be changed. This chapter explores these two methods. The con-
cepts discussed here are not new to the C++ language. Other
programming languages, such as Pascal, FORTRAN, and QBasic,
pass parameters using similar techniques. A computer language
must have the capability to pass information between functions
before it can be called truly structured.
This chapter introduces you to the following:
o Passing variables by value
o Passing arrays by address
o Passing nonarrays by address
Pay close attention because most of the programs in the remain-
der of the book rely on the methods described in this chapter.
Passing by Value (by Copy)
The two wordings passing by value and passing by copy
mean the same thing in computer terms. Some textbooks and C++
programmers state that arguments are passed by value, and some
state that they are passed by copy. Both of these phrases describe one
Chapter 18 o Passing Values
380
of the two methods by which arguments are passed to receiving
functions. (The other method is called by address, or by refer-
ence. This method is covered later in the chapter.)
When an argument (local variable) is passed by value, a copy
of the variables value is sent toand is assigned tothe receiving
functions parameter. If more than one variable is passed by value,
a copy of each of their values is sent toand is assigned tothe
receiving functions parameters.
Figure 18.1 shows the passing by copy in action. The value of i
not the variableis passed to the called function, which receives it
as a variable i . There are two variables called i , not one. The first is
local to mai n( ) , and the second is local to pr _i t ( ) . They both have the
same names, but because they are local to their respective functions,
there is no conflict. The variable does not have to be called i in both
functions, and because the value of i is sent to the receiving function,
it does not matter what the receiving function calls the variable that
receives this value.
When you pass by
val ue, a copy of the
vari abl es val ue i s
passed to the
recei vi ng functi on.
5
Figure 18.1. Passing the variable i by value.
In this case, when passing and receiving variables between
functions, it is wisest to retain the same names. Even though they are
not the same variables, they hold the same value. In this example, the
value 5 is passed from mai n( ) s i to pr _i t ( ) s i .
Because a copy of i s value (and not the variable itself) is passed
to the receiving function, if pr _i t ( ) changed i , it would be changing
only its copy of i and not mai n( ) s i . This fact truly separates
functions and variables. You now have the technique for passing a
copy of a variable to a receiving function, with the receiving function
being unable to modify the calling functions variable.
5
381
EXAMPLE
C+ + By
All C++s nonarray variables you have seen so far are passed by
value. You do not have to do anything special to pass variables by
value, except to pass them in the calling functions argument list and
receive them in the receiving functions parameter list.
NOTE: The default method for passing parameters is by value,
as just described, unless you pass arrays. Arrays are always
passed by the other method, by address, described later in the
chapter.
Examples
1. The following program asks users for their weight. It then
passes that weight to a function that calculates the equiva-
lent weight on the moon. Notice the second function uses the
passed value, and calculates with it. After wei ght is passed to
the second function, that function can treat wei ght as though
it were a local variable.
Identify the program and include the necessary input/output file.
You want to calculate the users weight on the moon. Because you
have to hold the users weight somewhere, declare the variable
wei ght as an integer. You also need a function that does the
calculations, so create a function called moon( ) .
Ask the user how much he or she weighs. Put the users answer in
wei ght . Now pass the users weight to the moon( ) function, which
divides the weight by six to determine the equivalent weight on the
moon. Display the users weight on the moon.
You have finished, so leave the moon( ) function, then leave the
mai n( ) function.
/ / Fi l ename: C18PASS1. CPP
/ / Cal cul at e t he user s wei ght i n a second f unct i on.
#i ncl ude <i ost r eam. h>
moon( i nt wei ght ) ; / / Pr ot ot ypes di scussed l at er .
Chapter 18 o Passing Values
382
mai n( )
{
i nt wei ght ; / / mai n( ) s l ocal wei ght .
cout << How many pounds do you wei gh? ;
ci n >> wei ght ;
moon( wei ght ) ; / / Cal l t he moon( ) f unct i on and
/ / pass i t t he wei ght .
r et ur n 0; / / Ret ur n t o t he oper at i ng syst em.
}
moon( i nt wei ght ) / / Decl ar e t he passed par amet er .
{
/ / Moon wei ght s ar e 1/ 6t h ear t h s wei ght s
wei ght / = 6; / / Di vi de t he wei ght by si x.
cout << You wei gh onl y << wei ght <<
pounds on t he moon! ;
r et ur n 0; / / Ret ur n t o mai n( ) .
}
The output of this program follows:
How many pounds do you wei gh? 120
You wei gh onl y 20 pounds on t he moon!
2. You can rename passed variables in the receiving function.
They are distinct from the passing functions variable. The
following is the same program as in Example 1, except the
receiving function calls the passed variable ear t h_wei ght . A
new variable, called moon_wei ght , is local to the called func-
tion and is used for the moons equivalent weight.
/ / Fi l ename: C18PASS2. CPP
/ / Cal cul at e t he user s wei ght i n a second f unct i on.
#i ncl ude <i ost r eam. h>
moon( i nt ear t h_wei ght ) ;
mai n( )
383
EXAMPLE
C+ + By
{
i nt wei ght ; / / mai n( ) s l ocal wei ght .
cout << How many pounds do you wei gh? ;
ci n >> wei ght ;
moon( wei ght ) ; / / Cal l t he moon( ) f unct i on and
/ / pass i t t he wei ght .
r et ur n 0; / / Ret ur n t o t he oper at i ng syst em.
}
moon( i nt ear t h_wei ght ) / / Decl ar e t he passed par amet er .
{
i nt moon_wei ght ; / / Local t o t hi s f unct i on.
/ / Moon' s wei ght s ar e 1/ 6t h of ear t h s wei ght s.
moon_wei ght = ear t h_wei ght / 6; / / Di vi de wei ght by si x.
cout << You onl y wei gh << moon_wei ght <<
pounds on t he moon! ;
r et ur n 0; / / Ret ur n t o mai n( ) .
}
The resulting output is identical to that of the previous
program. Renaming the passed variable changes nothing.
3. The next example passes three variablesof three different
typesto the called function. In the receiving functions
parameter list, each of these variable types must be declared.
This program prompts users for three values in the mai n( )
function. The mai n( ) function then passes these variables to
the receiving function, which calculates and prints values
related to those passed variables. When the called function
modifies a variable passed to the function, notice again that
this does not affect the calling functions variable. When
variables are passed by value, the valuenot the variable
is passed.
/ / Fi l ename: C18PASS3. CPP
/ / Get gr ade i nf or mat i on f or a st udent .
#i ncl ude <i ost r eam. h>
#i ncl ude <i omani p. h>
check_gr ade( char l gr ade, f l oat aver age, i nt t est s) ;
Chapter 18 o Passing Values
384
mai n( )
{
char l gr ade; / / Let t er gr ade.
i nt t est s; / / Number of t est s not yet t aken.
f l oat aver age; / / St udent s aver age based on 4. 0 scal e.
cout << What l et t er gr ade do you want ? ;
ci n >> l gr ade;
cout << What i s your cur r ent t est aver age? ;
ci n >> aver age;
cout << How many t est s do you have l ef t ? ;
ci n >> t est s;
check_gr ade( l gr ade, aver age, t est s) ; / / Cal l s f unct i on
/ / and passes t hr ee var i abl es by val ue.
r et ur n 0;
}
check_gr ade( char l gr ade, f l oat aver age, i nt t est s)
{
swi t ch ( t est s)
{
case ( 0) : { cout << You wi l l get your cur r ent gr ade
<< of << l gr ade;
br eak; }
case ( 1) : { cout << You st i l l have t i me t o br i ng <<
up your aver age;
cout << of << set pr eci si on( 1) <<
aver age << up. St udy har d! ;
br eak; }
def aul t : { cout << Rel ax. You st i l l have pl ent y of
<< t i me. ;
br eak; }
}
r et ur n 0;
}
385
EXAMPLE
C+ + By
Passing by Address
(by Referenc e)
The two phrases by address and by reference mean the
same thing. The previous section described passing arguments by
value (or by copy). This section teaches you how to pass arguments
by address.
When you pass an argument (local variable) by address, the
variables address is sent toand is assigned tothe receiving
functions parameter. (If you pass more than one variable by ad-
dress, each of their addresses is sent toand is assigned tothe
receiving functions parameters.)
Variable Addresse s
All variables in memory (RAM) are stored at memory ad-
dressessee Figure 18.2. If you want more information on the
internal representation of memory, refer to Appendix A, Memory
Addressing, Binary, and Hexadecimal Review.
Figure 18.2. Memory addresses.
When you tell C++ to define a variable (such as i nt i ; ), you are
requesting C++ to find an unused place in memory and assign that
place (or memory address) to i . When your program uses the
variable called i , C++ goes to i s address and uses whatever is there.
When you pass by
address, the address
of the vari abl e i s
passed to the
recei vi ng functi on.
Chapter 18 o Passing Values
386
If you define five variables as follows,
i nt i ;
f l oat x=9. 8;
char ar a[ 2] = { A , B };
i nt j =8, k=3;
C++ might arbitrarily place them in memory at the addresses
shown in Figure 18.3.
Al l C++ arrays are
passed by address.
Figure 18.3. Storing variables in memory.
You dont know what is contained in the variable called i
because you havent put anything in it yet. Before you use i , you
should initialize it with a value. (All variablesexcept character
variablesusually use more than 1 byte of memory.)
Sample Program
The address of the variable, not its value, is copied to the
receiving function when you pass a variable by address. In C++, all
arrays are automatically passed by address. (Actually, a copy of their
address is passed, but you will understand this better when you
learn more about arrays and pointers.) The following important rule
holds true for programs that pass by address:
387
EXAMPLE
C+ + By
Every time you pass a variable by address, if the receiving
function changes the variable, it is changed also in the
calling function.
Therefore, if you pass an array to a function and the function
changes the array, those changes are still with the array when it
returns to the calling function. Unlike passing by value, passing by
address gives you the ability to change a variable in the called
function and to keep those changes in effect in the calling function.
The following sample program helps to illustrate this concept.
/ / Fi l ename: C18ADD1. CPP
/ / Passi ng by addr ess exampl e.
#i ncl ude <i ost r eam. h>
#i ncl ude <st r i ng. h>
change_i t ( char c[ 4] ) ; / / Pr ot ot ype di scussed l at er .
mai n( )
{
char name[ 4] =ABC;
change_i t ( name) ; / / Passes by addr ess because
/ / i t i s an ar r ay.
cout << name << \ n; / / Cal l ed f unct i on can
/ / change ar r ay.
r et ur n 0;
}
change_i t ( char c[ 4] ) / / You must t el l t he f unct i on
/ / t hat c i s an ar r ay.
{
cout << c << \ n; / / Pr i nt as i t i s passed.
st r cpy( c, USA) ; / / Change t he ar r ay, bot h
/ / her e and i n mai n( ) .
r et ur n 0;
}
Here is the output from this program:
ABC
USA
Chapter 18 o Passing Values
388
At this point, you should have no trouble understanding that
the array is passed from mai n( ) to the function called change_i t ( ) .
Even though change_i t ( ) calls the array c, it refers to the same array
passed by the mai n( ) function (name).
Figure 18.4 shows how the array is passed. Although the
address of the arrayand not its valueis passed from name to c,
both arrays are the same.
ar a
Figure 18.4. Passing an array by address.
Before going any further, a few additional comments are in
order. Because the address of name is passed to the functioneven
though the array is called c in the receiving functionit is still the
same array as name. Figure 18.5 shows how C++ accomplishes this
task at the memory-address level.
Figure 18.5. The array being passed is the same array in both functions.
The variable array is referred to as name in mai n( ) and as c in
change_i t ( ) . Because the address of name is copied to the receiving
function, the variable is changed no matter what it is called in either
389
EXAMPLE
C+ + By
function. Because change_i t ( ) changes the array, the array is changed
also in mai n( ) .
Examples
1. You can now use a function to fill an array with user input.
The following function asks users for their first name in the
function called get _name( ) . As users type the name in the
array, it is also entered in mai n( ) s array. The mai n( ) function
then passes the array to pr _name( ) , where it is printed. (If
arrays were passed by value, this program would not work.
Only the array value would be passed to the called func-
tions.)
/ / Fi l ename: C18ADD2. CPP
/ / Get a name i n an ar r ay, t hen pr i nt i t usi ng
/ / separ at e f unct i ons.
#i ncl ude <i ost r eam. h>
get _name( char name[ 25] ) ; / / Pr ot ot ypes di scussed l at er .
pr i nt _name( char name[ 25] ) ;
mai n( )
{
char name[ 25] ;
get _name( name) ; / / Get t he user s name.
pr i nt _name( name) ; / / Pr i nt t he user s name.
r et ur n 0;
}
get _name( char name[ 25] ) / / Pass t he ar r ay by addr ess.
{
cout << What i s your f i r st name? ;
ci n >> name;
r et ur n 0;
}
pr i nt _name( char name[ 25] )
{
cout << \ n\ n Her e you ar e, << name;
r et ur n 0;
}
Chapter 18 o Passing Values
390
When you pass an array, be sure to specify the arrays type
in the receiving functions parameter list. If the previous
program declared the passed array with
get _name( char name)
the function get _name( ) would interpret this as a single
character variable, not a character array. You never have to
put the array size in brackets. The following statement also
works as the first line of get _name( ) .
get _name( char name[ ] )
Most C++ programmers put the array size in the brackets to
clarify the array size, even though the size is not needed.
2. Many programmers pass character arrays to functions to
erase them. Here is a function called cl ear _i t ( ) . It expects
two parameters: a character array and the total number of
elements declared for that array. The array is passed by
address (as are all arrays) and the number of elements,
num_el s, is passed by value (as are all nonarrays). When the
function finishes, the array is cleared (all its elements are
reset to null zero). Subsequent functions that use it can then
have an empty array.
cl ear _i t ( char ar a[ 10] , i nt num_el s)
{
i nt ct r ;
f or ( ct r =0; ct r <num_el s; ct r ++)
{ ar a[ ct r ] = \ 0 ; }
r et ur n 0;
}
The brackets after ar a do not have to contain a number, as
described in the previous example. The 10 in this example is
simply a placeholder for the brackets. Any value (or no
value) would work as well.
391
EXAMPLE
C+ + By
Passing Nonarrays by Address
You now should see the difference between passing variables
by address and by value. Arrays can be passed by address, and
nonarrays can be passed by value. You can override the by value
default for nonarrays. This is helpful sometimes, but it is not always
recommended because the called function can damage values in the
called function.
If you want a nonarray variable changed in a receiving function
and also want the changes kept in the calling function, you must
override the default and pass the variable by address. (You should
understand this section better after you learn how arrays and
pointers relate.) To pass a nonarray by address, you must precede
the argument in the receiving function with an ampersand (&).
This might sound strange to you (and it is, at this point). Few
C++ programmers override the default of passing by address. When
you learn about pointers later, you should have little need to do so.
Most C++ programmers dont like to clutter their code with these
extra ampersands, but its nice to know you can override the default
if necessary.
The following examples demonstrate how to pass nonarray
variables by address.
Ex a mple s
1. The following program passes a variable by address from
mai n( ) to a function. The function changes it and returns to
mai n( ) . Because the variable is passed by address, mai n( )
recognizes the new value.
/ / Fi l ename: C18ADD3. CPP
/ / Demonst r at e passi ng nonar r ays by addr ess.
#i ncl ude <i ost r eam. h>
do_f un( i nt &amt ) ; / / Pr ot ot ypes di scussed l at er .
mai n( )
{
i nt amt ;
You can pass
nonarrays by
address as wel l .
Chapter 18 o Passing Values
392
amt = 100; / / Assi gn a val ue i n mai n( ) .
cout << I n mai n( ) , amt i s << amt << \ n;
do_f un( amt ) ; / / Pass amt by addr ess
cout << Af t er r et ur n, amt i s << amt << i n mai n( ) \ n;
r et ur n 0;
}
do_f un( i nt &amt ) / / I nf or mf unct i on of
/ / passi ng by addr ess.
{
amt = 85; / / Assi gn new val ue t o amt .
cout << I n do_f un( ) , amt i s << amt << \ n;
r et ur n 0;
}
The output from this program follows:
I n mai n( ) , amt i s 100
I n do_f un( ) , amt i s 85
Af t er r et ur n, amt i s 85 i n mai n( )
Notice that amt changed in the called function. Because it was
passed by address, it is changed also in the calling function.
2. You can use a function to get the users keyboard values.
The mai n( ) function recognizes those values as long as you
pass them by address. The following program calculates the
cubic feet in a swimming pool. In one function, it requests
the width, length, and depth. In another function, it calcu-
lates the cubic feet of water. Finally, in a third function, it
prints the answer. The mai n( ) function is clearly a controlling
function, passing variables between these functions by
address.
/ / Fi l ename: C18POOL. CPP
/ / Cal cul at es t he cubi c f eet i n a swi mmi ng pool .
#i ncl ude <i ost r eam. h>
get _val ues( i nt &l engt h, i nt &wi dt h, i nt &dept h) ;
cal c_cubi c( i nt &l engt h, i nt &wi dt h, i nt &dept h, i nt &cubi c) ;
pr i nt _cubi c( i nt &cubi c) ;
393
EXAMPLE
C+ + By
mai n( )
{
i nt l engt h, wi dt h, dept h, cubi c;
get _val ues( l engt h, wi dt h, dept h) ;
cal c_cubi c( l engt h, wi dt h, dept h, cubi c) ;
pr i nt _cubi c( cubi c) ;
r et ur n 0;
}
get _val ues( i nt &l engt h, i nt &wi dt h, i nt &dept h)
{
cout << What i s t he pool s l engt h? ;
ci n >> l engt h;
cout << What i s t he pool s wi dt h? ;
ci n >> wi dt h;
cout << What i s t he pool s aver age dept h? ;
ci n >> dept h;
r et ur n 0;
}
cal c_cubi c( i nt &l engt h, i nt &wi dt h, i nt &dept h, i nt &cubi c)
{
cubi c = ( l engt h) * ( wi dt h) * ( dept h) ;
r et ur n 0;
}
pr i nt _cubi c( i nt &cubi c)
{
cout << \ nThe pool has << cubi c << cubi c f eet \ n;
r et ur n 0;
}
The output follows:
What i s t he pool s l engt h? 16
What i s t he pool s wi dt h? 32
What i s t he pool s aver age dept h? 6
The pool has 3072 cubi c f eet
Chapter 18 o Passing Values
394
All variables in a function must be preceded with an amper-
sand if they are to be passed by address.
Review Questions
The answers to the review questions are in Appendix B.
1. What type of variable is automatically passed by address?
2. What type of variable is automatically passed by value?
3. True or false: If a variable is passed by value, it is passed also
by copy.
4. If a variable is passed to a function by value and the function
changes the variable, is it changed in the calling function?
5. If a variable is passed to a function by address and the
function changes the variable, is it changed in the calling
function?
6. What is wrong with the following function?
do_f un( x, y, z)
{
cout << The var i abl es ar e << x << y << z;
r et ur n 0;
}
7. Suppose you pass a nonarray variable and an array to a
function at the same time. What is the default?
a. Both are passed by address.
b. Both are passed by value.
c. One is passed by address and the other is passed by
value.
395
EXAMPLE
C+ + By
Review Exerc ises
1. Write a mai n( ) function and a second function that mai n( )
calls. Ask users for their annual income in mai n( ) . Pass the
income to the second function and print a congratulatory
message if the user makes more than $50,000 or an encour-
agement message if the user makes less.
2. Write a three-function program, consisting of the following
functions:
mai n( )
f un1( )
f un2( )
Declare a 10-element character array in mai n( ) , fill it with the
letters A through J in f un1( ) , then print that array backwards
in f un2( ) .
3. Write a program whose mai n( ) function passes a number to a
function called pr i nt _ast er ( ) . The pr i nt _ast er ( ) function
prints that many asterisks on a line, across the screen. If
pr i nt _ast er ( ) is passed a number greater than 80, display an
error because most screens cannot print more than 80 char-
acters on the same line. When execution is finished, return
control to mai n( ) and then return to the operating system.
4. Write a function that is passed two integer values by ad-
dress. The function should declare a third local variable. Use
the third variable as an intermediate variable and swap the
values of both passed integers. For example, suppose the
calling function passes your function ol d_pay and new_pay
as in
swap_i t ( ol d_pay, new_pay) ;
The swap_i t ( ) function reverses the two values so, when
control returns to the calling function, the values of ol d_pay
and new_pay are swapped.
Chapter 18 o Passing Values
396
Summary
You now have a complete understanding of the various meth-
ods for passing data to functions. Because you will be using local
variables as much as possible, you have to know how to pass local
variables between functions but also keep the variables away from
functions that dont need them.
You can pass data in two ways: by value and by address. When
you pass data by value, which is the default method for nonarrays,
only a copy of the variables contents are passed. If the called
function modifies its parameters, those variables are not modified in
the calling function. When you pass data by address, as is done with
arrays and nonarray variables preceded by an ampersand, the
receiving function can change the data in both functions.
Whenever you pass values, you must ensure that they match in
number and type. If you dont match them, you could have prob-
lems. For example, suppose you pass an array and a floating-point
variable, but in the receiving function, you receive a floating-point
variable followed by an array. The data does not reach the receiving
function properly because the parameter data types do not match
the variables being passed. Chapter 19, Function Return Values
and Prototypes, shows you how to protect against such disasters
by prototyping all your functions.
397
EXAMPLE
C+ + By
19
Func tion Return
Values and
Prototypes
So far, you have passed variables to functions in only one direc-
tiona calling function passed data to a receiving function. You
have yet to see how data are passed back from the receiving function
to the calling function. When you pass variables by address, the data
are changed in both functionsbut this is different from passing
data back. This chapter focuses on writing function return values
that improve your programming power.
After you learn to pass and return values, you have to prototype
your own functions as well as C++s built-in functions, such as cout
and ci n. By prototyping your functions, you ensure the accuracy of
passed and returned values.
This chapter introduces you to the following:
o Returning values from functions
o Prototyping functions
o Understanding header files
By returning values from functions, you make your functions
fully modular. They can now stand apart from the other functions.
Chapter 19 o Function Return Values and Prototypes
398
They can receive and return values and act as building blocks that
compose your complete application.
Func tion Return Values
Until now, all functions in this book have been subroutines or
subfunctions. A C++ subroutine is a function that is called from
another function, but it does not return any values. The difference
between subroutines and functions is not as critical in C++ as it is
in other languages. All functions, whether they are subroutines or
functions that return values, are defined in the same way. You can
pass variables to each of them, as you have seen throughout this
section of the book.
Functions that return values offer you a new approach to
programming. In addition to passing data one-way, from calling to
receiving function, you can pass data back from a receiving function
to its calling function. When you want to return a value from a
function to its calling function, put the return value after the r et ur n
statement. To clarify the return value even more, many program-
mers put parentheses around the return value, as shown in the
following syntax:
r et ur n ( r et ur n val ue) ;
CAUTION: Do not return global variables. There is no need
to do so because their values are already known throughout
the code.
The calling function must have a use for the return value. For
example, suppose you wrote a function that calculated the average
of any three integer variables passed to it. If you return the average,
the calling function has to receive that return value. The following
sample program helps to illustrate this principle.
/ / Fi l ename: C19AVG. CPP
/ / Cal cul at es t he aver age of t hr ee i nput val ues.
#i ncl ude <i ost r eam. h>
i nt cal c_av( i nt num1, i nt num2, i nt num3) ; / / Pr ot ot ype
Put the return val ue
at the end of the
r et ur n statement.
399
EXAMPLE
C+ + By
mai n( )
{
i nt num1, num2, num3;
i nt avg; / / Hol ds t he r et ur n val ue.
cout << Pl ease t ype t hr ee number s ( such as 23 54 85) ;
ci n >> num1 >> num2 >> num3;
/ / Cal l t he f unct i on, pass t he number s,
/ / and accept t he r et ur n val ue amount .
avg = cal c_av( num1, num2, num3) ;
cout << \ n\ nThe aver age i s << avg; / / Pr i nt t he
/ / r et ur n val ue.
r et ur n 0;
}
i nt cal c_av( i nt num1, i nt num2, i nt num3)
{
i nt l ocal _avg; / / Hol ds t he aver age f or t hese number s.
l ocal _avg = ( num1+num2+num3) / 3;
r et ur n ( l ocal _avg) ;
}
Here is a sample output from the program:
Pl ease t ype t hr ee number s ( such as 23 54 85) 30 40 50
The aver age i s 40
Study this program carefully. It is similar to many you have
seen, but a few additional points have to be considered now that the
function returns a value. It might help to walk through this program
a few lines at a time.
The first part of mai n( ) is similar to other programs you have
seen. It declares its local variables: three for user input and one for
the calculated average. The cout and ci n are familiar to you. The
function call to cal c_av( ) is also familiar; it passes three variables
Chapter 19 o Function Return Values and Prototypes
400
(num1, num2, and num3) by value to cal c_av( ) . (If it passed them by
address, an ampersand (&) would have to precede each argument, as
discussed in Chapter 18.)
The receiving function, cal c_av( ) , seems similar to others you
have seen. The only difference is that the first line, the functions
definition line, has one additionthe i nt before its name. This is the
type of the return value. You must always precede a function name
with its return data type. If you do not specify a type, C++ assumes
a type of i nt . Therefore, if this example had no return type, it would
work just as well because an i nt return type would be assumed.
Because the variable being returned from cal c_av( ) is an inte-
ger, the i nt return type is placed before cal c_av( ) s name.
You can see also that the return statement of cal c_av( ) includes
the return value, l ocal _avg. This is the variable being sent back to the
calling function, mai n( ) . You can return only a single variable to a
calling function.
Even though a function can receive more than one parameter,
it can return only a single value to the calling function. If a receiving
function is modifying more than one value from the calling function,
you must pass the parameters by address; you cannot return mul-
tiple values using a r et ur n statement.
After the receiving function, cal c_av( ) , returns the value, mai n( )
must do something with that returned value. So far, you have seen
function calls on lines by themselves. Notice in mai n( ) that the
function call appears on the right side of the following assignment
statement:
avg = cal c_av( num1, num2, num3) ;
When the cal c_av( ) function returns its valuethe average of
the three numbersthat value replaces the function call. If the
average computed in cal c_av( ) is 40, the C++ compiler interprets the
following statement in place of the function call:
avg = 40;
You typed a function call to the right of the equal sign, but the
program replaces a function call with its return value when the
r et ur n takes place. In other words, a function that returns a value
Put the functi ons
return type before i ts
name. If you dont
speci fy a return type,
i nt i s the defaul t.
401
EXAMPLE
C+ + By
becomes that value. You must put such a function anywhere you put
any variable or literal (usually to the right of an equal sign, in an
expression, or in cout ). The following is an incorrect way of calling
cal c_av( ) :
cal c_av( num1, num2, num3) ;
If you did this, C++ would have nowhere to put the return
value.
CAUTION: Function calls that return values usually dont
appear on lines by themselves. Because the function call is
replaced by the return value, you should do something with
that return value (such as assign it to a variable or use it in an
expression). Return values can be ignored, but doing so usually
defeats the purpose of creating them.
Examples
1. The following program passes a number to a function called
doub( ) . The function doubles the number and returns the
result.
/ / Fi l ename: C19DOUB. CPP
/ / Doubl es t he user s number .
#i ncl ude <i ost r eam. h>
i nt doub ( i nt num) ;
mai n( )
{
i nt number ; / / Hol ds user s i nput .
i nt d_number ; / / Hol ds doubl e t he user s i nput .
cout << What number do you want doubl ed? ;
ci n >> number ;
d_number = doub( number ) ; / / Assi gns r et ur n val ue.
cout << number << doubl ed i s << d_number ;
r et ur n 0;
}
Chapter 19 o Function Return Values and Prototypes
402
i nt doub( i nt num)
{
i nt d_num;
d_num= num* 2; / / Doubl es t he number .
r et ur n ( d_num) ; / / Ret ur ns t he r esul t .
}
The program produces output such as this:
What number do you want doubl ed? 5
5 doubl ed i s 10
2. Function return values can be used anywhere literals, vari-
ables, and expressions are used. The following program is
similar to the previous one. The difference is in mai n( ) .
The function call is performed not on a line by itself, but
from a cout . This is a nested function call. You call the built-
in function cout using the return value from one of the
programs functions named doub( ) . Because the call to doub( )
is replaced by its return value, the cout has enough informa-
tion to proceed as soon as doub( ) returns. This gives mai n( )
less overhead because it no longer needs a variable called
d_number , although you must use your own judgment as to
whether this program is easier to maintain. Sometimes it is
wise to include function calls in other expressions; other
times it is clearer to call the function and assign its return
value to a variable before using it.
/ / Fi l ename: C19DOUB2. CPP
/ / Doubl es t he user s number .
#i ncl ude <i ost r eam. h>
i nt doub( i nt num) ; / / Pr ot ot ype
mai n( )
{
i nt number ; / / Hol ds user s i nput .
cout << What number do you want doubl ed? ;
ci n >> number ;
403
EXAMPLE
C+ + By
/ / The t hi r d cout par amet er i s
/ / r epl aced wi t h a r et ur n val ue.
cout << number << doubl ed i s << doub( number ) ;
r et ur n 0;
}
i nt doub( i nt num)
{
i nt d_num;
d_num= num* 2; / / Doubl e t he number .
r et ur n ( d_num) ; / / Ret ur n t he r esul t .
}
3. The following program asks the user for a number. That
number is then passed to a function called sum( ) , which adds
the numbers from 1 to that number. In other words, if the
user types a 6, the function returns the result of the following
calculation:
1 + 2 + 3 + 4 + 5 + 6
This is known as the sum of the digits calculation, and it is
sometimes used for depreciation in accounting.
/ / Fi l ename: C19SUMD. CPP
/ / Comput e t he sumof t he di gi t s.
#i ncl ude <i ost r eam. h>
i nt sum( i nt num) ; / / Pr ot ot ype
mai n( )
{
i nt num, sumd;
cout << Pl ease t ype a number : ;
ci n >> num;
sumd = sum( num) ;
cout << The sumof t he di gi t s i s << sumd;
r et ur n 0;
}
Chapter 19 o Function Return Values and Prototypes
404
i nt sum( i nt num)
{
i nt ct r ; / / Local l oop count er .
i nt sumd=0; / / Local t o t hi s f unct i on.
i f ( num<= 0) / / Check whet her par amet er i s t oo smal l .
{ sumd = num; } / / Ret ur ns par amet er i f t oo smal l .
el se
{ f or ( ct r =1; ct r <=num; ct r ++)
{ sumd += ct r ; }
}
r et ur n( sumd) ;
}
The following is a sample output from this program:
Pl ease t ype a number : 6
The sumof t he di gi t s i s 21
4. The following program contains two functions that return
values. The first function, maxi mum( ) , returns the larger of two
numbers entered by the user. The second one, mi ni mum( ) ,
returns the smaller.
/ / Fi l ename: C19MI NMX. CPP
/ / Fi nds mi ni mumand maxi mumval ues i n f unct i ons.
#i ncl ude <i ost r eam. h>
i nt maxi mum( i nt num1, i nt num2) ; / / Pr ot ot ypes
i nt mi ni mum( i nt num1, i nt num2) ;
mai n( )
{
i nt num1, num2; / / User s t wo number s.
i nt mi n, max;
cout << Pl ease t ype t wo number s ( such as 46 75) ;
ci n >> num1 >> num2;
max = maxi mum( num1, num2) ; / / Assi gn t he r et ur n
mi n = mi ni mum( num1, num2) ; / / val ue of each
/ / f unct i on t o var i abl es.
405
EXAMPLE
C+ + By
cout << The mi ni mumnumber i s << mi n << \ n;
cout << The maxi mumnumber i s << max << \ n;
r et ur n 0;
}
i nt maxi mum( i nt num1, i nt num2)
{
i nt max; / / Local t o t hi s f unct i on onl y.
max = ( num1 > num2) ? ( num1) : ( num2) ;
r et ur n ( max) ;
}
i nt mi ni mum( i nt num1, i nt num2)
{
i nt mi n; / / Local t o t hi s f unct i on onl y.
mi n = ( num1 < num2) ? ( num1) : ( num2) ;
r et ur n ( mi n) ;
}
Here is a sample output from this program:
Pl ease t ype t wo number s ( such as 46 75) 72 55
The mi ni mumnumber i s 55
The maxi mumnumber i s 72
If the user types the same number, mi ni mumand maxi mumare
the same.
These two functions can be passed any two integer values. In
such a simple example as this one, the user certainly already
knows which number is lower or higher. The point of such
an example is to show how to code return values. You might
want to use similar functions in a more useful application,
such as finding the highest paid employee from a payroll
disk file.
Func tion Prototypes
The word prototype is sometimes defined as a model. In C++, a
function prototype models the actual function. Before completing
Chapter 19 o Function Return Values and Prototypes
406
your study of functions, parameters, and return values, you must
understand how to prototype each function in your program.
C++ requires that you prototype all functions in your program.
When prototyping, you inform C++ of the functions parameter
types and its return value, if any.
To prototype a function, copy the functions definition line to
the top of your program (immediately before or after the #i ncl ude
<i ost r eam. h>line). Place a semicolon at the end of the function
definition line, and you have the prototype. The definition line (the
functions first line) contains the return type, the function name, and
the type of each argument, so the function prototype serves as a
model of the function that follows.
If a function does not return a value, or if that function has no
arguments passed to it, you should still prototype it. Place the
keyword voi d in place of the return type or the parameters. mai n( ) is
the only function that you do not have to prototype because it is self-
prototyping; meaning mai n( ) is not called by another function. The
first time mai n( ) appears in your program (assuming you follow the
standard approach and make mai n( ) your programs first function),
it is executed.
If a function returns nothing, voi d must be its return type. Put
voi d in the argument parentheses of function prototypes with no
arguments. All functions must match their prototypes.
All mai n( ) functions in this book have returned a 0. Why? You
now know enough to answer that question. Because mai n( ) is self-
prototyping, and because the voi d keyword never appeared before
mai n( ) in these programs, C++ assumed an i nt return type. All C++
functions prototyped as returning i nt or those without any return
data type prototype assume i nt . If you wanted to not put r et ur n 0;
at the end of mai n( ) s functions, you must insert voi d before mai n( )
as in:
voi d mai n( ) / / mai n( ) sel f - pr ot ot ypes t o r et ur n not hi ng.
You can look at a statement and tell whether it is a prototype or
a function definition (the functions first line) by the semicolon on
the end. All prototypes, unless you make mai n( ) self-prototype, end
with a semicolon.
C++ assumes
functi ons return i nt
unl ess you put a
di fferent data return
type, or use the
voi d keyword.
407
EXAMPLE
C+ + By
Prototype for Safety
Prototyping protects you from programming mistakes. Sup-
pose you write a function that expects two arguments: an integer
followed by a floating-point value. Here is the first line of such a
function:
my_f un( i nt num, f l oat amount )
What if you passed incorrect data types to my_f un( ) ? If you were
to call this function by passing it two literals, a floating-point
followed by an integer, as in
my_f un( 23. 43, 5) ; / / Cal l t he my_f un( ) f unct i on.
the function would not receive correct parameters. It is expecting an
integer followed by a floating-point, but you did the opposite and
sent it a floating-point followed by an integer.
In regular C programs, mismatched arguments such as these
generate no error message even though the data are not passed
correctly. C++ requires prototypes so you cannot send the wrong
data types to a function (or expect the wrong data type to be
returned). Prototyping the previous function results in this:
voi d my_f un( i nt num, f l oat amount ) ; / / Pr ot ot ype
In doing so, you tell the compiler to check this function for
accuracy. You inform the compiler to expect nothing after the r et ur n
statement, not even 0, (due to the voi d keyword) and to expect an
integer followed by a floating-point in the parentheses.
If you break any of the prototypes rules, the compiler informs
you of the problem and you can correct it.
Prototype All Func tions
You should prototype every function in your program. As just
described, the prototype defines (for the rest of the program) which
functions follow, their return types, and their parameter types. You
should prototype C++s built-in functions also, such as pr i nt f ( ) and
scanf ( ) if you use them.
Prototypi ng protects
your programs from
functi on program-
mi ng errors.
Chapter 19 o Function Return Values and Prototypes
408
Think about how you prototype pr i nt f ( ) . You dont always
pass it the same types of parameters because you print different data
with each pr i nt f ( ) . Prototyping functions you write is easy: The
prototype is basically the first line in the function. Prototyping
functions you do not write might seem difficult, but it isntyou
have already done it with every program in this book!
The designers of C++ realized that all functions have to be
prototyped. They realized also that you cannot prototype built-in
functions, so they did it for you and placed the prototypes in header
files on your disk. You have been including the pr i nt f ( ) and scanf ( )
prototypes in each program that used them in this book with the
following statement:
#i ncl ude <st di o. h>
Inside the stdio.h file is a prototype of many of C++s input and
output functions. By having prototypes of these functions, you
ensure that they cannot be passed bad values. If someone attempts
to pass incorrect values, C++ catches the problem.
Because pr i nt f ( ) and scanf ( ) are not used very often in C++, the
cout and ci n operators have their own header file called iostream.h
that you have seen included in this books programs as well. The
iostream.h file does not actually include prototypes for cout and ci n
because they are operators and not functions, but iostream.h does
include some needed definitions to make cout and ci n work.
Remember too that iomanip.h has to be included if you use a
set w or set pr eci si on modifier in cout . Any time you use a new built-
in C++ function or a manipulating operator, check your compilers
manual to find the name of the prototype file to include.
Prototyping is the primary reason why you should always
include the matching header file when you use C++s built-in
functions. The st r cpy( ) function you saw in previous chapters
requires the following line:
#i ncl ude <st r i ng. h>
This is the header file for the st r cpy( ) function. Without it, the
program does not work.
Header fi l es contai n
bui l t- i n functi on
prototypes.
409
EXAMPLE
C+ + By
Examples
1. Prototype all functions in all programs except mai n( ) . Even
mai n( ) must be prototyped if it returns nothing (not even 0).
The following program includes two prototypes: one for
mai n( ) because it returns nothing, and one for the built-in
pr i nt f ( ) and scanf ( ) functions.
/ / Fi l ename: C19PRO1. CPP
/ / Cal cul at es sal es t ax on a sal e
#i ncl ude <st di o. h> / / Pr ot ot ype bui l t - i n f unct i ons.
voi d mai n( voi d) ;
voi d mai n( voi d)
{
f l oat t ot al _sal e;
f l oat t ax_r at e = . 07; / / Assume seven per cent
/ / t ax r at e.
pr i nt f ( What i s t he sal e amount ? ) ;
scanf ( %f , &t ot al _sal e) ;
t ot al _sal e += ( t ax_r at e * t ot al _sal e) ;
pr i nt f ( The t ot al sal e i s %. 2f , t ot al _sal e) ;
r et ur n; / / No 0 r equi r ed!
}
Notice that mai n( ) s r et ur n statement needed only a semi-
colon after it. As long as you prototype mai n( ) with a voi d
return type, the last line in mai n( ) can be r et ur n; instead of
having to type r et ur n 0; each time.
2. The following program asks the user for a number in mai n( ) ,
and passes that number to asci i ( ) . The asci i ( ) function
returns the ASCII character that matches the users number.
This example illustrates a char act er return type. Functions
can return any data type.
Chapter 19 o Function Return Values and Prototypes
410
/ / Fi l ename: C19ASC. CPP
/ / Pr i nt s t he ASCI I char act er of t he user s number .
/ / Pr ot ot ypes f ol l ow.
#i ncl ude <i ost r eam. h>
char asci i ( i nt num) ;
voi d mai n( )
{
i nt num;
char asc_char ;
cout << Ent er an ASCI I number ? ;
ci n >> num;
asc_char = asci i ( num) ;
cout << The ASCI I char act er f or << num
<< i s << asc_char ;
r et ur n;
}
char asci i ( i nt num)
{
char asc_char ;
asc_char = char ( num) ; / / Type cast t o a char act er .
r et ur n ( asc_char ) ;
}
The output from this program follows:
Ent er an ASCI I number ? 67
The ASCI I char act er f or 67 i s C
3. Suppose you have to calculate net pay for a company. You
find yourself multiplying the hours worked by the hourly
pay, then deducting taxes to compute the net pay. The
following program includes a function that does this for you.
It requires three arguments: the hours worked, the hourly
pay, and the tax rate (as a floating-point decimal, such as .30
for 30 percent). The function returns the net pay. The mai n( )
calling program tests the function by sending three different
payroll values to the function and printing the three return
values.
411
EXAMPLE
C+ + By
/ / Fi l ename: C19NPAY. CPP
/ / Def i nes a f unct i on t hat comput es net pay.
#i ncl ude <i ost r eam. h> / / Needed f or cout and ci n.
voi d mai n( voi d) ;
f l oat net payf un( f l oat hour s, f l oat r at e, f l oat t axr at e) ;
voi d mai n( voi d)
{
f l oat net _pay;
net _pay = net payf un( 40. 0, 3. 50, . 20) ;
cout << The pay f or 40 hour s at $3. 50/ hr . , and a 20%
<< t ax r at e i s $;
cout << net _pay << \ n;
net _pay = net payf un( 50. 0, 10. 00, . 30) ;
cout << The pay f or 50 hour s at $10. 00/ hr . , and a 30%
<< t ax r at e i s $;
cout << net _pay << \ n;
net _pay = net payf un( 10. 0, 5. 00, . 10) ;
cout << The pay f or 10 hour s at $5. 00/ hr . , and a 10%
<< t ax r at e i s $;
cout << net _pay << \ n;
r et ur n;
}
f l oat net payf un( f l oat hour s, f l oat r at e, f l oat t axr at e)
{
f l oat gr oss_pay, t axes, net _pay;
gr oss_pay = ( hour s * r at e) ;
t axes = ( t axr at e * gr oss_pay) ;
net _pay = ( gr oss_pay - t axes) ;
r et ur n ( net _pay) ;
}
Chapter 19 o Function Return Values and Prototypes
412
Review Questions
The answers to the review questions are in Appendix B.
1. How do you declare function return types?
2. What is the maximum number of return values a function
can return?
3. What are header files for?
4. What is the default function return type?
5. True or false: a function that returns a value can be passed
only a single parameter.
6. How do prototypes protect the programmer from bugs?
7. Why dont you have to return global variables?
8. What is the return type, given the following function
prototype?
f l oat my_f un( char a, i nt b, f l oat c) ;
How many parameters are passed to my_f un( ) ? What are
their types?
Review Exerc ises
1. Write a program that contains two functions. The first
function returns the square of the integer passed to it, and
the second function returns the cube. Prototype mai n( ) so
you do not have to return a value.
2. Write a function that returns the double-precision area of a
circle, given that a double-precision radius is passed to it.
The formula for calculating the area of a circle is
ar ea = 3. 14159 * ( r adi us * r adi us)
3. Write a function that returns the value of a polynomial given
this formula:
9x4 + 15x2 + x1
413
EXAMPLE
C+ + By
Assume x is passed from mai n( ) and it is supplied by the
user.
Summary
You learned how to build your own collection of functions.
When you write a function, you might want to use it in more than
one programthere is no need to reinvent the wheel. Many pro-
grammers write useful functions and use them in more than one
program.
You now understand the importance of prototyping functions.
You should prototype all your own functions, and include the
appropriate header file when you use one of C++s built-in func-
tions. Furthermore, when a function returns a value other than an
integer, you must prototype so C++ recognizes the noninteger
return value.
Chapter 19 o Function Return Values and Prototypes
414
415
EXAMPLE
C+ + By
20
Default Arguments
and Func tion
Overloading
All functions that receive arguments do not have to be sent values.
C++ enables you to specify default argument lists. You can write
functions that assume argument values even if you do not pass them
any arguments.
C++ also enables you to write more than one function with the
same function name. This is called overloading functions. As long as
their argument lists differ, the functions are differentiated by C++.
This chapter introduces you to the following:
o Default argument lists
o Overloaded functions
o Name-mangling
Default argument lists and overloaded functions are not avail-
able in regular C. C++ extends the power of your programs by
providing these time-saving procedures.
Chapter 20 o D efault Argum ents and Function O verloading
416
Default Argument Lists
Suppose you were writing a program that has to print a
message on-screen for a short period of time. For instance, you pass
a function an error message stored in a character array and the
function prints the error message for a certain period of time.
The prototype for such a function can be this:
voi d pr _msg( char not e[ ] ) ;
Therefore, to request that pr _msg( ) print the line Tur n pr i nt er
on, you call it this way:
pr _msg( Tur n pr i nt er on) ; / / Passes a message t o be pr i nt ed.
This command prints the message Tur n pr i nt er on for a period
of five seconds or so. To request that pr _msg( ) print the line Pr ess
any key t o cont i nue. . . , you call it this way:
pr _msg( Pr ess a key t o cont i nue. . . ) ; / / Passes a message.
As you write more of the program, you begin to realize that you
are printing one message, for instance the Tur n pr i nt er on message,
more often than any other message. It seems as if the pr _msg( )
function is receiving that message much more often than any
other. This might be the case if you were writing a program that
printed many reports to the printer. You still will use pr _msg( ) for
other delayed messages, but the Tur n pr i nt er on message is most
frequently used.
Instead of calling the function over and over, typing the same
message each time, you can set up the prototype for pr _msg( ) so it
defaults to the Tur n pr i nt er on in this way:
voi d pr _msg( char not e[ ] =Tur n pr i nt er on) ; / / Pr ot ot ype
After prototyping pr _msg( ) with the default argument list, C++
assumes you want to pass Tur n pr i nt er on to the function unless
you override the default by passing something else to it. For in-
stance, in mai n( ) , you call pr _msg( ) this way:
pr _msg( ) ; / / C++ assumes you mean Tur n pr i nt er on.
This makes your programming job easier. Because most of the
time you want pr _msg( ) to print Tur n pr i nt er on the default
Li st defaul t argument
val ues i n the
prototype.
417
EXAMPLE
C+ + By
argument list takes care of the message and you do not have to pass
the message when you call the function. However, those few times
when you want to pass something else, simply pass a different
message. For example, to make pr _msg( ) print I ncor r ect val ue you
type:
pr _msg( I ncor r ect val ue) ; / / Pass a new message.
TIP: Any time you call a function several times and find
yourself passing that function the same parameters most of the
time, consider using a default argument list.
Multiple Default Arguments
You can specify more than one default argument in the proto-
type list. Here is a prototype for a function with three default
arguments:
f l oat f unct 1( i nt i =10, f l oat x=7. 5, char c= A ) ;
There are several ways you can call this function. Here are some
samples:
f unct 1( ) ;
All default values are assumed.
f unct 1( 25) ;
A 25 is sent to the integer argument, and the default values are
assumed for the rest.
f unct 1( 25, 31. 25) ;
A 25 is sent to the integer argument, 31. 25 to the floating-point
argument, and the default value of A is assumed for the character
argument.
Chapter 20 o D efault Argum ents and Function O verloading
418
NOTE: If only some of a functions arguments are default
arguments, those default arguments must appear on the far left
of the argument list. No default arguments can appear to the
left of those not specified as default. This is an invalid default
argument prototype:
f l oat f unc2( i nt i =10, f l oat x, char c, l ong n=10. 232) ;
This is invalid because a default argument appears on the left
of a nondefault argument. To fix this, you have to move the two
default arguments to the far left (the start) of the argument list.
Therefore, by rearranging the prototype (and the resulting
function calls) as follows, C++ enables you to accomplish the
same objective as you attempted with the previous line:
f l oat f unc2( f l oat x, char c, i nt i =10, l ong n=10. 232) ;
Examples
1. Here is a complete program that illustrates the message-
printing function described earlier in this chapter. The mai n( )
function simply calls the delayed message-printing function
three times, each time passing it a different set of argument
lists.
/ / Fi l ename: C20DEF1. CPP
/ / I l l ust r at es def aul t ar gument l i st .
#i ncl ude <i ost r eam. h>
voi d pr _msg( char not e[ ] =Tur n pr i nt er on) ; / / Pr ot ot ype.
voi d mai n( )
{
pr _msg( ) ; / / Pr i nt s def aul t message.
pr _msg( A new message) ; / / Pr i nt s anot her message.
pr _msg( ) ; / / Pr i nt s def aul t message agai n.
r et ur n;
}
voi d pr _msg( char not e[ ] ) / / Onl y pr ot ot ype cont ai ns def aul t s.
419
EXAMPLE
C+ + By
{
l ong i nt del ay;
cout << not e << \ n;
f or ( del ay=0; del ay<500000; del ay++)
{ ; / * Do not hi ng whi l e wai t i ng */ }
r et ur n;
}
The program produces the following output:
Tur n pr i nt er on
A new message
Tur n pr i nt er on
The delay loop causes each line to display for a couple of
seconds or more, depending on the speed of your computer,
until all three lines print.
2. The following program illustrates the use of defaulting
several arguments. mai n( ) calls the function de_f un( ) five
times, sending de_f un( ) five sets of arguments. The de_f un( )
function prints five different things depending on mai n( ) s
argument list.
/ / Fi l ename: C20DEF2. CPP
/ / Demonst r at es def aul t ar gument l i st wi t h sever al par amet er s.
#i ncl ude <i ost r eam. h>
#i ncl ude <i omani p. h>
voi d de_f un( i nt i =5, l ong j =40034, f l oat x=10. 25,
char ch= Z , doubl e d=4. 3234) ; / / Pr ot ot ype
voi d mai n( )
{
de_f un( ) ; / / Al l def aul t s used.
de_f un( 2) ; / / Fi r st def aul t over r i dden.
de_f un( 2, 75037) ; / / Fi r st and second def aul t over r i dden.
de_f un( 2, 75037, 35. 88) ; / / Fi r st , second, and t hi r d
de_f un( 2, 75037, 35. 88, G ) ; / / Fi r st , second, t hi r d,
/ / and f our t h
de_f un( 2, 75037, 35. 88, G , . 0023) ; / / No def aul t i ng.
Chapter 20 o D efault Argum ents and Function O verloading
420
r et ur n;
}
voi d de_f un( i nt i , l ong j , f l oat x, char ch, doubl e d)
{
cout << set pr eci si on( 4) << i : << i << << j : << j ;
cout << x: << x << << ch: << ch;
cout << d: << d << \ n;
r et ur n;
}
Here is the output from this program:
i : 5 j : 40034 x: 10. 25 ch: Z d: 4. 3234
i : 2 j : 40034 x: 10. 25 ch: Z d: 4. 3234
i : 2 j : 75037 x: 10. 25 ch: Z d: 4. 3234
i : 2 j : 75037 x: 35. 88 ch: Z d: 4. 3234
i : 2 j : 75037 x: 35. 88 ch: G d: 4. 3234
i : 2 j : 75037 x: 35. 88 ch: G d: 0. 0023
Notice that each call to de_f un( ) produces a different output
because mai n( ) sends a different set of parameters each time
mai n( ) calls de_f un( ) .
Overloaded Func tions
Unlike regular C, C++ enables you to have more than one
function with the same name. In other words, you can have three
functions called abs( ) in the same program. Functions with the same
names are called overloaded functions. C++ requires that each
overloaded function differ in its argument list. Overloaded func-
tions enable you to have similar functions that work on different
types of data.
For example, suppose you wrote a function that returned the
absolute value of whatever number you passed to it. The absolute
value of a number is its positive equivalent. For instance, the
absolute value of 10.25 is 10.25 and the absolute value of 10.25
is 10.25.
Absolute values are used in distance, temperature, and weight
calculations. The difference in the weights of two children is always
421
EXAMPLE
C+ + By
positive. If Joe weighs 65 pounds and Mary weighs 55 pounds, their
difference is a positive 10 pounds. You can subtract the 65 from 55
(10) or 55 from 65 (+10) and the weight difference is always the
absolute value of the result.
Suppose you had to write an absolute-value function for inte-
gers, and an absolute-value function for floating-point numbers.
Without function overloading, you need these two functions:
i nt i abs( i nt i ) / / Ret ur ns absol ut e val ue of an i nt eger .
{
i f ( i < 0)
{ r et ur n ( i * - 1) ; } / / Makes posi t i ve.
el se
{ r et ur n ( i ) ; } / / Al r eady posi t i ve.
}
f l oat f abs( f l oat x) / / Ret ur ns absol ut e val ue of a f l oat .
{
i f ( x < 0. 0)
{ r et ur n ( x * - 1. 0) ; } / / Makes posi t i ve.
el se
{ r et ur n ( x) ; } / / Al r eady posi t i ve.
}
Without overloading, if you had a floating-point variable for
which you needed the absolute value, you pass it to the f abs( )
function as in:
ans = f abs( wei ght ) ;
If you needed the absolute value of an integer variable, you
pass it to the i abs( ) function as in:
i ans = i abs( age) ;
Because the code for these two functions differ only in their
parameter lists, they are perfect candidates for overloaded func-
tions. Call both functions abs( ) , prototype both of them, and code
each of them separately in your program. After overloading the two
functions (each of which works on two different types of parameters
with the same name), you pass your floating-point or integer value
to abs( ) . The C++ compiler determines which function you wanted
to call.
Chapter 20 o D efault Argum ents and Function O verloading
422
CAUTION: If two or more functions differ only in their return
types, C++ cannot overload them. Two or more functions that
differ only in their return types must have different names and
cannot be overloaded.
This process simplifies your programming considerably. In-
stead of having to remember several different function names, you
only have to remember one function name. C++ passes the argu-
ments to the proper function.
NOTE: C++ uses name-mangling to accomplish overloaded
functions. Understanding name-mangling helps you as you
become an advanced C++ programmer.
When C++ realizes that you are overloading two or more
functions with the same name, each function differing only in
its parameter list, C++ changes the name of the function and
adds letters to the end of the function name that match the
parameters. Different C++ compilers do this differently.
To understand what the compiler does, take the absolute value
function described earlier. C++ might change the integer abso-
lute value function to absi ( ) and the floating-point absolute
value function to absf ( ) . When you call the function with this
function call:
i ans = abs( age) ;
C++ determines that you want the absi ( ) function called. As far
as you know, C++ is not mangling the names; you never see the
name differences in your programs source code. However, the
compiler performs the name-mangling so it can keep track of
different functions that have the same name.
423
EXAMPLE
C+ + By
Ex a mple s
1. Here is the complete absolute value program described in
the previous text. Notice that both functions are prototyped.
(The two prototypes signal C++ that it must perform name-
mangling to determine the correct function names to call.)
/ / Fi l ename: C20OVF1. CPP
/ / Over l oads t wo absol ut e val ue f unct i ons.
#i ncl ude <i ost r eam. h> / / Pr ot ot ype cout and ci n.
#i ncl ude <i omani p. h> / / Pr ot ot ype set pr eci si on( 2) .
i nt abs( i nt i ) ; / / abs( ) i s over l oaded t wi ce
f l oat abs( f l oat x) ; / / as shown by t hese pr ot ot ypes.
voi d mai n( )
{
i nt i ans; / / To hol d r et ur n val ues.
f l oat f ans;
i nt i = - 15; / / To pass t o t he t wo over l oaded f unct i ons.
f l oat x = - 64. 53;
i ans = abs( i ) ; / / C++ cal l s t he i nt eger abs( ) .
cout << I nt eger absol ut e val ue of - 15 i s << i ans << \ n;
f ans = abs( x) ; / / C++ cal l s t he f l oat i ng- poi nt abs( ) .
cout << Fl oat absol ut e val ue of - 64. 53 i s <<
set pr eci si on( 2) << f ans << \ n;
/ / Not i ce t hat you no l onger have t o keep t r ack of t wo
/ / di f f er ent names. C++ cal l s t he appr opr i at e
/ / f unct i on t hat mat ches t he par amet er s.
r et ur n;
}
i nt abs( i nt i ) / / I nt eger absol ut e val ue f unct i on
{
i f ( i < 0)
{ r et ur n ( i * - 1) ; } / / Makes posi t i ve.
el se
{ r et ur n ( i ) ; } / / Al r eady posi t i ve.
}
Chapter 20 o D efault Argum ents and Function O verloading
424
f l oat abs( f l oat x) / / Fl oat i ng- poi nt absol ut e val ue f unct i on
{
i f ( x < 0. 0)
{ r et ur n ( x * - 1. 0) ; } / / Makes posi t i ve.
el se
{ r et ur n ( x) ; } / / Al r eady posi t i ve.
}
The output from this program follows:
I nt eger absol ut e val ue of - 15 i s 15
Fl oat absol ut e val ue of - 64. 53 i s 64. 53
2. As you write more and more C++ programs, you will see
many uses for overloaded functions. The following program
is a demonstration program showing how you can build
your own output functions to suit your needs. mai n( ) calls
three functions named out put ( ) . Each time its called, mai n( )
passes a different value to the function.
When mai n( ) passes out put ( ) a string, out put ( ) prints the
string, formatted to a width (using the set w( ) manipulator
described in Chapter 7, Simple Input/Output) of 30
characters. When mai n( ) passes out put ( ) an integer, out put ( )
prints the integer with a width of five. When mai n( ) passes
out put ( ) a floating-point value, out put ( ) prints the value to
two decimal places and generalizes the output of different
types of data. You do not have to format your own data.
out put ( ) properly formats the data and you only have to
remember one function name that outputs all three types of
data.
/ / Fi l ename: C20OVF2. CPP
/ / Out put s t hr ee di f f er ent t ypes of
/ / dat a wi t h same f unct i on name.
#i ncl ude <i ost r eam. h>
#i ncl ude <i omani p. h>
voi d out put ( char [ ] ) ; / / Pr ot ot ypes f or over l oaded f unct i ons.
voi d out put ( i nt i ) ;
voi d out put ( f l oat x) ;
425
EXAMPLE
C+ + By
voi d mai n( )
{
char name[ ] = C++ By Exampl e makes C++ easy! ;
i nt i val ue = 2543;
f l oat f val ue = 39. 4321;
out put ( name) ; / / C++ chooses t he appr opr i at e f unct i on.
out put ( i val ue) ;
out put ( f val ue) ;
r et ur n;
}
voi d out put ( char name[ ] )
{
cout << set w( 30) << name << \ n;
/ / The wi dt h t r uncat es st r i ng i f i t i s l onger t han 30.
r et ur n;
}
voi d out put ( i nt i val ue)
{
cout << set w( 5) << i val ue << \ n;
/ / J ust pr i nt ed i nt eger wi t hi n a wi dt h of f i ve spaces.
r et ur n;
}
voi d out put ( f l oat f val ue)
{
cout << set pr eci si on( 2) << f val ue << \ n;
/ / Li mi t ed t he f l oat i ng- poi nt val ue t o t wo deci mal pl aces.
r et ur n;
}
Here is the output from this program:
C++ By Exampl e makes C++ easy!
2543
39. 43
Each of the three lines, containing three different lines of
information, was printed with the same function call.
Chapter 20 o D efault Argum ents and Function O verloading
426
Review Questions
The answers to the review questions are in Appendix B.
1. Where in the program do you specify the defaults for default
argument lists?
2. What is the term for C++ functions that have the same
name?
3. Does name-mangling help support default argument lists or
overloaded functions?
4. True or false: You can specify only a single default
argument.
5. Fix the following prototype for a default argument list.
voi d my_f un( i nt i =7, f l oat x, char ch= A ) ;
6. True or false: The following prototypes specify overloaded
functions:
i nt sq_r t ( i nt n) ;
f l oat sq_r t ( i nt n) ;
Review Exerc ises
1. Write a program that contains two functions. The first
function returns the square of the integer passed to it, and
the second function returns the square of the float passed
to it.
2. Write a program that computes net pay based on the values
the user types. Ask the user for the hours worked, the rate
per hour, and the tax rate. Because the majority of employees
work 40 hours per week and earn $5.00 per hour, use these
values as default values in the function that computes the
net pay. If the user presses Enter in response to your ques-
tions, use the default values.
427
EXAMPLE
C+ + By
Summary
Default argument lists and overloaded functions speed up
your programming time. You no longer have to specify values for
common arguments. You do not have to remember several different
names for those functions that perform similar routines and differ
only in their data types.
The remainder of this book elaborates on earlier concepts so
you can take advantage of separate, modular functions and local
data. You are ready to learn more about how C++ performs input
and output. Chapter 21, Device and Character Input/Output,
teaches you the theory behind I/O in C++, and introduces more
built-in functions.
Chapter 20 o D efault Argum ents and Function O verloading
428
Part V
Character Input/Output and
String Functions
431
EXAMPLE
C+ + By
21
Devic e and
Charac ter
Input/Output
Unlike many programming languages, C++ contains no input or
output commands. C++ is an extremely portable language; a C++
program that compiles and runs on one computer is able also to
compile and run on another type of computer. Most incompatibili-
ties between computers reside in their input/output mechanics.
Each different device requires a different method of performing
I/O (Input/Output).
By putting all I/O capabilities in common functions supplied
with each computers compiler, not in C++ statements, the design-
ers of C++ ensured that programs were not tied to specific hardware
for input and output. A compiler has to be modified for every
computer for which it is written. This ensures the compiler works
with the specific computer and its devices. The compiler writers
write I/O functions for each machine; when your C++ program
writes a character to the screen, it works the same whether you have
a color PC screen or a UNIX X/Windows terminal.
This chapter shows you additional ways to perform input and
output of data besides the ci n and cout functions you have seen
Chapter 21 o D evice and C haracter Input/O utput
432
C++ vi ews i nput and
output from al l
devi ces as streams
of characters.
throughout the book. By providing character-based I/O functions,
C++ gives you the basic I/O functions you need to write powerful
data entry and printing routines.
This chapter introduces you to
o Stream input and output
o Redirecting I/O
o Printing to the printer
o Character I/O functions
o Buffered and nonbuffered I/O
By the time you finish this chapter, you will understand the
fundamental built-in I/O functions available in C++. Performing
character input and output, one character at a time, might sound like
a slow method of I/O. You will soon realize that character I/O
actually enables you to create more powerful I/O functions than ci n
and cout .
Stream and Charac ter I/O
C++ views all input and output as streams of characters.
Whether your program receives input from the keyboard, a disk file,
a modem, or a mouse, C++ only views a stream of characters. C++
does not have to know what type of device is supplying the input;
the operating system handles the device specifics. The designers of
C++ want your programs to operate on characters of data without
regard to the physical method taking place.
This stream I/O means you can use the same functions to
receive input from the keyboard as from the modem. You can use the
same functions to write to a disk file, printer, or screen. Of course,
you have to have some way of routing that stream input or output
to the proper device, but each programs I/O functions works in a
similar manner. Figure 21.1 illustrates this concept.
433
EXAMPLE
C+ + By
Figure 21.1. All I/O consists of streams of characters.
The Newline Special Character: / n
Portability is the key to C++s success. Few companies have the
resources to rewrite every program they use when they change
computer equipment. They need a programming language
that works on many platforms (hardware combinations). C++
achieves true portability better than almost any other program-
ming language.
It is because of portability that C++ uses the generic newline
character, \ n, rather than the specific carriage return and line
feed sequences other languages use. This is why C++ uses the
\ t for tab, as well as the other control characters used in I/O
functions.
If C++ used ASCII code to represent these special characters,
your programs would not be portable. You would write a C++
program on one computer and use a carriage return value such
as 12, but 12 might not be the carriage return value on another
type of computer.
By using newline and the other control characters available in
C++, you ensure your program is compatible with any com-
puter on which it is compiled. The specific compilers substitute
their computers actual codes for the control codes in your
programs.
Chapter 21 o D evice and C haracter Input/O utput
434
Standard Devic es
Table 21.1 shows a listing of standard I/O devices. C++ always
assumes input comes from stdin, meaning the standard input device.
This is usually the keyboard, although you can reroute this default.
C++ assumes all output goes to stdout, or the standard output device.
There is nothing magic in the words stdin and stdout; however,
many people learn their meanings for the first time in C++.
Table 21.1. Standard Devic es in C++.
Description C++ Name MS-DOS Name
Screen stdout CON:
Keyboard stdin CON:
Printer stdprn PRN: or LPT1:
Serial Port stdaux AUX: or COM1:
Error Messages stderr CON:
Disk Files none Filename
Take a moment to study Table 21.1. You might think it is
confusing that three devices are named CON:. MS-DOS differenti-
ates between the screen device called CON: (which stands for
console), and the keyboard device called CON: from the context of
the data stream. If you send an output stream (a stream of characters)
to CON:, MS-DOS routes it to the screen automatically. If you
request input from CON:, MS-DOS retrieves the input from the
keyboard. (These defaults hold true as long as you have not redi-
rected these devices, as shown below.) MS-DOS sends all error
messages to the screen (CON:) as well.
NOTE: If you want to route I/O to a second printer or serial
port, see how to do so in Chapter 30, Sequential Files.
435
EXAMPLE
C+ + By
Redirec ting Devic es from MS-DOS
The reason cout goes to the screen is simply because st dout is
routed to the screen, by default, on most computers. The reason ci n
inputs from the keyboard is because most computers consider the
keyboard to be the standard input device, stdin. After compiling
your program, C++ does not send data to the screen or retrieve it
from the keyboard. Instead, the program sends output to stdout and
receives input from stdin. The operating system routes the data to
the appropriate device.
MS-DOS enables you to reroute I/O from their default loca-
tions to other devices through the use of the output redirection symbol,
>, and the input redirection symbol, <. The goal of this book is not to
delve deeply in operating-system redirection. To learn more about
the handling of I/O, read a good book on MS-DOS, such as Using
MS-DOS 5.
Basically, the output redirection symbol informs the operating
system that you want standard output to go to a device other than
the default (the screen). The input redirection symbol routes input
away from the keyboard to another input device. The following
example illustrates how this is done in MS-DOS.
Examples
1. Suppose you write a program that uses only ci n and cout for
input and output. Instead of receiving input from the key-
board, you want the program to get the input from a file
called MYDATA. Because ci n receives input from st di n, you
must redirect stdin. After compiling the program in a file
called MYPGM.EXE, you can redirect its input away from
the keyboard with the following DOS command:
C: >MYPGM < MYDATA
Of course, you can include a full pathname either before the
program name or filename. There is a danger in redirecting
all output such as this, however. All output, including screen
prompts for keyboard input, goes to MYDATA. This is
probably not acceptable to you in most cases; you still want
The operati ng
system gi ves you
control over devi ces.
Chapter 21 o D evice and C haracter Input/O utput
436
prompts and some messages to go to the screen. In the next
section, you learn how to separate I/O, and send some
output to one device such as the screen and the rest to
another device, such as a file or printer.
2. You can also route the programs output to the printer by
typing this:
C: >MYPGM > PRN:
Route MYPGM output to the printer.
3. If the program required much input, and that input were
stored in a file called ANSWERS, you could override the
keyboard default device that ci n uses, as in:
C: >MYPGM < ANSWERS
The program reads from the file called ANSWERS every time ci n
required input.
4. You can combine redirection symbols. If you want input
from the ANSWERS disk file, and want to send the output to
the printer, do the following:
C: >MYPGM < ANSWERS > PRN:
TIP: You can route the output to a serial printer or a second
parallel printer port by substituting COM1: or LPT2: for PRN:.
Printing Formatted Output to
the Printer
Its easy to send program output to the printer using the
of st r eamfunction. The format of of st r eamis
of st r eamdevi ce( devi ce_name) ;
of st r eamal l ows
your program to
wri te to the pri nter.
437
EXAMPLE
C+ + By
The following examples show how you can combine cout and
of st r eamto write to both the screen and printer.
Example
The following program asks the user for his or her first and last
name. It then prints the name, last name first, to the printer.
/ / Fi l ename: C21FPR1. CPP
/ / Pr i nt s a name on t he pr i nt er .
#i ncl ude <f st r eam. h>
voi d mai n( )
{
char f i r st [ 20] ;
char l ast [ 20] ;
cout << What i s your f i r st name? ;
ci n >> f i r st ;
cout << What i s your l ast name? ;
ci n >> l ast ;
/ / Send names t o t he pr i nt er .
of st r eampr n( PRN) ;
pr n << I n a phone book, your name l ooks l i ke t hi s: \ n;
pr n << l ast << , << f i r st << \ n;
r et ur n;
}
Charac ter I/O Func tions
Because all I/O is actually character I/O, C++ provides many
functions you can use that perform character input and output. The
cout and ci n functions are called formatted I/O functions because they
give you formatting control over your input and output. The cout
and ci n functions are not character I/O functions.
of st r eamuses
the fstream.h header
fi l e.
Chapter 21 o D evice and C haracter Input/O utput
438
Theres nothing wrong with using cout for formatted output,
but ci n has many problems, as you have seen. You will now see how
to write your own character input routines to replace ci n, as well as
use character output functions to prepare you for the upcoming
section in this book on disk files.
The get ( ) and put ( ) Func tions
The most fundamental character I/O functions are get ( ) and
put ( ) . The put ( ) function writes a single character to the standard
output device (the screen if you dont redirect it from your operating
system). The get ( ) function inputs a single character from the
standard input device (the keyboard by default).
The format for get ( ) is
devi ce. get ( char _var ) ;
The get ( ) device can be any standard input device. If you were
receiving character input from the keyboard, you use ci n as the
device. If you initialize your modem and want to receive characters
from it, use of st r eamto open the modem device and read from the
device.
The format of put ( ) is
devi ce. put ( char _val ) ;
The char _val can be a character variable, expression, or con-
stant. You output character data with put ( ) . The device can be any
standard output device. To write a character to your printer, you
open PRN with of st r eam.
Examples
1. The following program asks the user for her or his initials a
character at a time. Notice the program uses both cout and
put ( ) . The cout is still useful for formatted output such as
messages to the user. Writing individual characters is best
achieved with put ( ) .
The program has to call two get ( ) functions for each char-
acter typed. When you answer a get ( ) prompt by typing a
get ( ) and put ( )
i nput and output
characters from and
to any standard
devi ces.
439
EXAMPLE
C+ + By
character followed by an Enter keypress, C++ interprets the
input as a stream of two characters. The get ( ) first receives
the letter you typed, then it has to receive the \ n (newline,
supplied to C++ when you press Enter). There are examples
that follow that fix this double get ( ) problem.
/ / Fi l ename: C21CH1. CPP
/ / I nt r oduces get ( ) and put ( ) .
#i ncl ude <f st r eam. h>
voi d mai n( )
{
char i n_char ; / / Hol ds i ncomi ng i ni t i al .
char f i r st , l ast ; / / Hol ds conver t ed f i r st and l ast i ni t i al .
cout << What i s your f i r st name i ni t i al ? ;
ci n. get ( i n_char ) ; / / Wai t s f or f i r st i ni t i al .
f i r st = i n_char ;
ci n. get ( i n_char ) ; / / I gnor es newl i ne.
cout << What i s your l ast name i ni t i al ? ;
ci n. get ( i n_char ) ; / / Wai t s f or l ast i ni t i al .
l ast = i n_char ;
ci n. get ( i n_char ) ; / / I gnor es newl i ne.
cout << \ nHer e t hey ar e: \ n;
cout . put ( f i r st ) ;
cout . put ( l ast ) ;
r et ur n;
}
Here is the output from this program:
What i s your f i r st name i ni t i al ? G
What i s your l ast name i ni t i al ? P
Her e t hey ar e:
GP
2. You can add carriage returns to space the output better. To
print the two initials on two separate lines, use put ( ) to put a
newline character to cout , as the following program does:
Chapter 21 o D evice and C haracter Input/O utput
440
/ / Fi l ename: C21CH2. CPP
/ / I nt r oduces get ( ) and put ( ) and uses put ( ) t o out put
newl i ne.
#i ncl ude <f st r eam. h>
voi d mai n( )
{
char i n_char ; / / Hol ds i ncomi ng i ni t i al .
char f i r st , l ast ; / / Hol ds conver t ed f i r st and l ast
/ / i ni t i al .
cout << What i s your f i r st name i ni t i al ? ;
ci n. get ( i n_char ) ; / / Wai t s f or f i r st i ni t i al .
f i r st = i n_char ;
ci n. get ( i n_char ) ; / / I gnor es newl i ne.
cout << What i s your l ast name i ni t i al ? ;
ci n. get ( i n_char ) ; / / Wai t s f or l ast i ni t i al .
l ast = i n_char ;
ci n. get ( i n_char ) ; / / I gnor es newl i ne.
cout << \ nHer e t hey ar e: \ n;
cout . put ( f i r st ) ;
cout . put ( \ n ) ;
cout . put ( l ast ) ;
r et ur n;
}
3. It might have been clearer to define the newline character as
a constant. At the top of the program, you have:
const char NEWLI NE= \ n
The put ( ) then reads:
cout . put ( NEWLI NE) ;
Some programmers prefer to define their character formatting
constants and refer to them by name. Its up to you to decide whether
you want to use this method, or whether you want to continue using
the \ n character constant in put ( ) .
The get ( ) function is a buffered input function. As you type
characters, the data does not immediately go to your program,
441
EXAMPLE
C+ + By
rather, it goes to a buffer. The buffer is a section of memory (and has
nothing to do with your PCs type-ahead buffers) managed by C++.
Figure 21.2 shows how this buffered function works. When
your program approaches a get ( ) , the program temporarily waits as
you type the input. The program doesnt view the characters, as
theyre going to the buffer of memory. There is practically no limit
to the size of the buffer; it fills with input until you press Enter. Your
Enter keypress signals the computer to release the buffer to your
program.
Figure 21.2. get ( ) input goes to a buffer. The buffer is released when
you press Enter.
Most PCs accept either buffered or nonbuffered input. The
get ch( ) function shown later in this chapter is nonbuffered. With
get ( ) , all input is buffered. Buffered text affects the timing of your
programs input. Your program receives no characters from a get ( )
until you press Enter. Therefore, if you ask a question such as
Do you want t o see t he r epor t agai n ( Y/ N) ?
and use get ( ) for input, the user can press a Y, but the program does
not receive the input until the user also presses Enter. The Y and
Enter then are sent, one character at a time, to the program where it
processes the input. If you want immediate response to a users
typing (such as the I NKEY$ in BASIC allows), you have to use get ch( ) .
Buffer
Chapter 21 o D evice and C haracter Input/O utput
442
TIP: By using buffered input, the user can type a string of
characters in response to a loop with get ( ) , receive characters,
and correct the input with Backspace before pressing Enter. If
the input were nonbuffered, the Backspace would be another
character of data.
Example
C21CH2.CPP must discard the newline character. It did so by
assigning the input characterfrom get ( ) to an extra variable.
Obviously, the get ( ) returns a value (the character typed). In this
case, its acceptable to ignore the return value by not using the
character returned by get ( ) . You know the user has to press Enter (to
end the input) so its acceptable to discard it with an unused get ( )
function call.
When inputting strings such as names and sentences, ci n only
allows one word to be entered at a time. The following string asks the
user for his or her full name with these two lines:
cout << What ar e your f i r st and l ast names? ;
ci n >> names; / / Recei ve name i n char act er ar r ay names.
The array names only receives the first name; ci n ignores all data
to the right of the first space.
You can build your own input function using get ( ) that doesnt
have a single-word limitation. When you want to receive a string of
characters from the user, such as his or her first and last name, you
can call the get _i n_st r ( ) function shown in the next program.
The mai n( ) function defines an array and prompts the user for
a name. After the prompt, the program calls the get _i n_st r ( ) func-
tion and builds the input array a character at a time using get ( ) . The
function keeps looping, using the whi l e loop, until the user presses
Enter (signaled by the newline character, \ n, to C++) or until the
maximum number of characters are typed. You might want to use
When recei vi ng
characters, you
mi ght have to
di scard the newl i ne
keypress.
443
EXAMPLE
C+ + By
this function in your own programs. Be sure to pass it a character
array and an integer that holds the maximum array size (you dont
want the input string to be longer than the character array that holds
it). When control returns to mai n( ) (or whatever function called
get _i n_st r ( ) ), the array has the users full input, including the
spaces.
/ / Fi l ename: C21I N. CPP
/ / Pr ogr amt hat bui l ds an i nput st r i ng ar r ay usi ng get ( ) .
#i ncl ude <f st r eam. h>
voi d get _i n_st r ( char st r [ ] , i nt l en) ;
const i nt MAX=25; / / Si ze of char act er ar r ay t o be t yped.
voi d mai n( )
{
char i nput _st r [ MAX] ; / / Keyboar d i nput f i l l s t hi s.
cout << What i s your f ul l name? ;
get _i n_st r ( i nput _st r , MAX) ; / / St r i ng f r omkeyboar d
cout << Af t er r et ur n, your name i s << i nput _st r << \ n;
r et ur n;
}
/ / **********************************************************
/ / The f ol l owi ng f unct i on r equi r es a st r i ng and t he maxi mum
/ / l engt h of t he st r i ng be passed t o i t . I t accept s i nput
/ / f r omt he keyboar d, and sends keyboar d i nput i n t he st r i ng.
/ / On r et ur n, t he cal l i ng r out i ne has access t o t he st r i ng.
/ / **********************************************************
voi d get _i n_st r ( char st r [ ] , i nt l en)
{
i nt i = 0; / / i ndex
char i nput _char ; / / char act er t yped
ci n. get ( i nput _char ) ; / / Get next char act er i n st r i ng.
whi l e ( i < ( l en - 1) && ( i nput _char ! = \ n ) )
{
st r [ i ] = i nput _char ; / / Bui l d st r i ng a char act er
Chapter 21 o D evice and C haracter Input/O utput
444
i ++; / / at a t i me.
ci n. get ( i nput _char ) ; / / Recei ve next char act er i n st r i ng.
}
st r [ i ] = \ 0 ; / / Make t he char ar r ay a st r i ng.
r et ur n;
}
NOTE: The loop checks for l en - 1 to save room for the null-
terminating zero at the end of the input string.
The get ch( ) and put ch( ) Func tions
The functions get ch( ) and put ch( ) are slightly different from the
previous character I/O functions. Their format is similar to get ( )
and put ( ) ; they read from the keyboard and write to the screen and
cannot be redirected, even from the operating system. The formats
of get ch( ) and put ch( ) are
i nt _var = get ch( ) ;
and
put ch( i nt _var ) ;
get ch( ) and put ch( ) are not AT&T C++ standard functions, but
they are usually available with most C++ compilers. get ch( ) and
put ch( ) are nonbuffered functions. The put ch( ) character output
function is a mirror-image function to get ch( ) ; it is a nonbuffered
output function. Because almost every output device made, except
for the screen and modem, are inherently buffered, put ch( ) effec-
tively does the same thing as put ( ) .
Another difference in get ch( ) from the other character input
functions is that get ch( ) does not echo the input characters on the
screen as it receives them. When you type characters in response to
get ( ) , you see the characters as you type them (as they are sent to the
buffer). If you want to see characters received by get ch( ) , you must
follow get ch( ) with a put ch( ) . It is handy to echo the characters on the
screen so the user can verify that she or he has typed correctly.
get ch( ) and
put ch( ) offer
nonbuffered i nput
and output that grab
the users characters
i mmedi atel y after the
user types them.
445
EXAMPLE
C+ + By
Some programmers want to make the user press Enter after
answering a prompt or selecting from a menu. They feel the extra
time given with buffered input gives the user more time to decide if
she or he wants to give that answer; the user can press Backspace and
correct the input before pressing Enter.
Other programmers like to grab the users response to a single-
character answer, such as a menu response, and act on it immedi-
ately. They feel that pressing Enter is an added and unneeded
burden for the user so they use get ch( ) . The choice is yours. You
should understand both buffered and nonbuffered input so you can
use both.
TIP: You can also use get che( ) . get che( ) is a nonbuffered input
identical to get ch( ) , except the input characters are echoed
(displayed) to the screen as the user types them. Using get che( )
rather than get ch( ) keeps you from having to call a put ch( ) to
echo the users input to the screen.
Example
The following program shows the get ch( ) and put ch( ) func-
tions. The user is asked to enter five letters. These five letters are
added (by way of a f or loop) to the character array named l et t er s.
As you run this program, notice that the characters are not echoed
to the screen as you type them. Because get ch( ) is unbuffered, the
program actually receives each character, adds it to the array, and
loops again, as you type them. (If this were buffered input, the
program would not loop through the five iterations until you
pressed Enter.)
A second loop prints the five letters using put ch( ) . A third loop
prints the five letters to the printer using put ( ) .
/ / Fi l ename: C21GCH1. CPP
/ / Uses get ch( ) and put ch( ) f or i nput and out put .
#i ncl ude <f st r eam. h>
Characters i nput
wi th get ch( ) are
not echoed to the
screen as the user
types them.
get ch( ) and
put ch( ) use the
coni o.h header fi l e.
Chapter 21 o D evice and C haracter Input/O utput
446
#i ncl ude <coni o. h>
voi d mai n( )
{
i nt ct r ; / / f or l oop count er
char l et t er s[ 5] ; / / Hol ds f i ve i nput char act er s. No
/ / r oomi s needed f or t he nul l zer o
/ / because t hi s ar r ay never wi l l be
/ / t r eat ed as a st r i ng.
cout << Pl ease t ype f i ve l et t er s. . . \ n;
f or ( ct r = 0; ct r < 5; ct r ++)
{
l et t er s[ ct r ] = get ch( ) ; / / Add i nput t o ar r ay.
}
f or ( ct r = 0; ct r < 5; ct r ++) / / Pr i nt t hemt o scr een.
{
put ch( l et t er s[ ct r ] ) ;
}
of st r eampr n( PRN) ;
f or ( ct r = 0; ct r < 5; ct r ++) / / Pr i nt t hemt o pr i nt er .
{
pr n. put ( l et t er s[ ct r ] ) ;
}
r et ur n;
}
When you run this program, do not press Enter after the five
letters. The get ch( ) function does not use the Enter. The loop auto-
matically ends after the fifth letter because of the unbuffered input
and the f or loop.
Review Questions
The answers to the review questions are found in Appendix B.
1. Why are there no input or output commands in C++?
2. True or false: If you use the character I/O functions to send
output to stdout, it always goes to the screen.
447
EXAMPLE
C+ + By
3. What is the difference between get ch( ) and get ( ) ?
4. What function sends formatted output to devices other than
the screen?
5. What are the MS-DOS redirection symbols?
6. What nonstandard function, most similar to get ch( ) , echoes
the input character to the screen as the user types it?
7. True or false: When using get ( ) , the program receives your
input as you type it.
8. Which keypress releases the buffered input to the program?
9. True or false: Using devices and functions described in this
chapter, it is possible to write one program that sends some
output to the screen, some to the printer, and some to the
modem.
Review Exerc ises
1. Write a program that asks the user for five letters and prints
them in reverse order to the screen, and then to the printer.
2. Write a miniature typewriter program, using get ( ) and put ( ) .
In a loop, get characters until the user presses Enter while he
or she is getting a line of user input. Write the line of user
input to the printer. Because get ( ) is buffered, nothing goes
to the printer until the user presses Enter at the end of each
line of text. (Use the string-building input function shown in
C21IN.CPP.)
3. Add a put ch( ) inside the first loop of C21CH1.CPP (this
chapters first get ( ) example program) so the characters are
echoed to the screen as the user types them.
4. A palindrome is a word or phrase spelled the same forwards
and backwards. Two example palindromes are
Madam, I mAdam
Gol f ? No si r , pr ef er pr i son f l og!
Chapter 21 o D evice and C haracter Input/O utput
448
Write a C++ program that asks the user for a phrase. Build
the input, a character at a time, using a character input
function such as get ( ) . Once you have the full string (store it
in a character array), determine whether the phrase is a
palindrome. You have to filter special characters (nonalpha-
betic), storing only alphabetic characters to a second charac-
ter array. You also must convert the characters to uppercase
as you store them. The first palindrome becomes:
MADAMI MADAM
Using one or more f or or whi l e loops, you can now test the
phrase to determine whether it is a palindrome. Print the
result of the test on the printer. Sample output should look
like:
Madam, I mAdam i s a pal i ndr ome.
Summary
You now should understand the generic methods C++ pro-
grams use for input and output. By writing to standard I/O devices,
C++ achieves portability. If you write a program for one computer,
it works on another. If C++ were to write directly to specific
hardware, programs would not work on every computer.
If you still want to use the formatted I/O functions, such as cout ,
you can do so. The of st r eam( ) function enables you to write format-
ted output to any device, including the printer.
The methods of character I/O might seem primitive, and they
are, but they give you the flexibility to build and create your own
input functions. One of the most often-used C++ functions, a string-
building character I/O function, was demonstrated in this chapter
(the C21IN.CPP program).
The next two chapters (Chapter 22, Character, String, and
Numeric Functions, and Chapter 23, Introducing Arrays) intro-
duce many character and string functions, including string I/O
functions. The string I/O functions build on the principles pre-
sented here. You will be surprised at the extensive character and
string manipulation functions available in the language as well.
449
EXAMPLE
C+ + By
22
Charac ter, String,
and Numeric
Func tions
C++ provides many built-in functions in addition to the cout , get ch( ) ,
and st r cpy( ) functions you have seen so far. These built-in functions
increase your productivity and save you programming time. You
dont have to write as much code because the built-in functions
perform many useful tasks for you.
This chapter introduces you to
o Character conversion functions
o Character and string testing functions
o String manipulation functions
o String I/O functions
o Mathematical, trigonometric, and logarithmic functions
o Random-number processing
Chapter 22 o C haracter, String, and N um eric Functions
450
Charac ter Func tions
This section explores many of the character functions available
in AT&T C++. Generally, you pass character arguments to the
functions, and the functions return values that you can store or print.
By using these functions, you off-load much of your work to C++
and allow it to perform the more tedious manipulations of character
and string data.
Charac ter Testing Func tions
Several functions test for certain characteristics of your charac-
ter data. You can determine whether your character data is alpha-
betic, digital, uppercase, lowercase, and much more. You must pass
a character variable or literal argument to the function (by placing
the argument in the function parentheses) when you call it. These
functions return a True or False result, so you can test their return
values inside an i f statement or a whi l e loop.
NOTE: All character functions presented in this section are
prototyped in the ctype.h header file. Be sure to include ctype.h
at the beginning of any programs that use them.
Alphabetic and Digital Testing
The following functions test for alphabetic conditions:
o i sal pha( c) : Returns True (nonzero) if c is an uppercase or
lowercase letter. Returns False (zero) if c is not a letter.
o i sl ower ( c) : Returns True (nonzero) if c is a lowercase letter.
Returns False (zero) if c is not a lowercase letter.
o i supper ( c) : Returns True (nonzero) if c is an uppercase letter.
Returns False (zero) if c is not an uppercase letter.
The character
functi ons return True
or Fal se resul ts
based on the
characters you pass
to them.
451
EXAMPLE
C+ + By
Remember that any nonzero value is True in C++, and zero is
always False. If you use the return values of these functions in a
relational test, the True return value is not always 1 (it can be any
nonzero value), but it is always considered True for the test.
The following functions test for digits:
o i sdi gi t ( c) : Returns True (nonzero) if c is a digit 0 through 9.
Returns False (zero) if c is not a digit.
o i sxdi gi t ( c) : Returns True (nonzero) if c is any of the hexa-
decimal digits 0 through 9 or A, B, C, D, E, F, a, b, c, d, e, or f.
Returns False (zero) if c is anything else. (See Appendix A,
Memory Addressing, Binary, and Hexadecimal Review,
for more information on the hexadecimal numbering
system.)
NOTE: Although some character functions test for digits, the
arguments are still character data and cannot be used in math-
ematical calculations, unless you calculate using the ASCII
values of characters.
The following function tests for numeric or alphabetical argu-
ments:
i sal num( c) : Returns True (nonzero) if c is a digit 0 through 9
or an alphabetic character (either uppercase or lowercase).
Returns False (zero) if c is not a digit or a letter.
CAUTION: You can pass to these functions only a character
value or an integer value holding the ASCII value of a charac-
ter. You cannot pass an entire character array to character
functions. If you want to test the elements of a character array,
you must pass the array one element at a time.
Chapter 22 o C haracter, String, and N um eric Functions
452
Example
The following program asks users for their initials. If a user
types anything but alphabetic characters, the program displays an
error and asks again.
Identify the program and include the input/output header files. The
program asks the user for his or her first initial, so declare the character
variable i ni t i al to hold the users answer.
1. Ask the user for her or his first initial, and retrieve the users answer.
2. If the answer was not an alphabetic character, tell the user this and
repeat step one.
Print a thank-you message on-screen.
/ / Fi l ename: C22I NI . CPP
/ / Asks f or f i r st i ni t i al and t est s
/ / t o ensur e t hat r esponse i s cor r ect .
#i ncl ude <i ost r eam. h>
#i ncl ude <ct ype. h>
voi d mai n( )
{
char i ni t i al ;
cout << What i s your f i r st i ni t i al ? ;
ci n >> i ni t i al ;
whi l e ( ! i sal pha( i ni t i al ) )
{
cout << \ nThat was not a val i d i ni t i al ! \ n;
cout << \ nWhat i s your f i r st i ni t i al ? ;
ci n >> i ni t i al ;
}
cout << \ nThanks! ;
r et ur n;
}
This use of the not operator (! ) is quite clear. The program
continues to loop as long as the entered character is not alphabetic.
453
EXAMPLE
C+ + By
Spec ial Charac ter-Testing
Func tions
A few character functions become useful when you have to
read from a disk file, a modem, or another operating system device
that you route input from. These functions are not used as much as
the character functions you saw in the previous section, but they are
useful for testing specific characters for readability.
The remaining character-testing functions follow:
o i scnt r l ( c) : Returns True (nonzero) if c is a control character
(any character from the ASCII table numbered 0 through 31).
Returns False (zero) if c is not a control character.
o i sgr aph( c) : Returns True (nonzero) if c is any printable
character (a noncontrol character) except a space. Returns
False (zero) if c is a space or anything other than a printable
character.
o i spr i nt ( c) : Returns True (nonzero) if c is a printable charac-
ter (a noncontrol character) from ASCII 32 to ASCII 127,
including a space. Returns False (zero) if c is not a printable
character.
o i spunct ( c) : Returns True (nonzero) if c is any punctuation
character (any printable character other than a space, a letter,
or a digit). Returns False (zero) if c is not a punctuation
character.
o i sspace( c) : Returns True (nonzero) if c is a space, newline
(\ n), carriage return (\ r ), tab (\ t ), or vertical tab (\ v) charac-
ter. Returns False (zero) if c is anything else.
Charac ter Conversion Func tions
The two remaining character functions are handy. Rather than
test characters, these functions change characters to their lower- or
uppercase equivalents.
The character- testi ng
functi ons do not
change characters.
Both t ol ower ( )
and t oupper ( )
return l owercase
or uppercase
arguments.
Chapter 22 o C haracter, String, and N um eric Functions
454
o t ol ower ( c) : Converts c to lowercase. Nothing changes if you
pass t ol ower ( ) a lowercase letter or a nonalphabetic character.
o t oupper ( c) : Converts c to uppercase. Nothing changes if you
pass t oupper ( ) an uppercase letter or a nonalphabetic character.
These functions return their changed character values. These
functions are useful for user input. Suppose you are asking users a
yes or no question, such as the following:
Do you want t o pr i nt t he checks ( Y/ N) ?
Before t oupper ( ) and t ol ower ( ) were developed, you had to
check for both a Y and a y to print the checks. Instead of testing for
both conditions, you can convert the character to uppercase, and test
for a Y.
Example
Here is a program that prints an appropriate message if the user
is a girl or a boy. The program tests for G and B after converting the
users input to uppercase. No check for lowercase has to be done.
Identify the program and include the input/output header files. The
program asks the user a question requiring an alphabetic answer, so declare
the character variable ans to hold the users response.
Ask whether the user is a girl or a boy, and store the users answer in ans.
The user must press Enter, so incorporate and then discard the Enter
keypress. Change the value of ans to uppercase. If the answer is G, print a
message. If the answer is B, print a different message. If the answer is
something else, print another message.
/ / Fi l ename: C22GB. CPP
/ / Det er mi nes whet her t he user t yped a G or a B.
#i ncl ude <i ost r eam. h>
#i ncl ude <coni o. h>
#i ncl ude <ct ype. h>
voi d mai n( )
{
455
EXAMPLE
C+ + By
char ans; / / Hol ds user s r esponse.
cout << Ar e you a gi r l or a boy ( G/ B) ? ;
ans=get ch( ) ; / / Get answer .
get ch( ) ; / / Di scar d newl i ne.
cout <<ans<<\ n;
ans = t oupper ( ans) ; / / Conver t answer t o upper case.
swi t ch ( ans)
{ case ( G ) : { cout << You l ook pr et t y t oday! \ n;
br eak; }
case ( B ) : { cout << You l ook handsome t oday! \ n;
br eak; }
def aul t : { cout << Your answer makes no sense! \ n;
br eak; }
}
r et ur n;
}
Here is the output from the program:
Ar e you a gi r l or a boy ( G/ B) ? B
You l ook handsome t oday!
String Func tions
Some of the most powerful built-in C++ functions are the string
functions. They perform much of the tedious work for which you
have been writing code so far, such as inputting strings from the
keyboard and comparing strings.
As with the character functions, there is no need to reinvent
the wheel by writing code when built-in functions do the same task.
Use these functions as much as possible.
Now that you have a good grasp of the foundations of C++, you
can master the string functions. They enable you to concentrate on
your programs primary purpose, rather than spend time coding
your own string functions.
Chapter 22 o C haracter, String, and N um eric Functions
456
Useful String Func tions
You can use a handful of useful string functions for string
testing and conversion. You have already seen (in earlier chapters)
the st r cpy( ) string function, which copies a string of characters to a
character array.
NOTE: All string functions in this section are prototyped in
the string.h header file. Be sure to include string.h at the
beginning of any program that uses the string functions.
String functions that test or manipulate strings follow:
o st r cat ( s1, s2) : Concatenates (merges) the s2 string to the end
of the s1 character array. The s1 array must have enough
reserved elements to hold both strings.
o st r cmp( s1, s2) : Compares the s1 string with the s2 string on
an alphabetical, element-by-element basis. If s1 alphabetizes
before s2, st r cmp( ) returns a negative value. If s1 and s2 are
the same strings, st r cmp( ) returns 0. If s1 alphabetizes after
s2, st r cmp( ) returns a positive value.
o st r l en( s1) : Returns the length of s1. Remember, the length of
a string is the number of characters, not including the null
zero. The number of characters defined for the character
array has nothing to do with the length of the string.
TIP: Before using st r cat ( ) to concatenate strings, use st r l en( )
to ensure that the target string (the string being concatenated
to) is large enough to hold both strings.
String I/O Func tions
In the previous few chapters, you have used a character input
function, ci n. get ( ) , to build input strings. Now you can begin to use
the string input and output functions. Although the goal of the
The stri ng functi ons
work on stri ng
l i teral s or on
character arrays that
contai n stri ngs.
457
EXAMPLE
C+ + By
string-building functions has been to teach you the specifics of the
language, these string I/O functions are much easier to use than
writing a character input function.
The string input and output functions are listed as follows:
o get s( s) : Stores input from st di n (usually directed to the
keyboard) to the string named s.
o put s( s) : Outputs the s string to st dout (usually directed to the
screen by the operating system).
o f get s( s, l en, dev) : Stores input from the standard device
specified by dev (such as st di n or st daux) in the s string. If
more than l en characters are input, f get s( ) discards them.
o f put s( s, dev) : Outputs the s string to the standard device
specified by dev.
These four functions make the input and output of strings easy.
They work in pairs. That is, strings input with get s( ) are usually
output with put s( ) . Strings input with f get s( ) are usually output
with f put s( ) .
TIP: get s( ) replaces the string-building input function you
saw in earlier chapters.
Terminate get s( ) or f get s( ) input by pressing Enter. Each of
these functions handles string-terminating characters in a slightly
different manner, as follows:
get s( ) A newline input becomes a null zero (\ 0).
put s( ) A null at the end of the string becomes a newline
character (\ n).
f get s( ) A newline input stays, and a null zero is added
after it.
f put s( ) The null zero is dropped, and a newline character
is not added.
Therefore, when you enter strings with get s( ) , C++ places a
string-terminating character in the string at the point where you
press Enter. This creates the input string. (Without the null zero, the
Both get s( ) and
put s( ) i nput and
output stri ngs.
Chapter 22 o C haracter, String, and N um eric Functions
458
input would not be a string.) When you output a string, the null
zero at the end of the string becomes a newline character. This is
preferred because a newline is at the end of a line of output and the
cursor begins automatically on the next line.
Because f get s( ) and f put s( ) can input and output strings from
devices such as disk files and telephone modems, it can be critical
that the incoming newline characters are retained for the datas
integrity. When outputting strings to these devices, you do not want
C++ inserting extra newline characters.
CAUTION: Neither get s( ) nor f get s( ) ensures that its input
strings are large enough to hold the incoming data. It is up to
you to make sure enough space is reserved in the character
array to hold the complete input.
One final function is worth noting, although it is not a string
function. It is the f f l ush( ) function, which flushes (empties) what-
ever standard device is listed in its parentheses. To flush the key-
board of all its input, you would code as follows:
f f l ush( st di n) ;
When you are doing string input and output, sometimes an
extra newline character appears in the keyboard buffer. A previous
answer to get s( ) or get c( ) might have an extra newline you forgot to
discard. When a program seems to ignore get s( ) , you might have to
insert f f l ush( st di n) before get s( ) .
Flushing the standard input device causes no harm, and using
it can clear the input stream so your next get s( ) works properly. You
can also flush standard output devices with f f l ush( ) to clear the
output stream of any characters you sent to it.
NOTE: The header file for f f l ush( ) is in stdio.h.
459
EXAMPLE
C+ + By
Example
The following program shows you how easy it is to use get s( )
and put s( ) . The program requests the name of a book from the user
using a single get s( ) function call, then prints the book title with
put s( ) .
Identify the program and include the input/output header files. The
program asks the user for the name of a book. Declare the character array
book with 30 elements to hold the users answer.
Ask the user for the books title, and store the users response in the book
array. Display the string stored in book to an output device, probably your
screen. Print a thank-you message.
/ / C22GPS1. CPP
/ / I nput s and out put s st r i ngs.
#i ncl ude <i ost r eam. h>
#i ncl ude <st di o. h>
#i ncl ude <st r i ng. h>
voi d mai n( )
{
char book[ 30] ;
cout << What i s t he book t i t l e? ;
get s( book) ; / / Get an i nput st r i ng.
put s( book) ; / / Di spl ay t he st r i ng.
cout << Thanks f or t he book! \ n;
r et ur n;
}
The output of the program follows:
What i s t he book t i t l e? Mar y and Her Lambs
Mar y and Her Lambs
Thanks f or t he book!
Chapter 22 o C haracter, String, and N um eric Functions
460
Converting Strings to Numbers
Sometimes you have to convert numbers stored in character
strings to a numeric data type. AT&T C++ provides three functions
that enable you to do this:
o at oi ( s) : Converts s to an integer. The name stands for alpha-
betic to integer.
o at ol ( s) : Converts s to a long integer. The name stands for
alphabetic to long integer.
o at of ( s) : Converts s to a floating-point number. The name
stands for alphabetic to floating-point.
NOTE: These three at o( ) functions are prototyped in the
stdlib.h header file. Be sure to include stdlib.h at the beginning of
any program that uses the at o( ) functions.
The string must contain a valid number. Here is a string that can
be converted to an integer:
1232
The string must hold a string of digits short enough to fit in the
target numeric data type. The following string could not be con-
verted to an integer with the at oi ( ) function:
- 1232495. 654
However, it could be converted to a floating-point number with the
at of ( ) function.
C++ cannot perform any mathematical calculation with such
strings, even if the strings contain digits that represent numbers.
Therefore, you must convert any string to its numeric equivalent
before performing arithmetic with it.
NOTE: If you pass a string to an at o( ) function and the string
does not contain a valid representation of a number, the at o( )
function returns 0.
461
EXAMPLE
C+ + By
These functions become more useful to you after you learn
about disk files and pointers.
Numeric Func tions
This section presents many of the built-in C++ numeric func-
tions. As with the string functions, these functions save you time by
converting and calculating numbers instead of your having to write
functions that do the same thing. Many of these are trigonometric
and advanced mathematical functions. You might use some of these
numeric functions only rarely, but they are there if you need them.
This section concludes the discussion of C++s standard built-
in functions. After mastering the concepts in this chapter, you are
ready to learn more about arrays and pointers. As you develop more
skills in C++, you might find yourself relying on these numeric,
string, and character functions when you write more powerful
programs.
Useful Mathematic al Func tions
Several built-in numeric functions return results based on
numeric variables and literals passed to them. Even if you write only
a few science and engineering programs, some of these functions are
useful.
NOTE: All mathematical and trigonometric functions are
prototyped in the math.h header file. Be sure to include math.h
at the beginning of any program that uses the numeric func-
tions.
Here are the functions listed with their descriptions:
o cei l ( x) : The cei l ( ) , or ceiling, function rounds numbers up to
the nearest integer.
o f abs( x) : Returns the absolute value of x. The absolute value
of a number is its positive equivalent.
These numeri c
functi ons return
doubl e- preci si on
val ues.
Chapter 22 o C haracter, String, and N um eric Functions
462
TIP: Absolute value is used for distances (which are always
positive), accuracy measurements, age differences, and other
calculations that require a positive result.
o f l oor ( x) : The f l oor ( ) function rounds numbers down to the
nearest integer.
o f mod( x, y) : The f mod( ) function returns the floating-point
remainder of (x/ y) with the same sign as x, and y cannot be
zero. Because the modulus operator (%) works only with
integers, this function is used to find the remainder of
floating-point number divisions.
o pow( x, y) : Returns x raised to the y power, or x
y
. If x is less
than or equal to zero, y must be an integer. If x equals zero,
y cannot be negative.
o sqr t ( x) : Returns the square root of x; x must be greater than
or equal to zero.
The nth Root
No function returns the nth root of a number, only the square
root. In other words, you cannot call a function that gives you
the 4th root of 65,536. (By the way, 16 is the 4th root of 65,536,
because 16 times 16 times 16 times 16 = 65,536.)
You can use a mathematical trick to simulate the nth root,
however. Because C++ enables you to raise a number to a
fractional powerwith the pow( ) functionyou can raise a
number to the nth root by raising it to the (1/n) power. For
example, to find the 4th root of 65,536, you could type this:
r oot = pow( 65536. 0, ( 1. 0/ 4. 0) ) ;
Note that the decimal point keeps the numbers in floating-
point format. If you leave them as integers, such as
r oot = pow( 65536, ( 1/ 4) ) ;
463
EXAMPLE
C+ + By
C++ produces incorrect results. The pow( ) function and most
other mathematical functions require floating-point values as
arguments.
To store the 7th root of 78,125 in a variable called r oot , for
example, you would type
r oot = pow( 78125. 0, ( 1. 0/ 7. 0) ) ;
This stores 5.0 in r oot because 5
7
equals 78,125.
Knowing how to compute the nth root is handy in scientific
programs and also in financial applications, such as time-
value-of-money problems.
Example
The following program uses the f abs( ) function to compute the
difference between two ages.
/ / Fi l ename: C22ABS. CPP
/ / Comput es t he di f f er ence bet ween t wo ages.
#i ncl ude <i ost r eam. h>
#i ncl ude <mat h. h>
voi d mai n( )
{
f l oat age1, age2, di f f ;
cout << \ nWhat i s t he f i r st chi l d s age? ;
ci n >> age1;
cout << What i s t he second chi l d s age? ;
ci n >> age2;
/ / Cal cul at es t he posi t i ve di f f er ence.
di f f = age1 - age2;
di f f = f abs( di f f ) ; / / Det er mi nes t he absol ut e val ue.
cout << \ nThey ar e << di f f << year s apar t . ;
r et ur n;
}
Chapter 22 o C haracter, String, and N um eric Functions
464
The output from this program follows. Due to f abs( ) , the order
of the ages doesnt matter. Without absolute value, this program
would produce a negative age difference if the first age was less than
the second. Because the ages are relatively small, floating-point
variables are used in this example. C++ automatically converts
floating-point arguments to double precision when passing them to
f abs( ) .
What i s t he f i r st chi l d s age? 10
What i s t he second chi l d s age? 12
They ar e 2 year s apar t .
Trigonometric Func tions
The following functions are available for trigonometric appli-
cations:
o cos( x) : Returns the cosine of the angle x, expressed in radians.
o si n( x) : Returns the sine of the angle x, expressed in radians.
o t an( x) : Returns the tangent of the angle x, expressed in radians.
These are probably the least-used functions. This is not to
belittle the work of scientific and mathematical programmers who
need them, however. Certainly, they are grateful that C++ supplies
these functions! Otherwise, programmers would have to write their
own functions to perform these three basic trigonometric calcula-
tions.
Most C++ compilers supply additional trigonometric func-
tions, including hyperbolic equivalents of these three functions.
TIP: If you have to pass an angle that is expressed in degrees
to these functions, convert the angles degrees to radians by
multiplying the degrees by /180.0 ( equals approximately
3.14159).
465
EXAMPLE
C+ + By
Logarithmic Func tions
Three highly mathematical functions are sometimes used in
business and mathematics. They are listed as follows:
o exp( x) : Returns the base of natural logarithm (e) raised to a
power specified by x (e
x
); e is the mathematical expression
for the approximate value of 2.718282.
o l og( x) : Returns the natural logarithm of the argument x,
mathematically written as l n( x) . x must be positive.
o l og10( x) : Returns the base-10 logarithm of argument x,
mathematically written as l og10( x) . x must be positive.
Random-Number Proc essing
Random events happen every day. You wake up and it is sunny
or rainy. You have a good day or a bad day. You get a phone call from
an old friend or you dont. Your stock portfolio might go up or down
in value.
Random events are especially important in games. Part of the
fun in games is your luck with rolling dice or drawing cards,
combined with your playing skills.
Simulating random events is an important task for computers.
Computers, however, are finite machines; given the same input,
they always produce the same output. This fact can create some
boring games!
The designers of C++ knew this computer setback and found a
way to overcome it. They wrote a random-number generating
function called r and( ) . You can use r and( ) to compute a dice roll or
draw a card, for example.
To call the r and( ) function and assign the returned random
number to test, use the following syntax:
t est = r and( ) ;
The r and( ) function returns an integer from 0 to 32,767. Never
use an argument in the r and( ) parentheses.
Every time you call r and( ) in the same program, you receive a
different number. If you run the same program over and over,
The r and( )
functi on produces
random i nteger
numbers.
Chapter 22 o C haracter, String, and N um eric Functions
466
however, r and( ) returns the same set of random numbers. One way
to receive a different set of random numbers is to call the sr and( )
function. The format of sr and( ) follows:
sr and( seed) ;
where seed is an integer variable or literal. If you dont call sr and( ) ,
C++ assumes a seed value of 1.
NOTE: The r and( ) and sr and( ) functions are prototyped in the
stdlib.h header file. Be sure to include stdlib.h at the beginning
of any program that uses r and( ) or sr and( ) .
The seed value reseeds, or resets, the random-number genera-
tor, so the next random number is based on the new seed value. If you
call sr and( ) with a different seed value at the top of a program, r and( )
returns a different random number each time you run the program.
Why Do You Have To Do This?
There is considerable debate among C++ programmers con-
cerning the random-number generator. Many think that the
random numbers should be truly random, and that they should
not have to seed the generator themselves. They think that C++
should do its own internal seeding when you ask for a random
number.
However, many applications would no longer work if the
random-number generator were randomized for you. Com-
puters are used in business, engineering, and research to
simulate the pattern of real-world events. Researchers have to
be able to duplicate these simulations, over and over. Even
though the events inside the simulations might be random
from each other, the running of the simulations cannot be
random if researchers are to study several different effects.
Mathematicians and statisticians also have to repeat random-
number patterns for their analyses, especially when they work
with risk, probability, and gaming theories.
467
EXAMPLE
C+ + By
Because so many computer users have to repeat their random-
number patterns, the designers of C++ have wisely chosen to
give you, the programmer, the option of keeping the same
random patterns or changing them. The advantages far out-
weigh the disadvantage of including an extra sr and( ) function
call.
If you want to produce a different set of random numbers every
time your program runs, you must determine how your C++
compiler reads the computers system clock. You can use the
seconds count from the clock to seed the random-number
generator so it seems truly random.
Review Questions
The answers to the review questions are in Appendix B.
1. How do the character testing functions differ from the
character conversion functions?
2. What are the two string input functions?
3. What is the difference between f l oor ( ) and cei l ( ) ?
4. What does the following nested function return?
i sal pha( i sl ower ( s ) ) ;
5. If the character array st r 1 contains the string Pet er and the
character array st r 2 contains Par ker , what does st r 2 contain
after the following line of code executes?
st r cat ( st r 1, st r 2) ;
6. What is the output of the following cout ?
cout << f l oor ( 8. 5) << << cei l ( 8. 5) ;
7. True or false: The i sxdi gi t ( ) and i sgr aph( ) functions could
return the same value, depending on the character passed to
them.
Chapter 22 o C haracter, String, and N um eric Functions
468
8. Assume you declare a character array with the following
statement:
char ar a[ 5] ;
Now suppose the user types Pr ogr ammi ng in response to the
following statement:
f get s( ar a, 5, st di n) ;
Would ar a contain Pr og, Pr ogr , or Pr ogr ammi ng?
9. True or false: The following statements print the same
results.
cout << pow( 64. 0, ( 1. 0/ 2. 0) ) ;
cout << sqr t ( 64. 0) ;
Review Exerc ises
1. Write a program that asks users for their ages. If a user types
anything other than two digits, display an error message.
2. Write a program that stores a password in a character array
called pass. Ask users for the password. Use st r cmp( ) to
inform users whether they typed the proper password. Use
the string I/O functions for all the programs input and
output.
3. Write a program that rounds up and rounds down the
numbers 10.5, 5.75, and 2.75.
4. Ask users for their names. Print every name in reverse case;
print the first letter of each name in lowercase and the rest of
the name in uppercase.
5. Write a program that asks users for five movie titles. Print
the longest title. Use only the string I/O and manipulation
functions presented in this chapter.
6. Write a program that computes the square root, cube root,
and fourth root of the numbers from 10 to 25, inclusive.
469
EXAMPLE
C+ + By
7. Ask users for the titles of their favorite songs. Discard all the
special characters in each title. Print the words in the title,
one per line. For example, if they enter My Tr ue Love I s Mi ne,
Oh, Mi ne! , you should output the following:
My
Tr ue
Love
I s
Mi ne
Oh
Mi ne
8. Ask users for the first names of 10 children. Using st r cmp( )
on each name, write a program to print the name that comes
first in the alphabet.
Summary
You have learned the character, string, and numeric functions
that C++ provides. By including the ctype.h header file, you can test
and convert characters that a user types. These functions have many
useful purposes, such as converting a users response to uppercase.
This makes it easier for you to test user input.
The string I/O functions give you more control over both string
and numeric input. You can receive a string of digits from the
keyboard and convert them to a number with the at o( ) functions.
The string comparison and concatenation functions enable you to
test and change the contents of more than one string.
Functions save you programming time because they take over
some of your computing tasks, leaving you free to concentrate on
your programs. C++s numeric functions round and manipulate
numbers, produce trigonometric and logarithmic results, and pro-
duce random numbers.
Now that you have learned most of C++s built-in functions,
you are ready to improve your ability to work with arrays. Chap-
ter 23, Introducing Arrays, extends your knowledge of character
arrays and shows you how to produce arrays of any data type.
Chapter 22 o C haracter, String, and N um eric Functions
470
Part VI
Arrays and Pointers
473
EXAMPLE
C+ + By
23
Introduc ing Arrays
This chapter discusses different types of arrays. You are already
familiar with character arrays, which are the only method for storing
character strings in the C++ language. A character array isnt the
only kind of array you can use, however. There is an array for every
data type in C++. By learning how to process arrays, you greatly
improve the power and efficiency of your programs.
This chapter introduces
o Array basics of names, data types, and subscripts
o Initializing an array at declaration time
o Initializing an array during program execution
o Selecting elements from arrays
The sample programs in these next few chapters are the most
advanced that you have seen in this book. Arrays are not difficult to
use, but their power makes them well-suited to more advanced
programming.
Chapter 23 o Introducing Arrays
474
Array Basic s
Although you have seen arrays used as character strings, you
still must have a review of arrays in general. An array is a list of more
than one variable having the same name. Not all lists of variables are
arrays. The following list of four variables, for example, does not
qualify as an array.
sal es bonus_92 f i r st _i ni t i al ct r
This is a list of variables (four of them), but it isnt an array
because each variable has a different name. You might wonder how
more than one variable can have the same name; this seems to violate
the rules for variables. If two variables have the same name, how can
C++ determine which you are referring to when you use that name?
Array variables, or array elements, are differentiated by a
subscript, which is a number inside brackets. Suppose you want to
store a persons name in a character array called name. You can do
this with
char name[ ] = Ray Kr ebbs;
or
char name[ 11] = Ray Kr ebbs;
Because C++ reserves an extra element for the null zero at the
end of every string, you dont have to specify the 11 as long as you
initialize the array with a value. The variable name is an array because
brackets follow its name. The array has a single name, name, and it
contains 11 elements. The array is stored in memory, as shown in
Figure 23.1. Each element is a character.
NOTE: All array subscripts begin with 0.
You can manipulate individual elements in the array by refer-
encing their subscripts. For instance, the following cout prints Rays
initials.
Print the first and fifth elements of the array called name.
cout << name[ 0] << << name[ 4] ;
An array i s a l i st of
more than one
vari abl e havi ng the
same name.
475
EXAMPLE
C+ + By
Figure 23.1. Storing the name character array in memory.
You can define an array as any data type in C++. You can have
integer arrays, long integer arrays, double floating-point arrays,
short integer arrays, and so on. C++ recognizes that the brackets [ ]
following the array name signify that you are defining an array, and
not a single nonarray variable.
The following line defines an array called ages, consisting of
five integers:
i nt ages[ 5] ;
The first element in the ages array is ages[ 0] . The second element
is ages[ 1] , and the last one is ages[ 4] . This declaration of ages does not
assign values to the elements, so you dont know what is in ages and
your program does not automatically zero ages for you.
Here are some more array definitions:
i nt wei ght s[ 25] , si zes[ 100] ; / / Decl ar e t wo i nt eger ar r ays.
f l oat sal ar i es[ 8] ; / / Decl ar e a f l oat i ng- poi nt ar r ay.
doubl e t emps[ 50] ; / / Decl ar e a doubl e f l oat i ng- poi nt
/ / ar r ay.
char l et t er s[ 15] ; / / Decl ar e an ar r ay of char act er s.
When you declare an array, you instruct C++ to reserve a
specific number of memory locations for that array. C++ protects
Chapter 23 o Introducing Arrays
476
those elements. In the previous lines of code, if you assign a value to
l et t er s[ 2] you dont overwrite any data in wei ght s, si zes, sal ar i es, or
t emps. Also, if you assign a value to si zes[ 94] , you dont overwrite
data stored in wei ght s, sal ar i es, t emps, or l et t er s.
Each element in an array occupies the same amount of storage
as a nonarray variable of the same data type. In other words, each
element in a character array occupies one byte. Each element in an
integer array occupies two or more bytes of memorydepending
on the computers internal architecture. The same is true for every
other data type.
Your program can reference elements by using formulas for
subscripts. As long as the subscript can evaluate to an integer, you
can use a literal, a variable, or an expression for the subscript. All the
following are references to individual array elements:
ar a[ 4]
sal es[ ct r +1]
bonus[ mont h]
sal ar y[ mont h[ i ] *2]
All array elements are stored in a contiguous, back-to-back
fashion. This is important to remember, especially as you write more
advanced programs. You can always count on an arrays first
element preceding the second. The second element is always placed
immediately before the third, and so on. Memory is not padded;
meaning that C++ guarantees there is no extra space between array
elements. This is true for character arrays, integer arrays, floating-
point arrays, and every other type of array. If a floating-point value
occupies four bytes of memory on your computer, the next element
in a floating-point array always begins exactly four bytes after the
previous element.
The Size of Arrays
The si zeof ( ) function returns the number of bytes needed to
hold its argument. If you request the size of an array name,
si zeof ( ) returns the number of bytes reserved for the entire
array.
Array el ements
fol l ow each other i n
memory, wi th
nothi ng between
them.
477
EXAMPLE
C+ + By
For example, suppose you declare an integer array of 100
elements called scor es. If you were to find the size of the array,
as in the following,
n = si zeof ( scor es) ;
n holds either 200 or 400 bytes, depending on the integer size of
your computer. The si zeof ( ) function always returns the re-
served amount of storage, no matter what data are in the array.
Therefore, a character arrays contentseven if it holds a very
short stringdo not affect the size of the array that was
originally reserved in memory. If you request the size of an
individual array element, however, as in the following,
n = si zeof ( scor es[ 6] ) ;
n holds either 2 or 4 bytes, depending on the integer size of your
computer.
You must never go out-of-bounds of any array. For example,
suppose you want to keep track of the exemptions and salary codes
of five employees. You can reserve two arrays to hold such data, like
this:
i nt exempt i ons[ 5] ; / / Hol ds up t o f i ve empl oyee exempt i ons.
char sal _codes[ 5] ; / / Hol ds up t o f i ve empl oyee codes.
Figure 23.2 shows how C++ reserves memory for these arrays.
The figure assumes a two-byte integer size, although this might
differ on some computers. Notice that C++ reserves five elements
for exempt i ons from the array declaration. C++ starts reserving
memory for sal _codes after it reserves all five elements for exempt i ons.
If you declare several more variableseither locally or globally
after these two lines, C++ always protects these reserved five
elements for exempt i ons and sal _codes.
Because C++ does its part to protect data in the array, so must
you. If you reserve five elements for exempt i ons, you have five inte-
ger array elements referred to as exempt i ons[ 0] , exempt i ons[ 1] ,
exempt i ons[ 2] , exempt i ons[ 3] , and exempt i ons[ 4] . C++ does not protect
C++ protects onl y as
many array el ements
as you speci fy.
Chapter 23 o Introducing Arrays
478
more than five elements for exempt i ons! Suppose you put a value in
an exempt i ons element you did not reserve:
exempt i ons[ 6] = 4; / / Assi gn a val ue t o an
/ / out - of - r ange el ement .
Figure 23.2. Locating two arrays in memory.
C++ enables you to do thisbut the results are damaging! C++
overwrites other data (in this case, sal _codes[ 2] and sal _codes[ 3]
because they are reserved in the location of the seventh element of
exempt i ons). Figure 23.3 shows the damaging results of assigning a
value to an out-of-range element.
Figure 23.3. The arrays in memory after overwriting part of sal _codes.
Although you can define an array of any data type, you cannot
declare an array of strings. A string is not a C++ variable data type.
You learn how to hold multiple strings in an array-like structure in
Chapter 27, Pointers and Arrays.
479
EXAMPLE
C+ + By
CAUTION: Unlike most programming languages, AT&T
C++ enables you to assign values to out-of-range (nonreserved)
subscripts. You must be careful not to do this; otherwise, you
start overwriting your other data or code.
Initializing Arrays
You must assign values to array elements before using them.
Here are the two ways to initialize elements in an array:
o Initialize the elements at declaration time
o Initialize the elements in the program
NOTE: C++ automatically initializes global arrays to null
zeros. Therefore, global character array elements are null, and
all numeric array elements contain zero. You should limit your
use of global arrays. If you use global arrays, explicitly initialize
them to zero, even though C++ does this for you, to clarify your
intentions.
Initializing Elements
at Dec laration Time
You already know how to initialize character arrays that hold
strings when you define the arrays: You simply assign them a string.
For example, the following declaration reserves six elements in a
character array called ci t y:
char ci t y[ 6] ; / / Reser ve space f or ci t y.
If you want also to initialize ci t y with a value, you can do it like
this:
char ci t y[ 6] = Tul sa; / / Reser ve space and
/ / i ni t i al i ze ci t y.
Chapter 23 o Introducing Arrays
480
The 6 is optional because C++ counts the elements needed to
hold Tul sa, plus an extra element for the null zero at the end of the
quoted string.
You also can reserve a character array and initialize it a single
character at a timeby placing braces around the character data.
The following line of code declares an array called i ni t i al s and
initializes it with eight characters:
char i ni t i al s[ 8] = { Q , K , P , G , V , M , U , S };
The array i ni t i al s is not a string! Its data does not end in a null
zero. There is nothing wrong with defining an array of characters
such as this one, but you must remember that you cannot treat the
array as if it were a string. Do not use string functions with it, or
attempt to print the array with cout .
By using brackets, you can initialize any type of array. For
example, if you want to initialize an integer array that holds your
five childrens ages, you can do it with the following declaration:
i nt chi l d_ages[ 5] = {2, 5, 6, 8, 12}; / / Decl ar e and
/ / i ni t i al i ze ar r ay.
In another example, if you want to keep track of the previous
three years total sales, you can declare an array and initialize it at
the same time with the following:
doubl e sal es[ ] = {454323. 43, 122355. 32, 343324. 96};
As with character arrays, you do not have to state explicitly the
array size when you declare and initialize an array of any type. C++
determines, in this case, to reserve three double floating-point array
elements for sal es. Figure 23.4 shows the representation of chi l d_ages
and sal es in memory.
NOTE: You cannot initialize an array, using the assignment
operator and braces, after you declare it. You can initialize
arrays in this manner only when you declare them. If you want
to fill an array with data after you declare the array, you must
do so element-by-element or by using functions as described in
the next section.
481
EXAMPLE
C+ + By
Figure 23.4. In-memory representation of two different types of arrays.
Although C++ does not automatically initialize the array ele-
ments, if you initialize some but not all the elements when you
declare the array, C++ finishes the job for you by assigning the
remainder to zero.
TIP: To initialize every element of a large array to zero at the
same time, declare the entire array and initialize only its first
value to zero. C++ fills the rest of the array to zero.
For instance, suppose you have to reserve array storage for
profit figures of the three previous months as well as the three
months to follow. You must reserve six elements of storage, but you
know values for only the first three. You can initialize the array as
follows:
doubl e pr of i t [ 6] = {67654. 43, 46472. 34, 63451. 93};
Because you explicitly initialized three of the elements, C++
initializes the rest to zero. If you use cout to print the entire array,
one element per line, you receive:
67654. 43
46472. 34
63451. 93
00000. 00
00000. 00
00000. 00
C++ assi gns zero
nul l s to al l array
val ues that you do
not defi ne expl i ci tl y
at decl arati on ti me.
chi l dages
sal es
Floating-points
Integers
Chapter 23 o Introducing Arrays
482
CAUTION: Always declare an array with the maximum
number of subscripts, unless you initialize the array at the same
time. The following array declaration is illegal:
i nt count [ ] ; / / Bad ar r ay decl ar at i on!
C++ does not know how many elements to reserve for count , so
it reserves none. If you then assign values to count s nonreserved
elements, you can (and probably will) overwrite other data.
The only time you can leave the brackets empty is if you also
assign values to the array, such as the following:
i nt count [ ] = {15, 9, 22, - 8, 12}; / / Good def i ni t i on.
C++ can determine, from the list of values, how many elements
to reserve. In this case, C++ reserves five elements for count .
Examples
1. Suppose you want to track the stock market averages for the
previous 90 days. Instead of storing them in 90 different
variables, it is much easier to store them in an array. You can
declare the array like this:
f l oat st ock[ 90] ;
The remainder of the program can assign values to the
averages.
2. Suppose you just finished taking classes at a local university
and want to average your six class scores. The following
program initializes one array for the school name and an-
other for the six classes. The body of the program averages
the six scores.
/ / Fi l ename: C23ARA1. CPP
/ / Aver ages si x t est scor es.
#i ncl ude <i ost r eam. h>
#i ncl ude <i omani p. h>
voi d mai n( )
483
EXAMPLE
C+ + By
{
char s_name[ ] = Tr i St ar Uni ver si t y;
f l oat scor es[ 6] = {88. 7, 90. 4, 76. 0, 97. 0, 100. 0, 86. 7};
f l oat aver age=0. 0;
i nt ct r ;
/ / Comput es t ot al of scor es.
f or ( ct r =0; ct r <6; ct r ++)
{ aver age += scor es[ ct r ] ; }
/ / Comput es t he aver age.
aver age / = f l oat ( 6) ;
cout << At << s_name << , your cl ass aver age i s
<< set pr eci si on( 2) << aver age << \ n;
r et ur n;
}
The output follows:
At Tr i St ar Uni ver si t y, your cl ass aver age i s 89. 8.
Notice that using arrays makes processing lists of informa-
tion much easier. Instead of averaging six differently named
variables, you can use a f or loop to step through each array
element. If you had to average 1000 numbers, you can still
do so with a simple f or loop, as in this example. If the 1000
variables were not in an array, but were individually named,
you would have to write a considerable amount of code just
to add them.
3. The following program is an expanded version of the previ-
ous one. It prints the six scores before computing the aver-
age. Notice that you must print array elements individually;
you cannot print an entire array in a single cout . (You can
print an entire character array with cout , but only if it holds a
null-terminated string of characters.)
/ / Fi l ename: C23ARA2. CPP
/ / Pr i nt s and aver ages si x t est scor es.
#i ncl ude <i ost r eam. h>
#i ncl ude <i omani p. h>
voi d pr _scor es( f l oat scor es[ ] ) ; / / Pr ot ot ype
Chapter 23 o Introducing Arrays
484
voi d mai n( )
{
char s_name[ ] = Tr i St ar Uni ver si t y;
f l oat scor es[ 6] = {88. 7, 90. 4, 76. 0, 97. 0, 100. 0, 86. 7};
f l oat aver age=0. 0;
i nt ct r ;
/ / Cal l f unct i on t o pr i nt scor es.
pr _scor es( scor es) ;
/ / Comput es t ot al of scor es.
f or ( ct r =0; ct r <6; ct r ++)
{ aver age += scor es[ ct r ] ; }
/ / Comput es t he aver age.
aver age / = f l oat ( 6) ;
cout << At << s_name << , your cl ass aver age i s
<< set pr eci si on( 2) << aver age;
r et ur n;
}
voi d pr _scor es( f l oat scor es[ 6] )
{
/ / Pr i nt s t he si x scor es.
i nt ct r ;
cout << Her e ar e your scor es: \ n; / / Ti t l e
f or ( ct r =0; ct r <6; ct r ++)
cout << set pr eci si on( 2) << scor es[ ct r ] << \ n;
r et ur n;
}
To pass an array to a function, you must specify its name
only. In the receiving functions parameter list, you must
state the array type and include its brackets, which tell the
function that it is an array. (You do not explicitly have to
state the array size in the receiving parameter list, as shown
in the prototype.)
485
EXAMPLE
C+ + By
4. To improve the maintainability of your programs, define all
array sizes with the const instruction. What if you took four
classes next semester but still wanted to use the same pro-
gram? You can modify it by changing all the 6s to 4s, but if
you had defined the array size with a constant, you have to
change only one line to change the programs subscript
limits. Notice how the following program uses a constant for
the number of classes.
/ / Fi l ename: C23ARA3. CPP
/ / Pr i nt s and aver ages si x t est scor es.
#i ncl ude <i ost r eam. h>
#i ncl ude <i omani p. h>
voi d pr _scor es( f l oat scor es[ ] ) ;
const i nt CLASS_NUM = 6; / / Const ant hol ds ar r ay si ze.
voi d mai n( )
{
char s_name[ ] = Tr i St ar Uni ver si t y;
f l oat scor es[ CLASS_NUM] = {88. 7, 90. 4, 76. 0, 97. 0,
100. 0, 86. 7};
f l oat aver age=0. 0;
i nt ct r ;
/ / Cal l s f unct i on t o pr i nt scor es.
pr _scor es( scor es) ;
/ / Comput es t ot al of scor es.
f or ( ct r =0; ct r <CLASS_NUM; ct r ++)
{ aver age += scor es[ ct r ] ; }
/ / Comput es t he aver age.
aver age / = f l oat ( CLASS_NUM) ;
cout << At << s_name << , your cl ass aver age i s
<< set pr eci si on( 2) << aver age;
r et ur n;
}
voi d pr _scor es( f l oat scor es[ CLASS_NUM] )
Chapter 23 o Introducing Arrays
486
{
/ / Pr i nt s t he si x scor es.
i nt ct r ;
cout << Her e ar e your scor es: \ n; / / Ti t l e
f or ( ct r =0; ct r <CLASS_NUM; ct r ++)
cout << set pr eci si on( 2) << scor es[ ct r ] << \ n;
r et ur n;
}
For such a simple example, using a constant for the maxi-
mum subscript might not seem like a big advantage. If you
were writing a larger program that processed several arrays,
however, changing the constant at the top of the program
would be much easier than searching the program for each
occurrence of that array reference.
Using constants for array sizes has the added advantage
of protecting you from going out of the subscript bounds.
You do not have to remember the subscript when looping
through arrays; you can use the constant instead.
Initializing Elements in the
Program
Rarely do you know the contents of arrays when you declare
them. Usually, you fill an array with user input or a disk files data.
The f or loop is a perfect tool for looping through arrays when you fill
them with values.
CAUTION: An array name cannot appear on the left side of
an assignment statement.
You cannot assign one array to another. Suppose you want to
copy an array called t ot al _sal es to a second array called saved_sal es.
You cannot do so with the following assignment statement:
saved_sal es = t ot al _sal es; / / I nval i d!
487
EXAMPLE
C+ + By
Rather, you have to copy the arrays one element at a time, using
a loop, such as the following section of code does:
You want to copy one array to another. You have to do so one element at a
time, so you need a counter. Initialize a variable called ct r to 0; the value of
ct r represents a position in the array.
1. Assign the element that occupies the position in the first array
represented by the value of ct r to the same position in the second
array.
2. If the counter is less than the size of the array, add one to the
counter. Repeat step one.
f or ( ct r =0; ct r <ARRAY_SI ZE; ct r ++)
{ saved_sal es[ ct r ] = t ot al _sal es[ ct r ] ; }
The following examples illustrate methods for initializing ar-
rays in a program. After learning about disk processing later in the
book, you learn to read array values from a disk file.
Examples
1. The following program uses the assignment operator to
assign 10 temperatures to an array.
/ / Fi l ename: C23ARA4. CPP
/ / Fi l l s an ar r ay wi t h 10 t emper at ur e val ues.
#i ncl ude <i ost r eam. h>
#i ncl ude <i omani p. h>
const i nt NUM_TEMPS = 10;
voi d mai n( )
{
f l oat t emps[ NUM_TEMPS] ;
i nt ct r ;
t emps[ 0] = 78. 6; / / Subscr i pt s al ways begi n at 0.
t emps[ 1] = 82. 1;
t emps[ 2] = 79. 5;
t emps[ 3] = 75. 0;
t emps[ 4] = 75. 4;
Chapter 23 o Introducing Arrays
488
t emps[ 5] = 71. 8;
t emps[ 6] = 73. 3;
t emps[ 7] = 69. 5;
t emps[ 8] = 74. 1;
t emps[ 9] = 75. 7;
/ / Pr i nt t he t emps.
cout << Dai l y t emper at ur es f or t he l ast <<
NUM_TEMPS << days: \ n;
f or ( ct r =0; ct r <NUM_TEMPS; ct r ++)
{ cout << set pr eci si on( 1) << t emps[ ct r ] << \ n; }
r et ur n;
}
2. The following program uses a f or loop and ci n to assign
eight integers entered individually by the user. The program
then prints a total of the numbers.
/ / Fi l ename: C23TOT. CPP
/ / Tot al s ei ght i nput val ues f r omt he user .
#i ncl ude <i ost r eam. h>
const i nt NUM = 8;
voi d mai n( )
{
i nt nums[ NUM] ;
i nt t ot al = 0; / / Hol ds t ot al of user s ei ght number s.
i nt ct r ;
f or ( ct r =0; ct r <NUM; ct r ++)
{ cout << Pl ease ent er t he next number . . . ;
ci n >> nums[ ct r ] ;
t ot al += nums[ ct r ] ; }
cout << The t ot al of t he number s i s << t ot al << \ n;
r et ur n;
}
3. You dont have to access an array in the same order as you
initialized it. Chapter 24, Array Processing, shows you
how to change the order of an array. You also can use the
subscript to select items from an array of values.
489
EXAMPLE
C+ + By
The following program requests sales data for the preceding
12 months. Users can then type a month they want to see.
That months sales figure is then printed, without figures
from other months getting in the way. This is how you begin
to build a search program to find requested data: You store
the data in an array (or in a disk file that can be read into an
array, as you learn later), then wait for a users request to see
specific pieces of the data.
/ / Fi l ename: C23SAL. CPP
/ / St or es t wel ve mont hs of sal es and
/ / pr i nt s sel ect ed ones.
#i ncl ude <i ost r eam. h>
#i ncl ude <ct ype. h>
#i ncl ude <coni o. h>
#i ncl ude <i omani p. h>
const i nt NUM = 12;
voi d mai n( )
{
f l oat sal es[ NUM] ;
i nt ct r , ans;
i nt r eq_mont h; / / Hol ds user s r equest .
/ / Fi l l t he ar r ay.
cout << Pl ease ent er t he t wel ve mont hl y sal es val ues\ n;
f or ( ct r =0; ct r <NUM; ct r ++)
{ cout << What ar e sal es f or mont h number
<< ct r +1 << ? \ n;
ci n >> sal es[ ct r ] ; }
/ / Wai t f or a r equest ed mont h.
f or ( ct r =0; ct r <25; ct r ++)
{ cout << \ n; } / / Cl ear s t he scr een.
cout << *** Sal es Pr i nt i ng Pr ogr am***\ n;
cout << Pr i nt s any sal es f r omt he l ast << NUM
<< mont hs\ n\ n;
do
{ cout << For what mont h ( 1- << NUM << ) do you want
<< t o see a sal es val ue? ;
ci n >> r eq_mont h;
Chapter 23 o Introducing Arrays
490
/ / Adj ust f or zer o- based subscr i pt .
cout << \ nMont h << r eq_mont h <<
s sal es ar e << set pr eci si on( 2) <<
sal es[ r eq_mont h- 1] ;
cout << \ nDo you want t o see anot her ( Y/ N) ? ;
ans=get ch( ) ;
ans=t oupper ( ans) ;
} whi l e ( ans == Y ) ;
r et ur n;
}
Notice the helpful screen-clearing routine that prints 23
newline characters. This routine scrolls the screen until it is
blank. (Most compilers come with a better built-in screen-
clearing function, but the AT&T C++ standard does not offer
one because the compiler is too closely linked with specific
hardware.)
The following is the second screen from this program. After
the 12 sales values are entered in the array, any or all can be
requested, one at a time, simply by supplying the months
number (the number of the subscript).
*** Sal es Pr i nt i ng Pr ogr am***
Pr i nt s any sal es f r omt he l ast 12 mont hs
For what mont h ( 1- 12) do you want t o see a sal es val ue? 2
Mont h 2 s sal es ar e 433. 22
Do you want t o see anot her ( Y/ N) ?
For what mont h ( 1- 12) do you want t o see a sal es val ue? 5
Mont h 5 s sal es ar e 123. 45
Do you want t o see anot her ( Y/ N) ?
491
EXAMPLE
C+ + By
Review Questions
Answers to the review questions are in Appendix B.
1. True or false: A single array can hold several values of
different data types.
2. How do C++ programs tell one array element from another
if all elements have identical names?
3. Why must you initialize an array before using it?
4. Given the following definition of an array, called wei ght s,
what is the value of wei ght s[ 5] ?
i nt wei ght s[ 10] = {5, 2, 4};
5. If you pass an integer array to a function and change it, does
the array change also in the calling function? (Hint: Remem-
ber how character arrays are passed to functions.)
6. How does C++ initialize global array elements?
Review Exerc ises
1. Write a program to store the ages of six of your friends in a
single array. Store each of the six ages using the assignment
operator. Print the ages on-screen.
2. Modify the program in Exercise 1 to print the ages in reverse
order.
3. Write a simple data program to track a radio stations ratings
(1, 2, 3, 4, or 5) for the previous 18 months. Use ci n to initial-
ize the array with the ratings. Print the ratings on-screen
with an appropriate title.
4. Write a program to store the numbers from 1 to 100 in an
array of 100 integer elements. (Hint: The subscripts should
begin at 0 and end at 99.)
Chapter 23 o Introducing Arrays
492
5. Write a program a small business owner can use to track
customers. Assign each customer a number (starting at 0).
Whenever a customer purchases something, record the sale
in the element that matches the customers number (that is,
the next unused array element). When the store owner
signals the end of the day, print a report consisting of each
customer number with its matching sales, a total sales figure,
and an average sales figure per customer.
Summary
You now know how to declare and initialize arrays consisting
of various data types. You can initialize an array either when you
declare it or in the body of your program. Array elements are much
easier to process than other variables because each has a different
name.
C++ has powerful sorting and searching techniques that make
your programs even more serviceable. The next chapter introduces
these techniques and shows you still other ways to access array
elements.
493
EXAMPLE
C+ + By
24
Array Proc essing
C++ provides many ways to access arrays. If you have programmed
in other computer languages, you will find that some of C++s array
indexing techniques are unique. Arrays in the C++ language are
closely linked with pointers. Chapter 26, Pointers, describes the
many ways pointers and arrays interact. Because pointers are so
powerful, and because learning about arrays provides a good foun-
dation for learning about pointers, this chapter attempts to describe
in detail how to reference arrays.
This chapter discusses the different types of array processing.
You learn how to search an array for one or more values, find the
highest and lowest values in an array, and sort an array into
numerical or alphabetical order.
This chapter introduces the following concepts:
o Searching arrays
o Finding the highest and lowest values in arrays
o Sorting arrays
o Advanced subscripting with arrays
Many programmers see arrays as a turning point. Gaining an
understanding of array processing makes your programs more
accurate and allows for more powerful programming.
Chapter 24 o Array Processing
494
Searc hing Arrays
Arrays are one of the primary means by which data is stored in
C++ programs. Many types of programs lend themselves to process-
ing lists (arrays) of data, such as an employee payroll program, a
scientific research of several chemicals, or customer account pro-
cessing. As mentioned in the previous chapter, array data usually is
read from a disk file. Later chapters describe disk file processing. For
now, you should understand how to manipulate arrays so you see
the data exactly the way you want to see it.
Chapter 23, Introducing Arrays, showed how to print arrays
in the same order that you entered the data. This is sometimes done,
but it is not always the most appropriate method of looking at data.
For instance, suppose a high school used C++ programs for its
grade reports. Suppose also that the school wanted to see a list of the
top 10 grade-point averages. You could not print the first 10 grade-
point averages in the list of student averages because the top 10
GPAs might not (and probably will not) appear as the first 10 array
elements. Because the GPAs would not be in any sequence, the
program would have to sort the array into numeric order, from high
GPAs to low, or else search the array for the 10 highest GPAs.
You need a method for putting arrays in a specific order. This
is called sorting an array. When you sort an array, you put that array
in a specific order, such as in alphabetical or numerical order. A
dictionary is in sorted order, and so is a phone book.
When you reverse the order of a sort, it is called a descending
sort. For instance, if you wanted to look at a list of all employees in
descending salary order, the highest-paid employees would be
printed first.
Figure 24.1 shows a list of eight numbers in an array called
unsor t ed. The middle list of numbers is an ascending sorted version
of unsor t ed. The third list of numbers is a descending version of
unsor t ed.
Array el ements do
not al ways appear i n
the order i n whi ch
they are needed.
495
EXAMPLE
C+ + By
Figure 24.1. A list of unsorted numbers sorted into an ascending and a
descending order.
Before you learn to sort, it would be helpful to learn how to
search an array for a value. This is a preliminary step in learning to
sort. What if one of those students received a grade change? The
computer must be able to access that specific students grade to
change it (without affecting the others). As the next section shows,
programs can search for specific array elements.
NOTE: C++ provides a method for sorting and searching lists
of strings, but you will not understand how to do this until you
learn about pointers, starting in Chapter 26, Pointers. The
sorting and searching examples and algorithms presented in
this chapter demonstrate sorting and searching arrays of num-
bers. The same concepts will apply (and will actually be much
more usable for real-world applications) when you learn
how to store lists of names in C++.
Chapter 24 o Array Processing
496
Searc hing for Value s
You do not have to know any new commands to search an array
for a value. Basically, the i f and f or loop statements are all you need.
To search an array for a specific value, look at each element in that
array, and compare it to the i f statement to see whether they match.
If they do not, you keep searching down the array. If you run out of
array elements before finding the value, it is not in the array.
You can perform several different kinds of searches. You might
have to find the highest or the lowest value in a list of numbers. This
is informative when you have much data and want to know the
extremes of the data (such as the highest and lowest sales region in
your division). You also can search an array to see whether it
contains a matching value. For example, you can see whether an
item is already in an inventory by searching a part number array for
a match.
The following programs illustrate some of these array-
searching techniques.
Examples
1. To find the highest number in an array, compare each
element with the first one. If you find a higher value, it
becomes the basis for the rest of the array. Continue until
you reach the end of the array and you will have the highest
value, as the following program shows.
Identify the program and include the I/O header file. You want to
find the highest value in an array, so define the array size as a
constant, then initialize the array.
Loop through the array, comparing each element to the highest
value. If an element is higher than the highest value saved, store
the element as the new high value. Print the highest value found in
the array.
/ / Fi l ename: C24HI GH. CPP
/ / Fi nds t he hi ghest val ue i n t he ar r ay.
#i ncl ude <i ost r eam. h>
const i nt SI ZE = 15;
voi d mai n( )
You do not have to
sort an array to fi nd
i ts extreme val ues.
497
EXAMPLE
C+ + By
{
/ / Put s some number s i n t he ar r ay.
i nt ar a[ SI ZE] ={5, 2, 7, 8, 36, 4, 2, 86, 11, 43, 22, 12, 45, 6, 85};
i nt hi gh_val , ct r ;
hi gh_val = ar a[ 0] ; / / I ni t i al i zes wi t h f i r st
/ / ar r ay el ement .
f or ( ct r =1; ct r <SI ZE; ct r ++)
{ / / St or es cur r ent val ue i f i t i s
/ / t he hi gher t han t he hi ghest .
i f ( ar a[ ct r ] > hi gh_val )
{ hi gh_val = ar a[ ct r ] ; }
}
cout << The hi ghest number i n t he l i st i s
<< hi gh_val << \ n;
r et ur n;
}
The output of the program is the following:
The hi ghest number i n t he l i st i s 86.
You have to save the element if and only if it is higher than
the one you are comparing. Finding the smallest number in
an array is just as easy, except that you determine whether
each succeeding array element is less than the lowest value
found so far.
2. The following example expands on the previous one by
finding the highest and the lowest value. First, store the first
array element in both the highest and the lowest variable to
begin the search. This ensures that each element after that
one is tested to see whether it is higher or lower than the
first.
This example also uses the r and( ) function from Chapter 22,
Character, String, and Numeric Functions, to fill the array
with random values from 0 to 99 by applying the modulus
operator (%) and 100 against whatever value r and( ) produces.
The program prints the entire array before starting the
search for the highest and the lowest.
Chapter 24 o Array Processing
498
/ / Fi l ename: C24HI LO. CPP
/ / Fi nds t he hi ghest and t he l owest val ue i n t he ar r ay.
#i ncl ude <i ost r eam. h>
#i ncl ude <st dl i b. h>
const i nt SI ZE = 15;
voi d mai n( )
{
i nt ar a[ SI ZE] ;
i nt hi gh_val , l ow_val , ct r ;
/ / Fi l l s ar r ay wi t h r andomnumber s f r om0 t o 99.
f or ( ct r =0; ct r <SI ZE; ct r ++)
{ ar a[ ct r ] = r and( ) %100; }
/ / Pr i nt s t he ar r ay t o t he scr een.
cout << Her e ar e t he << SI ZE << r andomnumber s: \ n;
f or ( ct r =0; ct r <SI ZE; ct r ++)
{ cout << ar a[ ct r ] << \ n; }
cout << \ n\ n; / / Pr i nt s a bl ank l i ne.
hi gh_val = ar a[ 0] ; / / I ni t i al i zes f i r st el ement t o
/ / bot h hi gh and l ow.
l ow_val = ar a[ 0] ;
f or ( ct r =1; ct r <SI ZE; ct r ++)
{ / / St or es cur r ent val ue i f i t i s
/ / hi gher t han t he hi ghest .
i f ( ar a[ ct r ] > hi gh_val )
{ hi gh_val = ar a[ ct r ] ; }
i f ( ar a[ ct r ] < l ow_val )
{ l ow_val = ar a[ ct r ] ; }
}
cout << The hi ghest number i n t he l i st i s <<
hi gh_val << \ n;
cout << The l owest number i n t he l i st i s <<
l ow_val << \ n;
r et ur n;
}
499
EXAMPLE
C+ + By
Here is the output from this program:
Her e ar e t he 15 r andomnumber s:
46
30
82
90
56
17
95
15
48
26
4
58
71
79
92
The hi ghest number i n t he l i st i s 95
The l owest number i n t he l i st i s 4
3. The next program fills an array with part numbers from an
inventory. You must use your imagination, because the
inventory array normally would fill more of the array, be
initialized from a disk file, and be part of a larger set of
arrays that hold descriptions, quantities, costs, selling prices,
and so on. For this example, assignment statements initialize
the array. The important idea from this program is not the
array initialization, but the method for searching the array.
NOTE: If the newly entered part number is already on file, the
program tells the user. Otherwise, the part number is added to
the end of the array.
/ / Fi l ename: C24SERCH. CPP
/ / Sear ches a par t number ar r ay f or t he i nput val ue. I f
Chapter 24 o Array Processing
500
/ / t he ent er ed par t number i s not i n t he ar r ay, i t i s
/ / added. I f t he par t number i s i n t he ar r ay, a message
/ / i s pr i nt ed.
#i ncl ude <i ost r eam. h>
const i nt MAX = 100;
voi d f i l l _par t s( l ong i nt par t s[ MAX] ) ;
voi d mai n( )
{
l ong i nt sear ch_par t ; / / Hol ds user r equest .
l ong i nt par t s[ MAX] ;
i nt ct r ;
i nt num_par t s=5; / / Begi nni ng i nvent or y count .
f i l l _par t s( par t s) ; / / Fi l l s t he f i r st f i ve el ement s.
do
{
cout << \ n\ nPl ease t ype a par t number . . . ;
cout << ( - 9999 ends pr ogr am) ;
ci n >> sear ch_par t ;
i f ( sear ch_par t == - 9999)
{ br eak; } / / Exi t s l oop i f user want s.
/ / Scans ar r ay t o see whet her par t i s i n i nvent or y.
f or ( ct r =0; ct r <num_par t s; ct r ++) / / Checks each i t em.
{ i f ( sear ch_par t == par t s[ ct r ] ) / / I f i t i s i n
/ / i nvent or y. . .
{ cout << \ nPar t << sear ch_par t <<
i s al r eady i n i nvent or y;
br eak;
}
el se
{ i f ( ct r == ( num_par t s- 1) ) / / I f not t her e,
/ / adds i t .
{ par t s[ num_par t s] = sear ch_par t ; / / Adds t o
/ / end of ar r ay.
num_par t s++;
cout << sear ch_par t <<
was added t o i nvent or y\ n;
501
EXAMPLE
C+ + By
br eak;
}
}
}
} whi l e ( sear ch_par t ! = - 9999) ; / / Loops unt i l user
/ / si gnal s end.
r et ur n;
}
voi d f i l l _par t s( l ong i nt par t s[ MAX] )
{
/ / Assi gns f i ve par t number s t o ar r ay f or t est i ng.
par t s[ 0] = 12345;
par t s[ 1] = 24724;
par t s[ 2] = 54154;
par t s[ 3] = 73496;
par t s[ 4] = 83925;
r et ur n;
}
Here is the output from this program:
Pl ease t ype a par t number . . . ( - 9999 ends pr ogr am) 34234
34234 was added t o i nvent or y
Pl ease t ype a par t number . . . ( - 9999 ends pr ogr am) 83925
Par t 83925 i s al r eady i n i nvent or y
Pl ease t ype a par t number . . . ( - 9999 ends pr ogr am) 52786
52786 was added t o i nvent or y
Pl ease t ype a par t number . . . ( - 9999 ends pr ogr am) - 9999
Sorting Arrays
There are many times when you must sort one or more arrays.
Suppose you were to take a list of numbers, write each number on
a separate piece of paper, and throw all the pieces of paper into the
air. The steps you takeshuffling and changing the order of the
Chapter 24 o Array Processing
502
pieces of paper and trying to put them in orderare similar to what
your computer goes through to sort numbers or character data.
Because sorting arrays requires exchanging values of elements
back and forth, it helps if you first learn the technique for swapping
variables. Suppose you had two variables named scor e1 and scor e2.
What if you wanted to reverse their values (putting scor e2 into the
scor e1 variable, and vice versa)? You could not do this:
scor e1 = scor e2; / / Does not swap t he t wo val ues.
scor e2 = scor e1;
Why doesnt this work? In the first line, the value of scor e1 is
replaced with scor e2s value. When the first line finishes, both scor e1
and scor e2 contain the same value. Therefore, the second line cannot
work as desired.
To swap two variables, you have to use a third variable to hold
the intermediate result. (This is the only function of this third
variable.) For instance, to swap scor e1 and scor e2, use a third variable
(called hol d_scor e in this code), as in
hol d_scor e = scor e1; / / These t hr ee l i nes pr oper l y
scor e1 = scor e2; / / swap scor e1 and scor e2.
scor e2 = hol d_scor e;
This exchanges the values in the two variables.
There are several different ways to sort arrays. These methods
include the bubble sort, the quicksort, and the shell sort. The basic goal
of each method is to compare each array element to another array
element and swap them if the higher value is less than the other.
The theory behind these sorts is beyond the scope of this book,
however, the bubble sort is one of the easiest to understand. Values
in the array are compared to each other, a pair at a time, and
swapped if they are not in back-to-back order. The lowest value
eventually floats to the top of the array, like a bubble in a glass of
soda.
Figure 24.2 shows a list of numbers before, during, and after a
bubble sort. The bubble sort steps through the array and compares
pairs of numbers to determine whether they have to be swapped.
Several passes might have to be made through the array before it is
The l owest val ues i n
a l i st fl oat to the
top wi th the bubbl e
sort al gori thm.
503
EXAMPLE
C+ + By
finally sorted (no more passes are needed). Other types of sorts
improve on the bubble sort. The bubble sort procedure is easy to
program, but it is slower compared to many of the other methods.
Figure 24.2. Sorting a list of numbers using the bubble sort.
Chapter 24 o Array Processing
504
The following programs show the bubble sort in action.
Examples
1. The following program assigns 10 random numbers between
0 and 99 to an array, then sorts the array. A nested f or loop is
perfect for sorting numbers in the array (as shown in the
sor t _ar r ay( ) function). Nested f or loops provide a nice mech-
anism for working on pairs of values, swapping them if
needed. As the outside loop counts down the list, referenc-
ing each element, the inside loop compares each of the
remaining values to those array elements.
/ / Fi l ename: C24SORT1. CPP
/ / Sor t s and pr i nt s a l i st of number s.
const i nt MAX = 10;
#i ncl ude <i ost r eam. h>
#i ncl ude <st dl i b. h>
voi d f i l l _ar r ay( i nt ar a[ MAX] ) ;
voi d pr i nt _ar r ay( i nt ar a[ MAX] ) ;
voi d sor t _ar r ay( i nt ar a[ MAX] ) ;
voi d mai n( )
{
i nt ar a[ MAX] ;
f i l l _ar r ay( ar a) ; / / Put s r andomnumber s i n t he ar r ay.
cout << Her e ar e t he unsor t ed number s: \ n;
pr i nt _ar r ay( ar a) ; / / Pr i nt s t he unsor t ed ar r ay.
sor t _ar r ay( ar a) ; / / Sor t s t he ar r ay.
cout << \ n\ nHer e ar e t he sor t ed number s: \ n;
pr i nt _ar r ay( ar a) ; / / Pr i nt s t he newl y sor t ed ar r ay.
r et ur n;
}
voi d f i l l _ar r ay( i nt ar a[ MAX] )
{
505
EXAMPLE
C+ + By
/ / Put s r andomnumber s i n t he ar r ay.
i nt ct r ;
f or ( ct r =0; ct r <MAX; ct r ++)
{ ar a[ ct r ] = ( r and( ) %100) ; } / / For ces number t o
/ / 0- 99 r ange.
r et ur n;
}
voi d pr i nt _ar r ay( i nt ar a[ MAX] )
{
/ / Pr i nt s t he ar r ay.
i nt ct r ;
f or ( ct r =0; ct r <MAX; ct r ++)
{ cout << ar a[ ct r ] << \ n; }
r et ur n;
}
voi d sor t _ar r ay( i nt ar a[ MAX] )
{
/ / Sor t s t he ar r ay.
i nt t emp; / / Tempor ar y var i abl e t o swap wi t h
i nt ct r 1, ct r 2; / / Need t wo l oop count er s t o
/ / swap pai r s of number s.
f or ( ct r 1=0; ct r 1<( MAX- 1) ; ct r 1++)
{ f or ( ct r 2=( ct r 1+1) ; ct r 2<MAX; ct r 2++) / / Test pai r s.
{ i f ( ar a[ ct r 1] > ar a[ ct r 2] ) / / Swap i f t hi s
{ t emp = ar a[ ct r 1] ; / / pai r i s not i n or der .
ar a[ ct r 1] = ar a[ ct r 2] ;
ar a[ ct r 2] = t emp; / / Fl oat t he l owest
/ / t o t he hi ghest .
}
}
}
r et ur n;
}
The output from this program appears next. If any two ran-
domly generated numbers were the same, the bubble sort
would work properly, placing them next to each other in the
list.
Chapter 24 o Array Processing
506
Her e ar e t he unsor t ed number s:
46
30
82
90
56
17
95
15
48
26
Her e ar e t he sor t ed number s:
15
17
26
30
46
48
56
82
90
95
2. The following program is just like the previous one, except it
prints the list of numbers in descending order.
A descending sort is as easy to write as an ascending sort.
With the ascending sort (from low to high values), you
compare pairs of values, testing to see whether the first is
greater than the second. With a descending sort, you test to
see whether the first is less than the second one.
/ / Fi l ename: C24SORT2. CPP
/ / Sor t s and pr i nt s a l i st of number s i n r ever se
/ / and descendi ng or der .
const i nt MAX = 10;
#i ncl ude <i ost r eam. h>
#i ncl ude <st dl i b. h>
voi d f i l l _ar r ay( i nt ar a[ MAX] ) ;
To produce a
descendi ng sort, use
the l ess- than (<)
l ogi cal operator
when swappi ng array
el ements.
507
EXAMPLE
C+ + By
voi d pr i nt _ar r ay( i nt ar a[ MAX] ) ;
voi d sor t _ar r ay( i nt ar a[ MAX] ) ;
voi d mai n( )
{
i nt ar a[ MAX] ;
f i l l _ar r ay( ar a) ; / / Put s r andomnumber s i n t he ar r ay.
cout << Her e ar e t he unsor t ed number s: \ n;
pr i nt _ar r ay( ar a) ; / / Pr i nt s t he unsor t ed ar r ay.
sor t _ar r ay( ar a) ; / / Sor t s t he ar r ay.
cout << \ n\ nHer e ar e t he sor t ed number s: \ n;
pr i nt _ar r ay( ar a) ; / / Pr i nt s t he newl y sor t ed ar r ay.
r et ur n;
}
voi d f i l l _ar r ay( i nt ar a[ MAX] )
{
/ / Put s r andomnumber s i n t he ar r ay.
i nt ct r ;
f or ( ct r =0; ct r <MAX; ct r ++)
{ ar a[ ct r ] = ( r and( ) %100) ; } / / For ces number
/ / t o 0- 99 r ange.
r et ur n;
}
voi d pr i nt _ar r ay( i nt ar a[ MAX] )
{
/ / Pr i nt s t he ar r ay
i nt ct r ;
f or ( ct r =0; ct r <MAX; ct r ++)
{ cout << ar a[ ct r ] << \ n; }
r et ur n;
}
voi d sor t _ar r ay( i nt ar a[ MAX] )
{
/ / Sor t s t he ar r ay.
i nt t emp; / / Tempor ar y var i abl e t o swap wi t h.
Chapter 24 o Array Processing
508
i nt ct r 1, ct r 2; / / Need t wo l oop count er s
/ / t o swap pai r s of number s.
f or ( ct r 1=0; ct r 1<( MAX- 1) ; ct r 1++)
{ f or ( ct r 2=( ct r 1+1) ; ct r 2<MAX; ct r 2++) / / Test pai r s
/ / Not i ce t he di f f er ence i n descendi ng ( her e)
/ / and ascendi ng.
{ i f ( ar a[ ct r 1] < ar a[ ct r 2] ) / / Swap i f t hi s
{ t emp = ar a[ ct r 1] ; / / pai r i s not i n or der .
ar a[ ct r 1] = ar a[ ct r 2] ;
ar a[ ct r 2] = t emp; / / Fl oat t he l owest
/ / t o t he hi ghest .
}
}
}
r et ur n;
}
TIP: You can save the previous programs sort functions in two
separate files named sor t _ascend and sor t _descend. When you
must sort two different arrays, #i ncl ude these files inside your
own programs. Even better, compile each of these routines
separately and link the one you need to your program. (You
must check your compilers manual to learn how to do this.)
You can sort character arrays just as easily as you sort numeric
arrays. C++ uses the ASCII character set for its sorting comparisons.
If you look at the ASCII table in Appendix C, you will see that
numbers sort before letters and that uppercase letters sort before
lowercase letters.
Advanc ed Referenc ing
of Arrays
The array notation you have seen so far is common in computer
programming languages. Most languages use subscripts inside
brackets (or parentheses) to refer to individual array elements. For
instance, you know the following array references describe the first
509
EXAMPLE
C+ + By
and fifth element of the array called sal es (remember that the
starting subscript is always 0):
sal es[ 0]
sal es[ 4]
C++ provides another approach to referencing arrays. Even
though the title of this section includes the word advanced, this
array-referencing method is not difficult. It is very different, how-
ever, especially if you are familiar with another programming
languages approach.
There is nothing wrong with referring to array elements in the
manner you have seen so far, however, the second approach, unique
to C and C++, will be helpful when you learn about pointers in
upcoming chapters. Actually, C++ programmers who have pro-
grammed for several years rarely use the subscript notation you
have seen.
In C++, an arrays name is not just a label for you to use in
programs. To C++, the array name is the actual address where the
first element begins in memory. Suppose you define an array called
amount s with the following statement:
i nt amount s[ 6] = {4, 1, 3, 7, 9, 2};
Figure 24.3 shows how this array is stored in memory. The
figure shows the array beginning at address 405,332. (The actual
addresses of variables are determined by the computer when you
load and run your compiled program.) Notice that the name of the
array, amount s, is located somewhere in memory and contains the
address of amount s[ 0] , or 405,332.
You can refer to an array by its regular subscript notation, or by
modifying the address of the array. The following refer to the third
element of amount s:
amount s[ 3] and ( amount s + 3) [ 0]
Because C++ considers the array name to be an address in
memory that contains the location of the first array element, nothing
keeps you from using a different address as the starting address and
referencing from there. Taking this one step further, each of the
following also refers to the third element of amount s:
An array name i s
the address of the
starti ng el ement of
the array.
Chapter 24 o Array Processing
510
( amount s+0) [ 3] and ( amount s+2) [ 1] and ( amount s- 2) [ 5]
( 1+amount s) [ 2] and ( 3+amount s) [ 0] and ( amount s+1) [ 2]
You can print any of these array elements with cout .
Figure 24.3. The array name amount s holds the address of amount s[ 0] .
When you print strings inside character arrays, referencing the
arrays by their modified addresses is more useful than with integers.
Suppose you stored three strings in a single character array. You
could initialize this array with the following statement:
char names[ ] ={ T , e , d , \ 0' , E , v , a , \ 0' , S , a , m , \ 0' };
Figure 24.4 shows how this array might look in memory. The
array name, names, contains the address of the first element, names[ 0]
(the letter T).
511
EXAMPLE
C+ + By
CAUTION: The hierarchy table in Appendix D, C++ Prece-
dence Table, shows that array subscripts have precedence
over addition and subtraction. Therefore, you must enclose
array names in parentheses if you want to modify the name as
shown in these examples. The following are not equivalent:
( 2+amount s) [ 1] and 2+amount s[ 1]
The first example refers to amount s[ 3] (which is 7). The second
example takes the value of amount s[ 1] (which is 1 in this ex-
ample array) and adds 2 to it (resulting in a value of 3).
This second method of array referencing might seem like more
trouble than it is worth, but learning to reference arrays in this
fashion will make your transition to pointers much easier. An
array name is actually a pointer, because the array contains the
address of the first array element (it points to the start of the
array).
Figure 24.4. Storing more than one string in a single character array.
Chapter 24 o Array Processing
512
You have yet to see a character array that holds more than one
string, but C++ allows it. The problem with such an array is how
you reference, and especially how you print, the second and third
strings. If you were to print this array using cout :
cout << names;
C++ would print the following:
Ted
Because cout requires a starting address, you can print the three
strings with the following cout s:
cout << names; / / Pr i nt s Ted
cout << ( names+4) ; / / Pr i nt s Eva
cout << ( names+8) ; / / Pr i nt s Sam
To test your understanding, what do the following cout s print?
cout << ( names+1) ;
cout << ( names+6) ;
The first cout prints ed. The characters ed begin at ( names+1) and
the cout stops printing when it reaches the null zero. The second cout
prints a. Adding six to the address at names produces the address
where the a is located. The string is only one character long
because the null zero appears in the array immediately after the a.
To sum up character arrays, the following refer to individual
array elements (single characters):
names[ 2] and ( names+1) [ 1]
The following refer to addresses only, and as such, you can print the
full strings with cout :
names and ( names+4)
CAUTION: Never use the pr i nt f ( ) s %c control code to print an
address reference, even if that address contains a character.
Print strings by specifying an address with %s, and single
characters by specifying the character element with %c.
cout pri nts stri ngs
i n arrays starti ng at
the arrays address
and conti nui ng unti l
i t reaches the nul l
zero.
513
EXAMPLE
C+ + By
The following examples are a little different from most you
have seen. They do not perform real-world work, but were
designed as study examples for you to familiarize yourself with this
new method of array referencing. The next few chapters expand on
these methods.
Examples
1. The following program stores the numbers from 100 to 600
in an array, then prints elements using the new method of
array subscripting.
/ / Fi l ename: C24REF1. CPP
/ / Pr i nt el ement s of an i nt eger ar r ay i n di f f er ent ways.
#i ncl ude <i ost r eam. h>
voi d mai n( )
{
i nt num[ 6] = {100, 200, 300, 400, 500, 600};
cout << num[ 0] i s \ t << num[ 0] << \ n;
cout << ( num+0) [ 0] i s \ t << ( num+0) [ 0] << \ n;
cout << ( num- 2) [ 2] i s \ t << ( num- 2) [ 2] << \ n\ n;
cout << num[ 1] i s \ t << num[ 1] << \ n;
cout << ( num+1) [ 0] i s \ t << ( num+1) [ 0] << \ n\ n;
cout << num[ 5] i s \ t << num[ 5] << \ n;
cout << ( num+5) [ 0] i s \ t << ( num+5) [ 0] << \ n;
cout << ( num+2) [ 3] i s \ t << ( num+2) [ 3] << \ n\ n;
cout << ( 3+num) [ 1] i s \ t << ( 3+num) [ 1] << \ n;
cout << 3+num[ 1] i s \ t << 3+num[ 1] << \ n;
r et ur n;
}
Here is the output of this program:
num[ 0] i s 100
( num+0) [ 0] i s 100
( num- 2) [ 2] i s 100
Chapter 24 o Array Processing
514
num[ 1] i s 200
( num+1) [ 0] i s 200
num[ 5] i s 600
( num+5) [ 0] i s 600
( num+2) [ 3] i s 600
( 3+num) [ 1] i s 500
3+num[ 1] i s 203
2. The following program prints strings and characters from a
character array. The cout s all print properly.
/ / Fi l ename: C24REF2. CPP
/ / Pr i nt s el ement s and st r i ngs f r oman ar r ay.
#i ncl ude <i ost r eam. h>
voi d mai n( )
{
char names[ ] ={ T , e , d , \ 0' , E , v , a , \ 0' ,
S , a , m , \ 0' };
/ / Must use ext r a per cent ( %) t o pr i nt %s and %c.
cout << names << names << \ n;
cout << names+0 << names+0 << \ n;
cout << names+1 << names+1 << \ n;
cout << names+2 << names+2 << \ n;
cout << names+3 << names+3 << \ n;
cout << names+5 << names+5 << \ n;
cout << names+8 << names+8 << \ n\ n;
cout << ( names+0) [ 0] << ( names+0) [ 0] << \ n;
cout << ( names+0) [ 1] << ( names+0) [ 1] << \ n;
cout << ( names+0) [ 2] << ( names+0) [ 2] << \ n;
cout << ( names+0) [ 3] << ( names+0) [ 3] << \ n;
cout << ( names+0) [ 4] << ( names+0) [ 4] << \ n;
cout << ( names+0) [ 5] << ( names+0) [ 5] << \ n\ n;
cout << ( names+2) [ 0] << ( names+2) [ 0] << \ n;
cout << ( names+2) [ 1] << ( names+2) [ 1] << \ n;
cout << ( names+1) [ 4] << ( names+1) [ 4] << \ n\ n;
r et ur n;
}
515
EXAMPLE
C+ + By
Study the output shown below by comparing it to the pro-
gram. You will learn more about strings, characters, and
character array referencing from studying this one example
than from 20 pages of textual description.
names Ted
names+0 Ted
names+1 ed
names+2 d
names+3
names+5 va
names+8 Sam
( names+0) [ 0] T
( names+0) [ 1] e
( names+0) [ 2] d
( names+0) [ 3]
( names+0) [ 4] E
( names+0) [ 5] v
( names+2) [ 0] d
( names+2) [ 1]
( names+1) [ 4] v
Review Questions
The answers to the review questions are in Appendix B.
1. True or false: You must access an array in the same order
you initialized it.
2. Where did the bubble sort get its name?
3. Are the following values sorted in ascending or descending
order?
33 55 78 78 90 102 435 859
976 4092
4. How does C++ use the name of an array?
Chapter 24 o Array Processing
516
5. Given the following array definition:
char t eams[ ] = { E , a , g , l , e , s , \ 0' ,
R , a , m , s , \ 0' };
What is printed with each of these statements? (Answer
invalid if the cout is illegal.)
a. cout << t eams;
b. cout << t eams+7;
c. cout << ( t eams+3) ;
d. cout << t eams[ 0] ;
e. cout << ( t eams+0) [ 0] ;
f. cout << ( t eams+5) ;
Review Exerc ises
1. Write a program to store six of your friends ages in a single
array. Assign the ages in random order. Print the ages, from
low to high, on-screen.
2. Modify the program in Exercise 1 to print the ages in de-
scending order.
3. Using the new approach of subscripting arrays, rewrite the
programs in Exercises 1 and 2. Always put a 0 in the sub-
script brackets, modifying the address instead (use
( ages+3) [ 0] rather than ages[ 3] ).
4. Sometimes parallel arrays are used in programs that must
track more than one list of values that are related. For in-
stance, suppose you had to maintain an inventory, tracking
the integer part numbers, prices, and quantities of each item.
This would require three arrays: an integer part number
array, a floating-point price array, and an integer quantity
array. Each array would have the same number of elements
(the total number of parts in the inventory). Write a program
to maintain such an inventory, and reserve enough elements
517
EXAMPLE
C+ + By
for 100 parts in the inventory. Present the user with an input
screen. When the user enters a part number, search the part
number array. When you locate the position of the part,
print the corresponding price and quantity. If the part does
not exist, enable the user to add it to the inventory, along
with the matching price and quantity.
Summary
You are beginning to see the true power of programming
languages. Arrays give you the ability to search and sort lists of
values. Sorting and searching are what computers do best; comput-
ers can quickly scan through hundreds and even thousands of
values, looking for a match. Scanning through files of paper by hand,
looking for just the right number, takes much more time. By step-
ping through arrays, your program can quickly scan, print, sort, and
calculate a list of values. You now have the tools to sort lists of
numbers, as well as search for values in a list.
You will use the concepts learned here for sorting and search-
ing lists of character string data as well, when you learn a little more
about the way C++ manipulates strings and pointers. To help build
a solid foundation for this and more advanced material, you now
know how to reference array elements without using conventional
subscripts.
Now that you have mastered this chapter, the next one will be
easy. Chapter 25, Multidimensional Arrays, shows you how you
can keep track of arrays in a different format called a matrix. Not all
lists of data lend themselves to matrices, but you should be prepared
for when you need them.
Chapter 24 o Array Processing
518
519
EXAMPLE
C+ + By
25
Multidimensional
Arrays
Some data fits in lists, such as the data discussed in the previous two
chapters, and other data is better suited for tables of information.
This chapter takes arrays one step further. The previous chapters
introduced single-dimensional arrays; arrays that have only one
subscript and represent lists of values.
This chapter introduces arrays of more than one dimension,
called multidimensional arrays. Multidimensional arrays, sometimes
called tables or matrices, have at least two dimensions (rows and
columns). Many times they have more than two.
This chapter introduces the following concepts:
o Multidimensional arrays
o Reserving storage for multidimensional arrays
o Putting data in multidimensional arrays
o Using nested f or loops to process multidimensional arrays
If you understand single-dimensional arrays, you should have
no trouble understanding arrays that have more than one dimen-
sion.
Chapter 25 o M ultidim ensional Arrays
520
Multidimensional Array
Basic s
A multidimensional array is an array with more than one
subscript. Whereas a single-dimensional array is a list of values, a
multidimensional array simulates a table of values, or multiple
tables of values. The most commonly used table is a two-
dimensional table (an array with two subscripts).
Suppose a softball team wanted to keep track of its players
batting records. The team played 10 games, and there are 15 players
on the team. Table 25.1 shows the teams batting record.
Table 25.1. A softball teams batting rec ord.
Player Game
Name 1 2 3 4 5 6 7 8 9 10
Adams 2 1 0 0 2 3 3 1 1 2
Berryhill 1 0 3 2 5 1 2 2 1 0
Downing 1 0 2 1 0 0 0 0 2 0
Edwards 0 3 6 4 6 4 5 3 6 3
Franks 2 2 3 2 1 0 2 3 1 0
Grady 1 3 2 0 1 5 2 1 2 1
Howard 3 1 1 1 2 0 1 0 4 3
Jones 2 2 1 2 4 1 0 7 1 0
Martin 5 4 5 1 1 0 2 4 1 5
Powers 2 2 3 1 0 2 1 3 1 2
Smith 1 1 2 1 3 4 1 0 3 2
Smithtown 1 0 1 2 1 0 3 4 1 2
Townsend 0 0 0 0 0 0 1 0 0 0
Ulmer 2 2 2 2 2 1 1 3 1 3
Williams 2 3 1 0 1 2 1 2 0 3
A mul ti di mensi onal
array has more than
one subscri pt.
521
EXAMPLE
C+ + By
Do you see that the softball table is a two-dimensional table? It
has rows (the first dimension) and columns (the second dimension).
Therefore, this is called a two-dimensional table with 15 rows and 10
columns. (Generally, the number of rows is specified first.)
Each row has a players name, and each column has a game
number associated with it, but these are not part of the actual data.
The data consists of only 150 values (15 rows by 10 columns). The
data in a two-dimensional table always is the same type of data; in
this case, every value is an integer. If it were a table of salaries, every
element would be a floating-point decimal.
The number of dimensions, in this case two, corresponds to the
dimensions in the physical world. The single-dimensioned array is
a line, or list of values. Two dimensions represent both length and
width. You write on a piece of paper in two dimensions; two
dimensions represent a flat surface. Three dimensions represent
width, length, and depth. You have seen 3-D movies. Not only do the
images have width and height, but they also seem to have depth.
Figure 25.1 shows what a three-dimensional array looks like if it has
a depth of four, six rows, and three columns. Notice that a three-
dimensional table resembles a cube.
It is difficult to visualize more than three dimensions. How-
ever, you can think of each dimension after three as another occur-
rence. In other words, a list of one players season batting record can
be stored in an array. The teams batting record (as shown in Table
25.1) is two-dimensional. The league, made of up several teams
batting records, represents a three-dimensional table. Each team
(the depth of the table) has rows and columns of batting data. If there
is more than one league, it is another dimension (another set of data).
C++ enables you to store several dimensions, although real-
world data rarely requires more than two or three.
A three- di mensi onal
tabl e has three
di mensi ons: depth,
rows, and col umns.
Chapter 25 o M ultidim ensional Arrays
522
Figure 25.1. Representing a three-dimensional table (a cube).
Reserving Multidimensional
Arrays
When you reserve a multidimensional array, you must inform
C++ that the array has more than one dimension by putting more
than one subscript in brackets after the array name. You must put a
separate number, in brackets, for each dimension in the table. For
example, to reserve the team data from Table 25.1, you use the
following multidimensional array declaration.
3 columns
4 deep
6 rows
523
EXAMPLE
C+ + By
Declare an integer array called t eams with 15 rows and 10 columns.
i nt t eams[ 15] [ 10] ; / / Reser ves a t wo- di mensi onal t abl e.
CAUTION: Unlike other programming languages, C++ re-
quires you to enclose each dimension in brackets. Do not
reserve multidimensional array storage like this:
i nt t eams[ 15, 10] ; / / I nval i d t abl e decl ar at i on.
Properly reserving the t eams table produces a table with 150
elements. Figure 25.2 shows what each elements subscript looks
like.
columns
Figure 25.2. Subscripts for the softball team table.
rows
Chapter 25 o M ultidim ensional Arrays
524
If you had to track three teams, each with 15 players and 10
games, the three-dimensional table would be created as follows:
i nt t eams[ 3] [ 15] [ 10] ; / / Reser ves a t hr ee- di mensi onal t abl e.
When creating a two-dimensional table, always put the maxi-
mum number of rows first, and the maximum number of columns
second. C++ always uses 0 as the starting subscript of each dimen-
sion. The last element, the lower-right element of the t eams table, is
t eams[ 2] [ 14] [ 9] .
Examples
1. Suppose you wanted to keep track of utility bills for the
year. You can store 12 months of four utilities in a two-
dimensional table of floating-point amounts, as the follow-
ing array declaration demonstrates:
f l oat ut i l i t i es[ 12] [ 4] ; / / Reser ves 48 el ement s.
You can compute the total number of elements in a multi-
dimensional array by multiplying the subscripts. Because
12 times 4 is 48, there are 48 elements in this array (12 rows,
4 columns). Each of these elements is a floating-point data
type.
2. If you were keeping track of five years worth of utilities,
you have to add an extra dimension. The first dimension is
the years, the second is the months, and the last is the indi-
vidual utilities. Here is how you reserve storage:
f l oat ut i l i t i es[ 5] [ 12] [ 4] ; / / Reser ves 240 el ement s.
Mapping Arrays to Memory
C++ approaches multidimensional arrays a little differently
than most programming languages do. When you use subscripts,
you do not have to understand the internal representation of multi-
dimensional arrays. However, most C++ programmers think a
deeper understanding of these arrays is important, especially when
programming advanced applications.
The far- ri ght
di mensi on al ways
represents col umns,
the next represents
rows, and so on.
525
EXAMPLE
C+ + By
A two-dimensional array is actually an array of arrays. You
program multidimensional arrays as though they were tables with
rows and columns. A two-dimensional array is actually a single-
dimensional array, but each of its elements is not an integer, floating-
point, or character, but another array.
Knowing that a multidimensional array is an array of other
arrays is critical when passing and receiving such arrays. C++
passes all arrays, including multidimensional arrays, by address.
Suppose you were using an integer array called scor es, reserved as a
5-by-6 table. You can pass scor es to a function called pr i nt _i t ( ) , as
follows:
pr i nt _i t ( scor es) ; / / Passes t abl e t o a f unct i on.
The function pr i nt _i t ( ) has to identify the type of parameter
being passed to it. The pr i nt _i t ( ) function also must recognize that
the parameter is an array. If scor es were one-dimensional, you could
receive it as
pr i nt _i t ( i nt scor es[ ] ) / / Wor ks onl y i f scor es
/ / i s one- di mensi onal .
or
pr i nt _i t ( i nt scor es[ 10] ) / / Assumi ng scor es
/ / has 10 el ement s.
If scor es were a multidimensional table, you would have to
designate each pair of brackets and put the maximum number of
subscripts in its brackets, as in
pr i nt _i t ( i nt scor es[ 5] [ 6] ) / / I nf or mpr i nt _i t ( ) of
/ / t he ar r ay s di mensi ons.
or
pr i nt _i t ( i nt scor es[ ] [ 6] ) / / I nf or mpr i nt _i t ( ) of
/ / t he ar r ay s di mensi ons.
Notice you do not have to explicitly state the maximum sub-
script on the first dimension when receiving multidimensional
Chapter 25 o M ultidim ensional Arrays
526
arrays, but you must designate the second. If scor es were a three-
dimensional table, dimensioned as 10 by 5 by 6, you would receive
it with pr i nt _i t ( ) as
pr i nt _i t ( i nt scor es[ ] [ 5] [ 6] ) / / Onl y f i r st di mensi on
/ / i s opt i onal .
or
pr i nt _i t ( i nt scor es[ 10] [ 5] [ 6] ) / / I nf or mpr i nt _i t ( ) of
/ / ar r ay s di mensi ons.
You should not have to worry too much about the way tables
are physically stored. Even though a two-dimensional table is
actually an array of arrays (and each of those arrays contains another
array if it is a three-dimensional table), you can use subscripts to
program multidimensional arrays as if they were stored in row-and-
column order.
Multidimensional arrays are stored in row order. Suppose you
want to keep track of a 3-by-4 table. The top of Figure 25.3 shows
how that table (and its subscripts) are visualized. Despite the
two-dimensional table organization, your memory is still sequen-
tial storage. C++ has to map multidimensional arrays to single-
dimensional memory, and it does so in row order.
Each row fills memory before the next row is stored. Figure 25.3
shows how a 3-by-4 table is mapped to memory.
The entire first row (t abl e[ 0] [ 0] through t abl e[ 0] [ 3] ) is stored
first in memory before any of the second row. A table is actually an
array of arrays, and, as you learned in previous chapters, array
elements are always stored sequentially in memory. Therefore, the
first row (array) completely fills memory before the second row.
Figure 25.3 shows how two-dimensional arrays map to memory.
Defining Multidimensional
Arrays
C++ is not picky about the way you define a multidimensional
array when you initialize it at declaration time. As with single-
dimensional arrays, you initialize multidimensional arrays with
C++ stores
mul ti di mensi onal
arrays i n row order.
527
EXAMPLE
C+ + By
braces that designate dimensions. Because a multidimensional ar-
ray is an array of arrays, you can nest braces when you initialize
them.
Figure 25.3. Mapping a two-dimensional table to memory.
The following three array definitions fill the three arrays ar a1,
ar a2, and ar a3, as shown in Figure 25.4:
i nt ar a1[ 5] = {8, 5, 3, 25, 41}; / / One- di mensi onal ar r ay.
i nt ar a2[ 2] [ 4] ={{4, 3, 2, 1}, {1, 2, 3, 4}};
i nt ar a3[ 3] [ 4] ={{1, 2, 3, 4}, {5, 6, 7, 8}, {9, 10, 11, 12}};
Memory
First row
Second row
Third row
Fourth row
Chapter 25 o M ultidim ensional Arrays
528
Figure 25.4. After initializing a table.
Notice that the multidimensional arrays are stored in row
order. In ar a3, the first row receives the first four elements of the
definition (1, 2, 3, and 4).
ar a1
ar a2
ar a3
529
EXAMPLE
C+ + By
TIP: To make a multidimensional array initialization match
the arrays subscripts, some programmers like to show how
arrays are filled. Because C++ programs are free-form, you can
initialize ar a2 and ar a3 as
i nt ar a2[ 2] [ 4] ={{4, 3, 2, 1}, / / Does exact l y t he same
{1, 2, 3, 4}}; / / t hi ng as bef or e.
i nt ar a3[ 3] [ 4] ={{1, 2, 3, 4},
{5, 6, 7, 8},
{9, 10, 11, 12}; / / Vi sual l y mor e
/ / obvi ous.
You can initialize a multidimensional array as if it were single-
dimensional in C++. You must keep track of the row order if you do
this. For instance, the following two definitions also reserve storage
for and initialize ar a2 and ar a3:
i nt ar a2[ 2] [ 4] ={4, 3, 2, 1, 1, 2, 3, 4};
i nt ar a3[ 3] [ 4] ={1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13};
There is no difference between initializing ar a2 and ar a3 with or
without the nested braces. The nested braces seem to show the
dimensions and how C++ fills them a little better, but the choice of
using nested braces is yours.
TIP: Multidimensional arrays (unless they are global) are not
initialized to specific values unless you assign them values at
declaration time or in the program. As with single-dimensional
arrays, if you initialize one or more of the elements, but not all
of them, C++ fills the rest with zeros. If you want to fill an entire
multidimensional array with zeros, you can do so with the
following:
f l oat sal es[ 3] [ 4] [ 7] [ 2] = {0}; / / Fi l l s al l sal es
/ / wi t h zer os.
Chapter 25 o M ultidim ensional Arrays
530
One last point to consider is how multidimensional arrays are
viewed by your compiler. Many people program in C++ for years,
but never understand how tables are stored internally. As long as
you use subscripts, a tables internal representation should not
matter. When you learn about pointer variables, however, you
might want to know how C++ stores your tables in case you want to
reference them with pointers (as shown in the next few chapters).
Figure 25.5 shows the way C++ stores a 3-by-4 table in memory.
Unlike single-dimensional arrays, each element is stored contigu-
ously, but notice how C++ views the data. Because a table is an array
of arrays, the array name contains the address of the start of the
primary array. Each of those elements points to the arrays it contains
(the data in each row). This coverage of table storage is for your
information only, at this point. As you become more proficient in
C++, and write more powerful programs that manipulate internal
memory, you might want to review this table storage method.
Tables and f or Loops
As the following examples show, nested f or loops are useful
when you want to loop through every element of a multidimen-
sional table.
For instance, the section of code,
f or ( r ow=0; r ow<2; r ow++)
{ f or ( col =0; col <3; col ++)
{ cout << r ow << << col \ n; }
}
produces the following output:
0 0
0 1
0 2
1 0
1 1
1 2
531
EXAMPLE
C+ + By
ar a name
An array of arrays
First row
Third
row
Second
row
Fourth
row
Figure 25.5. Internal representation of a two-dimensional table.
Chapter 25 o M ultidim ensional Arrays
532
These numbers are the subscripts, in row order, for a two-row
by three-column table dimensioned with
i nt t abl e[ 2] [ 3] ;
Notice there are as many f or loops as there are subscripts in the
array (two). The outside loop represents the first subscript (the
rows), and the inside loop represents the second subscript (the
columns). The nested f or loop steps through each element of the
table.
You can use ci n, get s( ) , get , and other input functions to fill a
table, and you also can assign values to the elements when declaring
the table. More often, the data comes from data files on the disk.
Regardless of what method stores the values in multidimensional
arrays, nested f or loops are excellent control statements to step
through the subscripts. The following examples demonstrate how
nested f or loops work with multidimensional arrays.
Examples
1. The following statements reserve enough memory elements
for a television stations ratings (A through D) for one week:
char r at i ngs[ 7] [ 48] ;
These statements reserve enough elements to hold seven
days (the rows) of ratings for each 30-minute time slot (48 of
them in a day).
Every element in a table is always the same type. In this case,
each element is a character variable. Some are initialized
with the following assignment statements:
shows[ 3] [ 12] = B ; / / St or es B i n 4t h r ow, 13t h col umn.
shows[ 1] [ 5] = A ; / / St or es C i n 2nd r ow, 6t h col umn.
shows[ 6] [ 20] = get ch( ) ; / / St or es t he l et t er t he user t ypes.
2. A computer company sells two sizes of disks: 3 1/2-inch and
5 1/4-inch. Each disk comes in one of four capacities: single-
sided double-density, double-sided double-density, single-
sided high-density, and double-sided high-density.
Nested l oops work
wel l wi th mul ti -
di mensi onal arrays.
533
EXAMPLE
C+ + By
The disk inventory is well-suited for a two-dimensional
table. The company determined that the disks have the
following retail prices:
Double Density High Density
Single Double Single Double
3 1/2-inch 2.30 2.75 3.20 3.50
5 1/4-inch 1.75 2.10 2.60 2.95
The company wants to store the price of each disk in a table
for easy access. The following program stores the prices with
assignment statements.
/ / Fi l ename: C25DI SK1. CPP
/ / Assi gns di sk pr i ces t o a t abl e.
#i ncl ude <i ost r eam. h>
#i ncl ude <i omani p. h>
voi d mai n( )
{
f l oat di sks[ 2] [ 4] ; / / Tabl e of di sk pr i ces.
i nt r ow, col ; / / Subscr i pt var i abl es.
di sks[ 0] [ 0] = 2. 39; / / Row 1, col umn 1
di sks[ 0] [ 1] = 2. 75; / / Row 1, col umn 2
di sks[ 0] [ 2] = 3. 29; / / Row 1, col umn 3
di sks[ 0] [ 3] = 3. 59; / / Row 1, col umn 4
di sks[ 1] [ 0] = 1. 75; / / Row 2, col umn 1
di sks[ 1] [ 1] = 2. 19; / / Row 2, col umn 2
di sks[ 1] [ 2] = 2. 69; / / Row 2, col umn 3
di sks[ 1] [ 3] = 2. 95; / / Row 2, col umn 4
/ / Pr i nt t he pr i ces.
f or ( r ow=0; r ow<2; r ow++)
{ f or ( col =0; col <4; col ++)
{ cout << $ << set pr eci si on( 2) <<
di sks[ r ow] [ col ] << \ n; }
}
r et ur n;
}
Chapter 25 o M ultidim ensional Arrays
534
This program displays the prices as follows:
$2. 39
$2. 75
$3. 29
$3. 59
$1. 75
$2. 19
$2. 69
$2. 95
It prints them one line at a time, without any descriptive
titles. Although the output is not labeled, it illustrates how
you can use assignment statements to initialize a table, and
how nested f or loops can print the elements.
3. The preceding disk inventory would be displayed better if
the output had descriptive titles. Before you add titles, it is
helpful for you to see how to print a table in its native row
and column format.
Typically, you use a nested f or loop, such as the one in the
previous example, to print rows and columns. You should
not output a newline character with every cout , however. If
you do, you see one value per line, as in the previous
programs output, which is not the row and column format
of the table.
You do not want to see every disk price on one line, but you
want each row of the table printed on a separate line. You
must insert a cout << \ n; to send the cursor to the next line
each time the row number changes. Printing newlines after
each row prints the table in its row and column format, as
this program shows:
/ / Fi l ename: C25DI SK2. CPP
/ / Assi gns di sk pr i ces t o a t abl e
/ / and pr i nt s t hemi n a t abl e f or mat .
#i ncl ude <i ost r eam. h>
#i ncl ude <i omani p. h>
voi d mai n( )
{
535
EXAMPLE
C+ + By
f l oat di sks[ 2] [ 4] ; / / Tabl e of di sk pr i ces.
i nt r ow, col ;
di sks[ 0] [ 0] = 2. 39; / / Row 1, col umn 1
di sks[ 0] [ 1] = 2. 75; / / Row 1, col umn 2
di sks[ 0] [ 2] = 3. 29; / / Row 1, col umn 3
di sks[ 0] [ 3] = 3. 59; / / Row 1, col umn 4
di sks[ 1] [ 0] = 1. 75; / / Row 2, col umn 1
di sks[ 1] [ 1] = 2. 19; / / Row 2, col umn 2
di sks[ 1] [ 2] = 2. 69; / / Row 2, col umn 3
di sks[ 1] [ 3] = 2. 95; / / Row 2, col umn 4
/ / Pr i nt t he pr i ces
f or ( r ow=0; r ow<2; r ow++)
{ f or ( col =0; col <4; col ++)
{ cout << $ << set pr eci si on( 2) <<
di sks[ r ow] [ col ] << \ t ;
}
cout << \ n; / / Pr i nt s a new l i ne af t er each r ow.
}
r et ur n;
}
Here is the output of the disk prices in their native table
order:
$2. 39 $2. 75 $3. 29 $3. 59
$1. 75 $2. 19 $2. 69 $2. 95
4. To add the titles, simply print a row of titles before the first
row of values, then print a new column title before each
column, as shown in the following program:
/ / Fi l ename: C25DI SK3. CPP
/ / Assi gns di sk pr i ces t o a t abl e
/ / and pr i nt s t hemi n a t abl e f or mat wi t h t i t l es.
#i ncl ude <i ost r eam. h>
#i ncl ude <i omani p. h>
Chapter 25 o M ultidim ensional Arrays
536
voi d mai n( )
{
f l oat di sks[ 2] [ 4] ; / / Tabl e of di sk pr i ces.
i nt r ow, col ;
di sks[ 0] [ 0] = 2. 39; / / Row 1, col umn 1
di sks[ 0] [ 1] = 2. 75; / / Row 1, col umn 2
di sks[ 0] [ 2] = 3. 29; / / Row 1, col umn 3
di sks[ 0] [ 3] = 3. 59; / / Row 1, col umn 4
di sks[ 1] [ 0] = 1. 75; / / Row 2, col umn 1
di sks[ 1] [ 1] = 2. 19; / / Row 2, col umn 2
di sks[ 1] [ 2] = 2. 69; / / Row 2, col umn 3
di sks[ 1] [ 3] = 2. 95; / / Row 2, col umn 4
/ / Pr i nt t he col umn t i t l es.
cout << \ t Si ngl e- si ded\ t Doubl e- si ded\ t Si ngl e- si ded\ t <<
Doubl e- si ded\ n;
cout << \ t Doubl e- densi t y\ t Doubl e- densi t y\ t Hi gh- densi t y <<
\ t Hi gh- densi t y\ n;
/ / Pr i nt t he pr i ces
f or ( r ow=0; r ow<2; r ow++)
{ i f ( r ow == 0)
{ cout << 3- 1/ 2\ \ t ; } / / Need \ t o
/ / pr i nt quot at i on.
el se
{ cout << 5- 1/ 4\ \ t ; }
f or ( col =0; col <4; col ++) / / Pr i nt t he cur r ent r ow.
{ cout << set pr eci si on( 2) << $ << di sks[ r ow] [ col ]
<< \ t \ t ;
}
cout << \ n; / / Pr i nt a newl i ne af t er each r ow.
}
r et ur n;
}
537
EXAMPLE
C+ + By
Here is the output from this program:
Si ngl e- si ded Doubl e- si ded Si ngl e- si ded Doubl e- si ded
Doubl e- densi t y Doubl e- densi t y Hi gh- densi t y Hi gh- densi t y
3- 1/ 2" $2. 39 $2. 75 $3. 29 $3. 59
5- 1/ 4" $1. 75 $2. 19 $2. 69 $2. 95
Review Questions
The answers to the review questions are in Appendix B.
1. What statement reserves a two-dimensional table of integers
called scor es with five rows and six columns?
2. What statement reserves a three-dimensional table of four
character arrays called i ni t i al s with 10 rows and 20 columns?
3. In the following statement, which subscript (first or second)
represents rows and which represents columns?
i nt wei ght s[ 5] [ 10] ;
4. How many elements are reserved with the following
statement?
i nt ar a[ 5] [ 6] ;
5. The following table of integers is called ar a:
4 1 3 5 9
10 2 12 1 6
25 42 2 91 8
What values do the following elements contain?
a. ar a[ 2] [ 2]
b. ar a[ 0] [ 1]
c. ar a[ 2] [ 3]
d. ar a[ 2] [ 4]
Chapter 25 o M ultidim ensional Arrays
538
6. What control statement is best for stepping through multi-
dimensional arrays?
7. Notice the following section of a program:
i nt gr ades[ 3] [ 5] = {80, 90, 96, 73, 65, 67, 90, 68, 92, 84, 70,
55, 95, 78, 100};
What are the values of the following:
a. gr ades[ 2] [ 3]
b. gr ades[ 2] [ 4]
c. gr ades[ 0] [ 1]
Review Exerc ises
1. Write a program that stores and prints the numbers from 1
to 21 in a 3-by-7 table. (Hint: Remember C++ begins sub-
scripts at 0.)
2. Write a program that reserves storage for three years worth
of sales data for five salespeople. Use assignment statements
to fill the table with data, then print it, one value per line.
3. Instead of using assignment statements, use the ci n function
to fill the salespeople data from Exercise 2.
4. Write a program that tracks the grades for five classes, each
having 10 students. Input the data using the ci n function.
Print the table in its native row and column format.
Summary
You now know how to create, initialize, and process multidi-
mensional arrays. Although not all data fits in the compact format
of tables, much does. Using nested f or loops makes stepping through
a multidimensional array straightforward.
539
EXAMPLE
C+ + By
One of the limitations of a multidimensional array is that each
element must be the same data type. This keeps you from being able
to store several kinds of data in tables. Chapter 28, Structures,
shows you how to store data in different ways to overcome this
limitation.
Chapter 25 o M ultidim ensional Arrays
540
541
EXAMPLE
C+ + By
26
Pointers
C++ reveals its true power through pointer variables. Pointer vari-
ables (or pointers, as they generally are called) are variables that
contain addresses of other variables. All variables you have seen so
far have held data values. You understand that variables hold
various data types: character, integer, floating-point, and so on.
Pointer variables contain the location of regular data variables; they
in effect point to the data because they hold the address of the data.
When first learning C++, students of the language tend to shy
away from pointers, thinking that pointers will be difficult. Pointers
do not have to be difficult. In fact, after you work with them for a
while, you will find they are easier to use than arrays (and much
more flexible).
This chapter introduces the following concepts:
o Pointers
o Pointers of different data types
o The address of (&) operator
o The dereferencing (*) operator
o Arrays of pointers
Chapter 26 o Pointers
542
Pointers offer a highly efficient means of accessing and chang-
ing data. Because pointers contain the actual address of your data,
your compiler has less work to do when finding that data in
memory. Pointers do not have to link data to specific variable names.
A pointer can point to an unnamed data value. With pointers, you
gain a different view of your data.
Introduc tion to Pointer
Variables
Pointers are variables. They follow all the normal naming rules
of regular, nonpointer variables. As with regular variables, you
must declare pointer variables before using them. There is a type of
pointer for every data type in C++; there are integer pointers,
character pointers, floating-point pointers, and so on. You can
declare global pointers or local pointers, depending on where you
declare them.
About the only difference between pointer variables and regu-
lar variables is the data they hold. Pointers do not contain data in the
usual sense of the word. Pointers contain addresses of data. If you
need a quick review of addresses and memory, see Appendix A,
Memory Addressing, Binary, and Hexadecimal Review.
There are two pointer operators in C++:
& The address of operator
* The dereferencing operator
Dont let these operators throw you; you might have seen them
before! The & is the bitwise AND operator (from Chapter 11, Addi-
tional C++ Operators) and the * means, of course, multiplication.
These are called overloaded operators. They perform more than one
function, depending on how you use them in your programs. C++
does not confuse * for multiplication when you use it as a
dereferencing operator with pointers.
Poi nters contai n
addresses of other
vari abl es.
543
EXAMPLE
C+ + By
Any time you see the & used with pointers, think of the words
address of. The & operator always produces the memory address
of whatever it precedes. The * operator, when used with pointers,
either declares a pointer or dereferences the pointers value. The
next section explains each of these operators.
Dec laring Pointers
Because you must declare all pointers before using them, the
best way to begin learning about pointers is to understand how to
declare and define them. Actually, declaring pointers is almost as
easy as declaring regular variables. After all, pointers are variables.
If you must declare a variable that holds your age, you could do
so with the following variable declaration:
i nt age=30; / / Decl ar e a var i abl e t o hol d my age.
Declaring age like this does several things. It enables C++ to
identify a variable called age, and to reserve storage for that variable.
Using this format also enables C++ to recognize that you will store
only integers in age, not floating-point or double floating-point data.
The declaration also requests that C++ store the value of 30 in age
after it reserves storage for age.
Where did C++ store age in memory? As the programmer, you
should not really care where C++ stores age. You do not have to
know the variables address because you will never refer to age by its
address. If you want to calculate with or print age, you call it by its
name, age.
TIP: Make your pointer variable names meaningful. The name
f i l e_pt r makes more sense than x13 for a file-pointing variable,
although either name is allowed.
Suppose you want to declare a pointer variable. This pointer
variable will not hold your age, but it will point to age, the variable
that holds your age. (Why you would want to do this is explained in
this and the next few chapters.) p_age might be a good name for the
pointer variable. Figure 26.1 illustrates what you want to do. The
Chapter 26 o Pointers
544
figure assumes C++ stored age at the address 350,606. Your C++
compiler, however, arbitrarily determines the address of age, so it
could be anything.
Figure 26.1. p_age contains the address of age; p_age points to the age
variable.
The name p_age has nothing to do with pointers, except that it
is the name you made up for the pointer to age. Just as you can name
variables anything (as long as the name follows the legal naming
rules of variables), p_age could just as easily have been named house,
x43344, space_t r ek, or whatever else you wanted to call it. This
reinforces the idea that a pointer is just a variable you reserve in your
program. Create meaningful variable names, even for pointer vari-
ables. p_age is a good name for a variable that points to age (as would
be pt r _age and pt r _t o_age).
To declare the p_age pointer variable, you must program the
following:
i nt * p_age; / / Decl ar es an i nt eger poi nt er .
Similar to the declaration for age, this declaration reserves a
variable called p_age. The p_age variable is not a normal integer
variable, however. Because of the dereferencing operator, *, C++
knows this is to be a pointer variable. Some C++ programmers
prefer to declare such a variable without a space after the *, as
follows:
i nt *p_age; / / Decl ar es an i nt eger poi nt er .
545
EXAMPLE
C+ + By
Either method is okay, but you must remember the * is not part
of the name. When you later use p_age, you will not prefix the name
with the *, unless you are dereferencing it at the time (as later
examples show).
TIP: Whenever the dereferencing operator, *, appears in a
variable definition, the variable being declared is always a
pointer variable.
Consider the declaration for p_age if the asterisk were not there:
C++ would think you were declaring a regular integer variable. The
* is important, because it tells C++ to interpret p_age as a pointer
variable, not as a normal, data variable.
Assigning Values to Pointers
p_age is an integer pointer. This is very important. p_age can
point only to integer values, never to floating-point, double floating-
point, or even character variables. If you needed to point to a
floating-point variable, you might do so with a pointer declared as
f l oat *poi nt ; / / Decl ar es a f l oat i ng- poi nt poi nt er .
As with any automatic variable, C++ does not initialize point-
ers when you declare them. If you declared p_age as previously
described, and you wanted p_age to point to age, you would have to
explicitly assign p_age to the address of age. The following statement
does this:
p_age = &age; / / Assi gn t he addr ess of age t o p_age.
What value is now in p_age? You do not know exactly, but you
know it is the address of age, wherever that is. Rather than assign the
address of age to p_age with an assignment operator, you can declare
and initialize pointers at the same time. These lines declare and
initialize both age and p_age:
i nt age=30; / / Decl ar es a r egul ar i nt eger
/ / var i abl e, put t i ng 30 i n i t .
Poi nters can poi nt
onl y to data of thei r
own type.
Chapter 26 o Pointers
546
i nt *p_age=&age; / / Decl ar es an i nt eger poi nt er ,
/ / i ni t i al i zi ng i t wi t h t he addr ess
/ / of p_age.
These two lines produce the variables described in Figure 26.1.
If you wanted to print the value of age, you could do so with the
following cout :
cout << age; / / Pr i nt s t he val ue of age.
You also can print the value of age like this:
cout << *p_age; / / Der ef er ences p_age.
The dereference operator produces a value that tells the pointer
where to point. Without the *, the last cout would print an address
(the address of age). With the *, the cout prints the value at that
address.
You can assign a different value to age with the following
statement:
age=41; / / Assi gns a new val ue t o age.
You also can assign a value to age like this:
*p_age=41;
This declaration assigns 41 to the value to which p_age points.
TIP: The * appears before a pointer variable in only two
placeswhen you declare a pointer variable, and when you
dereference a pointer variable (to find the data it points to).
Pointers and Parameters
Now that you understand the pointers * and & operators, you
can finally see why scanf ( ) s requirements were not as strict as they
first seemed. While passing a regular variable to scanf ( ) , you had to
prefix the variable with the & operator. For instance, the following
scanf ( ) gets three integer values from the user:
scanf ( %d %d %d, &num1, &num2, &num3) ;
547
EXAMPLE
C+ + By
This scanf ( ) does not pass the three variables, but passes the
addresses of the three variables. Because scanf ( ) knows the exact
locations of these parameters in memory (because their addresses
were passed), it goes to those addresses and puts the keyboard input
values into those addresses.
This is the only way scanf ( ) could work. If you passed these
variables by copy, without putting the address of operator (&)
before them, scanf ( ) would get the keyboard input and fill a copy of
the variables, but not the actual variables num1, num2, and num3. When
scanf ( ) then returned control to your program, you would not have
the input values. Of course, the ci n operator does not have the
ampersand (&) requirement and is easier to use for most C++
programs.
You might recall from Chapter 18, Passing Values, that you
can override C++s normal default of passing by copy (or by
value). To pass by address, receive the variable preceded by an & in
the receiving function. The following function receives t r i es by
address:
pr _i t ( i nt &t r i es) ; / / Recei ve i nt eger t r i es i n pr _i t ( ) by
/ / addr ess ( pr i t woul d nor mal l y r ecei ve
/ / t r i es by copy) .
Now that you understand the & and * operators, you can
understand completely the passing of nonarray parameters by
address to functions. (Arrays default to passing by address without
requiring that you use &.)
Examples
1. The following section of code declares three regular vari-
ables of three different data types, and three corresponding
pointer variables:
char i ni t i al = Q ; / / Decl ar es t hr ee r egul ar var i abl es
i nt num=40; / / of t hr ee di f f er ent t ypes.
f l oat sal es=2321. 59;
Chapter 26 o Pointers
548
char *p_i ni t i al =&i ni t i al ; / / Decl ar es t hr ee poi nt er s.
i nt * pt r _num=&num; / / Poi nt er names and spaci ng
f l oat * sal es_add = &sal es; / / af t er * ar e not cr i t i cal .
2. Just like regular variables, you can initialize pointers with
assignment statements. You do not have to initialize them
when you declare them. The next few lines of code are
equivalent to the code in Example 1:
char i ni t i al ; / / Decl ar es t hr ee r egul ar var i abl es
i nt num; / / of t hr ee di f f er ent t ypes.
f l oat sal es;
char *p_i ni t i al ; / / Decl ar es t hr ee poi nt er s but does
i nt * pt r _num; / / not i ni t i al i ze t hemyet .
f l oat * sal es_add;
i ni t i al = Q ; / / I ni t i al i zes t he r egul ar var i abl es
num=40; / / wi t h val ues.
sal es=2321. 59;
p_i ni t i al =&i ni t i al ; / / I ni t i al i zes t he poi nt er s wi t h
pt r _num=&num; / / t he addr esses of t hei r
sal es_add=&sal es; / / cor r espondi ng var i abl es.
Notice that you do not put the * operator before the pointer
variable names when assigning them values. You would
prefix a pointer variable with the * only if you were
dereferencing it.
NOTE: In this example, the pointer variables could have been
assigned the addresses of the regular variables before the
regular variables were assigned values. There would be no
difference in the operation. The pointers are assigned the
addresses of the regular variables no matter what the data in
the regular variables are.
549
EXAMPLE
C+ + By
Keep the data type of each pointer consistent with its corre-
sponding variable. Do not assign a floating-point variable to
an integers address. For instance, you cannot make the
following assignment statement:
p_i ni t i al = &sal es; / / I nval i d poi nt er assi gnment .
because p_i ni t i al can point only to character data, not to
floating-point data.
3. The following program is an example you should study
closely. It shows more about pointers and the pointer opera-
tors, & and *, than several pages of text can do.
/ / Fi l ename: C26POI NT. CPP
/ / Demonst r at es t he use of poi nt er decl ar at i ons
/ / and oper at or s.
#i ncl ude <i ost r eam. h>
voi d mai n( )
{
i nt num=123; / / A r egul ar i nt eger var i abl e.
i nt *p_num; / / Decl ar es an i nt eger poi nt er .
cout << numi s << num<< \ n; / / Pr i nt s val ue of num.
cout << The addr ess of numi s << &num<< \ n;
/ / Pr i nt s num s l ocat i on.
p_num= &num; / / Put s addr ess of numi n p_num,
/ / i n ef f ect maki ng p_numpoi nt
/ / t o num.
/ / No * i n f r ont of p_num.
cout << *p_numi s << *p_num<< \ n; / / Pr i nt s val ue
/ / of num.
cout << p_numi s << p_num<< \ n; / / Pr i nt s l ocat i on
/ / of num.
r et ur n;
}
Chapter 26 o Pointers
550
Here is the output from this program:
numi s 123
The addr ess of numi s 0x8f bd0f f e
*p_numi s 123
p_numi s 0x8f bd0f f e
If you run this program, you probably will get different
results for the value of p_numbecause your compiler will
place numat a different location, depending on your memory
setup. The value of p_numprints in hexadecimal because it is
an address of memory. The actual address does not matter,
however. Because the pointer p_numalways contains the
address of num, and because you can dereference p_numto get
nums value, the actual address is not critical.
4. The following program includes a function that swaps the
values of any two integers passed to it. You might recall that
a function can return only a single value. Therefore, before
now, you could not write a function that changed two
different values and returned both values to the calling
function.
To swap two variables (reversing their values for sorting, as
you saw in Chapter 24, Array Processing), you need the
ability to pass both variables by address. Then, when the
function reverses the variables, the calling functions vari-
ables also are swapped.
Notice the functions use of dereferencing operators before
each occurrence of num1 and num2. It does not matter at which
address num1 and num2 are stored, but you must make sure
that you dereference whatever addresses were passed to the
function.
Be sure to receive arguments with the prefix & in functions
that receive by address, as done here.
551
EXAMPLE
C+ + By
Identify the program and include the I/O header file. This program swaps
two integers, so initialize two integer variables in mai n( ) . Pass the variables
to the swapping function, called swap_t hem, then switch their values. Print
the results of the swap in mai n( ) .
/ / Fi l ename: C26SWAP. CPP
/ / Pr ogr amt hat i ncl udes a f unct i on t hat swaps
/ / any t wo i nt eger s passed t o i t
#i ncl ude <i ost r eam. h>
voi d swap_t hem( i nt &num1, i nt &num2) ;
voi d mai n( )
{
i nt i =10, j =20;
cout << \ n\ nBef or e swap, i i s << i <<
and j i s << j << \ n\ n;
swap_t hem( i , j ) ;
cout << \ n\ nAf t er swap, i i s << i <<
and j i s << j << \ n\ n;
r et ur n;
}
voi d swap_t hem( i nt &num1, i nt &num2)
{
i nt t emp; / / Var i abl e t hat hol ds
/ / i n- bet ween swapped val ue.
t emp = num1; / / The cal l i ng f unct i on s var i abl es
num1 = num2; / / ( and not copi es of t hem) ar e
num2 = t emp; / / changed i n t hi s f unct i on.
r et ur n;
}
Arrays of Pointers
If you have to reserve many pointers for many different values,
you might want to declare an array of pointers. You know that you
can reserve an array of characters, integers, long integers, and
floating-point values, as well as an array of every other data type
available. You also can reserve an array of pointers, with each
pointer being a pointer to a specific data type.
Chapter 26 o Pointers
552
Figure 26.2. An array of 10 integer pointers.
The following reserves an array of 20 character pointer
variables:
char *cpoi nt [ 20] ; / / Ar r ay of 20 char act er poi nt er s.
Again, the asterisk is not part of the array name. The asterisk
lets C++ know that this is an array of integer pointers and not just
an array of integers.
The following reserves an array of 10 integer pointer variables:
i nt *i pt r [ 10] ; / / Reser ves an ar r ay of 10 i nt eger poi nt er s
Figure 26.2 shows how C++ views this array. Each element
holds an address (after being assigned values) that points to other
values in memory. Each value pointed to must be an integer. You can
assign an element from i pt r an address just as you would for
nonarray pointer variables. You can make i pt r [ 4] point to the
address of an integer variable named age by assigning it like this:
i pt r [ 4] = &age; / / Make i pt r [ 4] poi nt t o addr ess of age.
553
EXAMPLE
C+ + By
Some beginning C++ students get confused when they see such
a declaration. Pointers are one thing, but reserving storage for arrays
of pointers tends to bog novices down. However, reserving storage
for arrays of pointers is easy to understand. Remove the asterisk
from the previous declaration as follows,
char cpoi nt [ 20] ;
and what do you have? You have just reserved a simple array of 20
characters. Adding the asterisk tells C++ to go one step further:
rather than an array of character variables, you want an array of
character pointing variables. Rather than having each element be a
character variable, you have each element hold an address that
points to characters.
Reserving arrays of pointers will be much more meaningful
after you learn about structures in the next few chapters. As with
regular, nonpointing variables, an array makes processing several
pointer variables much easier. You can use a subscript to reference
each variable (element) without having to use a different variable
name for each value.
Review Questions
Answers to review questions are in Appendix B.
1. What type of variable is reserved in each of the following?
a. i nt *a;
b. char * cp;
c. f l oat * dp;
2. What words should come to mind when you see the &
operator?
3. What is the dereferencing operator?
4. How would you assign the address of the floating-point
variable sal ar y to a pointer called pt _sal ?
5. True or false: You must define a pointer with an initial value
when declaring it.
Chapter 26 o Pointers
554
6. In both of the following sections of code:
i nt i ;
i nt * pt i ;
i =56;
pt i = &i ;
and
i nt i ;
i nt * pt i ;
pt i = &i ; / / These t wo l i nes ar e r ever sed
i =56; / / f r omt he pr ecedi ng exampl e.
is the value of pt i the same after the fourth line of each
section?
7. In the following section of code:
f l oat pay;
f l oat *pt r _pay;
pay=2313. 54;
pt r _pay = &pay;
What is the value of each of the following (answer invalid
if it cannot be determined):
a. pay
b. *pt r _pay
c. *pay
d. &pay
8. What does the following declare?
doubl e *ar a[ 4] [ 6] ;
a. An array of double floating-point values
b. An array of double floating-point pointer variables
c. An invalid declaration statement
555
EXAMPLE
C+ + By
NOTE: Because this is a theory-oriented chapter, review exer-
cises are saved until you master Chapter 27, Pointers and
Arrays.
Summary
Declaring and using pointers might seem troublesome at this
point. Why assign *p_numa value when it is easier (and clearer) to
assign a value directly to num? If you are asking yourself that
question, you probably understand everything you should from
this chapter and are ready to begin learning the true power of
pointers: combining pointers and array processing.
Chapter 26 o Pointers
556
557
EXAMPLE
C+ + By
27
Pointers and
Arrays
Arrays and pointers are closely related in the C++ programming
language. You can address arrays as if they were pointers and
address pointers as if they were arrays. Being able to store and access
pointers and arrays gives you the ability to store strings of data in
array elements. Without pointers, you could not store strings of data
in arrays because there is no fundamental string data type in C++ (no
string variables, only string literals).
This chapter introduces the following concepts:
o Array names and pointers
o Character pointers
o Pointer arithmetic
o Ragged-edge arrays of string data
This chapter introduces concepts you will use for much of your
future programming in C++. Pointer manipulation is important to
the C++ programming language.
Chapter 27 o Pointers and Arrays
558
Array Names as Pointers
An array name is just a pointer, nothing more. To prove this,
suppose you have the following array declaration:
i nt ar a[ 5] = {10, 20, 30, 40, 50};
If you printed ar a[ 0] , you would see 10. Because you now fully
understand arrays, this is the value you would expect.
But what if you were to print *ar a? Would *ar a print anything?
If so, what? If you thought an error message would print because ar a
is not a pointer but an array, you would be wrong. An array name
is a pointer. If you print *ar a, you also would see 10.
Recall how arrays are stored in memory. Figure 27.1 shows
how ar a would be mapped in memory. The array name, ar a, is
nothing more than a pointer pointing to the first element of the array.
Therefore, if you dereference that pointer, you dereference the value
stored in the first element of the array, which is 10. Dereferencing ar a
is exactly the same thing as referencing to ar a[ 0] , because they both
produce the same value.
An array name i s a
poi nter.
Figure 27.1. Storing the array called ar a in memory.
You now see that you can reference an array with subscripts or
with pointer dereferencing. Can you use pointer notation to print
the third element of ar a? Yes, and you already have the tools to do
so. The following cout prints ar a[ 2] (the third element of ar a) without
using a subscript:
cout << *( ar a+2) ; / / Pr i nt s ar a[ 2] .
ar a
559
EXAMPLE
C+ + By
The expression *( ar a+2) is not vague at all, if you remember that
an array name is just a pointer that always points to the arrays first
element. *( ar a+2) takes the address stored in ar a, adds two to the
address, and dereferences that location. The following holds true:
ar a+0 points to ar a[ 0]
ar a+1 points to ar a[ 1]
ar a+2 points to ar a[ 2]
ar a+3 points to ar a[ 3]
ar a+4 points to ar a[ 4]
Therefore, to print, store, or calculate with an array element,
you can use either the subscript notation or the pointer notation.
Because an array name contains the address of the arrays first
element, you must dereference the pointer to get the elements
value.
Internal Locations
C++ knows the internal data size requirements of characters,
integers, floating-points, and the other data types on your
computer. Therefore, because ar a is an integer array, and
because each element in an integer array consumes two to four
bytes of storage, depending on the computer, C++ adds two or
four bytes to the address if you reference arrays as just shown.
If you write *( ar a+3) to refer to ar a[ 3] , C++ would add six or
twelve bytes to the address of ar a to get the third element. C++
does not add an actual three. You do not have to worry about
this, because C++ handles these internals. When you write
*( ar a+3) , you are actually requesting that C++ add three integer
addresses to the address of ar a. If ar a were a floating-point
array, C++ would add three floating-point addresses to ar a.
Chapter 27 o Pointers and Arrays
560
Pointer Advantages
Although arrays are actually pointers in disguise, they are
special types of pointers. An array name is a pointer constant, not a
pointer variable. You cannot change the value of an array name,
because you cannot change constants. This explains why you cannot
assign an array new values during a programs execution. For
instance, even if cname is a character array, the following is not valid
in C++:
cname = Chr i st i ne Chamber s; / / I nval i d ar r ay assi gnment .
The array name, cname, cannot be changed because it is a
constant. You would not attempt the following
5 = 4 + 8 * 21; / / I nval i d assi gnment
because you cannot change the constant 5 to any other value. C++
knows that you cannot assign anything to 5, and C++ prints an error
message if you attempt to change 5. C++ also knows an array name
is a constant and you cannot change an array to another value. (You
can assign values to an array only at declaration time, one element
at a time during execution, or by using functions such as st r cpy( ) .)
This brings you to the most important reason to learn pointers:
pointers (except arrays referenced as pointers) are variables. You
can change a pointer variable, and being able to do so makes
processing virtually any data, including arrays, much more power-
ful and flexible.
Examples
1. By changing pointers, you make them point to different
values in memory. The following program demonstrates
how to change pointers. The program first defines two
floating-point values. A floating-point pointer points to the
first variable, v1, and is used in the cout . The pointer is then
changed so it points to the second floating-point variable, v2.
/ / Fi l ename: C27PTRCH. CPP
/ / Changes t he val ue of a poi nt er var i abl e.
#i ncl ude <i ost r eam. h>
An array name i s a
poi nter constant.
561
EXAMPLE
C+ + By
#i ncl ude <i omani p. h>
voi d mai n( )
{
f l oat v1=676. 54; / / Def i nes t wo
f l oat v2=900. 18; / / f l oat i ng- poi nt var i abl es.
f l oat * p_v; / Def i nes a f l oat i ng- poi nt poi nt er .
p_v = &v1; / / Makes poi nt er poi nt t o v1.
cout << The f i r st val ue i s << set pr eci si on( 2) <<
*p_v << \ n; / / Pr i nt s 676. 54.
p_v = &v2; / / Changes t he poi nt er so i t
/ / poi nt s t o v2.
cout << The second val ue i s << set pr eci si on( 2) <<
*p_v << \ n; / / Pr i nt s 900. 18.
r et ur n;
}
Because they can change pointers, most C++ programmers
use pointers rather than arrays. Because arrays are easy to
declare, C++ programmers sometimes declare arrays and
then use pointers to reference those arrays. If the array data
changes, the pointer helps to change it.
2. You can use pointer notation and reference pointers as
arrays with array notation. The following program declares
an integer array and an integer pointer that points to the
start of the array. The array and pointer values are printed
using subscript notation. Afterwards, the program uses
array notation to print the array and pointer values.
Study this program carefully. You see the inner workings of
arrays and pointer notation.
/ / Fi l ename: C27ARPTR. CPP
/ / Ref er ences ar r ays l i ke poi nt er s and
/ / poi nt er s l i ke ar r ays.
#i ncl ude <i ost r eam. h>
voi d mai n( )
{
i nt ct r ;
i nt i ar a[ 5] = {10, 20, 30, 40, 50};
Chapter 27 o Pointers and Arrays
562
i nt *i pt r ;
i pt r = i ar a; / / Make i pt r poi nt t o ar r ay s f i r st
/ / el ement . Thi s woul d wor k al so:
/ / i pt r = &i ar a[ 0] ;
cout << Usi ng ar r ay subscr i pt s: \ n;
cout << i ar a\ t i pt r \ n;
f or ( ct r =0; ct r <5; ct r ++)
{ cout << i ar a[ ct r ] << \ t << i pt r [ ct r ] << \ n; }
cout << \ nUsi ng poi nt er not at i on: \ n;
cout << i ar a\ t i pt r \ n;
f or ( ct r =0; ct r <5; ct r ++)
{ cout << *( i ar a+ct r ) << \ t << *( i pt r +ct r ) << \ n; }
r et ur n;
}
Here is the programs output:
Usi ng ar r ay subscr i pt s:
i ar a i pt r
10 10
20 20
30 30
40 40
50 50
Usi ng poi nt er not at i on:
i ar a i pt r
10 10
20 20
30 30
40 40
50 50
563
EXAMPLE
C+ + By
Using Charac ter Pointers
The ability to change pointers is best seen when working with
character strings in memory. You can store strings in character
arrays, or point to them with character pointers. Consider the
following two string definitions:
char car a[ ] = C++ i s f un; / / An ar r ay hol di ng a st r i ng
char *cpt r = C++ By Exampl e; / / A poi nt er t o t he st r i ng
Figure 27.2 shows how C++ stores these two strings in memory.
C++ stores both in basically the same way. You are familiar with the
array definition. When assigning a string to a character pointer, C++
finds enough free memory to hold the string and assign the address
of the first character to the pointer. The previous two string defini-
tion statements do almost exactly the same thing; the only difference
between them is that the two pointers can easily be exchanged (the
array name and the character pointers).
Because cout prints strings starting at the array or pointer name
until the null zero is reached, you can print each of these strings with
the following cout statements:
cout << St r i ng 1: << car a << \ n;
cout << St r i ng 2: << cpt r << \ n;
You print strings in arrays and pointed-to strings the same
way. You might wonder what advantage one method of storing
strings has over the other. The seemingly minor difference between
these stored strings makes a big difference when you change them.
Suppose you want to store the string Hel l o in the two strings.
You cannot assign the string to the array like this:
car a = Hel l o; / / I nval i d
Because you cannot change the array name, you cannot assign
it a new value. The only way to change the contents of the array is by
assigning the array characters from the string an element at a time,
or by using a built-in function such as st r cpy( ) . You can, however,
make the character array point to the new string like this:
Character poi nters
can poi nt to the fi rst
character of a stri ng.
Chapter 27 o Pointers and Arrays
564
cpt r = Hel l o; / / Change t he poi nt er so
/ / i t poi nt s t o t he new st r i ng.
Figure 27.2. Storing two strings: One in an array and one pointed to by a
pointer variable.
565
EXAMPLE
C+ + By
TIP: If you want to store user input in a string pointed to by a
pointer, first you must reserve enough storage for that input
string. The easiest way to do this is to reserve a character array,
then assign a character pointer to the beginning element of that
array like this:
char i nput [ 81] ; / / Hol ds a st r i ng as l ong as
/ / 80 char act er s.
char *i pt r =i nput ; / / Al so coul d have done t hi s:
/ / char *i pt r =&i nput [ 0] ;
Now you can input a string by using the pointer:
get s( i pt r ) ; / / Make sur e i pt r poi nt s t o
/ / t he st r i ng t yped by t he user .
You can use pointer manipulation, arithmetic, and modifica-
tion on the input string.
Examples
1. Suppose you want to store your sisters full name and print
it. Rather than using arrays, you can use a character pointer.
The following program does just that.
/ / Fi l ename: C27CP1. CPP
/ / St or es a name i n a char act er poi nt er .
#i ncl ude <i ost r eam. h>
voi d mai n( )
{
char *c=Bet t ye Lou Hor n;
cout << My si st er s name i s << c << \ n;
r et ur n;
}
This prints the following:
My si st er s name i s Bet t ye Lou Hor n
Chapter 27 o Pointers and Arrays
566
2. Suppose you must change a string pointed to by a character
pointer. If your sister changed her last name to Henderson,
your program can show both strings in the following man-
ner:
Identify the program and include the I/O header file. This program
uses a character pointer, c, to point to a string literal in memory.
Point to the string literal, and print the string. Make the character-
pointer point to a new string literal, then print the new string.
/ / Fi l ename: C27CP2. CPP
/ / I l l ust r at es changi ng a char act er st r i ng.
#i ncl ude <i ost r eam. h>
voi d mai n( )
{
char *c=Bet t ye Lou Hor n;
cout << My si st er s mai den name was << c << \ n;
c = Bet t ye Lou Hender son; / / Assi gns new st r i ng t o c.
cout << My si st er s mar r i ed name i s << c << \ n;
r et ur n;
}
The output is as follows:
My si st er s mai den name was Bet t ye Lou Hor n
My si st er s mar r i ed name i s Bet t ye Lou Hender son
3. Do not use character pointers to change string constants.
Doing so can confuse the compiler, and you probably will
not get the results you expect. The following program is
similar to those you just saw. Rather than making the charac-
ter pointer point to a new string, this example attempts to
change the contents of the original string.
/ / Fi l ename: C27CP3. CPP
/ / I l l ust r at es changi ng a char act er st r i ng i mpr oper l y.
#i ncl ude <i ost r eam. h>
voi d mai n( )
567
EXAMPLE
C+ + By
{
char *c=Bet t ye Lou Hor n;
cout << My si st er s mai den name was << c << \ n;
c += 11; / / Makes c poi nt t o t he l ast name
/ / ( t he t wel f t h char act er ) .
c = Hender son; / / Assi gns a new st r i ng t o c.
cout << My si st er s mar r i ed name i s << c << \ n;
r et ur n;
}
The program seems to change the last name from Horn
to Henderson, but it does not. Here is the output of this
program:
My si st er s mai den name was Bet t ye Lou Hor n
My si st er s mar r i ed name i s Hender son
Why didnt the full string print? Because the address
pointed to by c was incremented by 11, c still points to
Hender son, so that was all that printed.
4. You might guess at a way to fix the previous program.
Rather than printing the string stored at c after assigning it
to Hender son, you might want to decrement it by 11 so it
points to its original location, the start of the name. The code
to do this follows, but it does not work as expected. Study
the program before reading the explanation.
/ / Fi l ename: C27CP4. C
/ / I l l ust r at es changi ng a char act er st r i ng i mpr oper l y.
#i ncl ude <i ost r eam. h>
voi d mai n( )
{
char *c=Bet t ye Lou Hor n;
cout << My si st er s mai den name was << c << \ n;
c += 11; / / Makes c poi nt t o t he l ast
/ / name ( t he t wel f t h char act er ) .
Chapter 27 o Pointers and Arrays
568
c = Hender son; / / Assi gns a new st r i ng t o c.
c - = 11; / / Makes c poi nt t o i t s
/ / or i gi nal l ocat i on ( ???) .
cout << My si st er s mar r i ed name i s << c << \ n;
r et ur n;
}
This program produces garbage at the second cout . There are
actually two string literals in this program. When you first
assign c to Bet t ye Lou Hor n, C++ reserves space in memory
for the constant string and puts the starting address of the
string in c.
When the program then assigns c to Hender son, C++ finds
room for another character constant, as shown in Figure 27.3.
If you subtract 11 from the location of c, after it points to the
new string Hender son, c points to an area of memory your
program is not using. There is no guarantee that printable
data appears before the string constant Hender son. If you want
to manipulate parts of the string, you must do so an element
at a time, just as you must with arrays.
Pointer Arithmetic
You saw an example of pointer arithmetic when you accessed
array elements with pointer notation. By now you should be com-
fortable with the fact that both of these array or pointer references
are identical:
ar a[ sub] and *( ar a + sub)
You can increment or decrement a pointer. If you increment a
pointer, the address inside the pointer variable increments. The
pointer does not always increment by one, however.
Suppose f _pt r is a floating-point pointer indexing the first
element of an array of floating-point numbers. You could initialize
f _pt r as follows:
f l oat f ar a[ ] = {100. 5, 201. 45, 321. 54, 389. 76, 691. 34};
f _pt r = f ar a;
569
EXAMPLE
C+ + By
New string in memory
Figure 27.3. Two string constants appear in memory because two string
constants are used in the program.
Chapter 27 o Pointers and Arrays
570
Figure 27.4 shows what these variables look like in memory.
Each floating-point value in this example takes four bytes of memory.
Figure 27.4. A floating-point array and a pointer.
If you print the value of *f _pt r , you see 100.5. Suppose you
increment f _pt r by one with the following statement:
f _pt r ++;
C++ does not add one to the address in f _pt r , even though it
seems as though one should be added. In this case, because floating-
point values take four bytes each on this machine, C++ adds four to
f _pt r . How does C++ know how many bytes to add to f _pt r ? C++
knows from the pointers declaration how many bytes of memory
pointers take. This is why you have to declare the pointer with the
correct data type.
After incrementing f _pt r , if you were to print *f _pt r , you would
see 201. 45, the second element in the array. If C++ added only one to
the address in f _pt r , f _pt r would point only to the second byte, 100. 5.
This would output garbage to the screen.
NOTE: When you increment a pointer, C++ adds one full data-
type size (in bytes) to the pointer, not one byte. When you
decrement a pointer, C++ subtracts one full data type size (in
bytes) from the pointer.
Incrementi ng a
poi nter can add
more than one byte
to the poi nter.
571
EXAMPLE
C+ + By
Examples
1. The following program defines an array with five values. An
integer pointer is then initialized to point to the first element
in the array. The rest of the program prints the dereferenced
value of the pointer, then increments the pointer so it points
to the next integer in the array.
Just to show you what is going on, the size of integer values
is printed at the bottom of the program. Because (in this
case) integers take two bytes, C++ increments the pointer by
two so it points to the next integer. (The integers are two
bytes apart from each other.)
/ / Fi l ename: C27PTI . CPP
/ / I ncr ement s a poi nt er t hr ough an i nt eger ar r ay.
#i ncl ude <i ost r eam. h>
voi d mai n( )
{
i nt i ar a[ ] = {10, 20, 30, 40, 50};
i nt *i p = i ar a; / / The poi nt er poi nt s t o
/ / The st ar t of t he ar r ay.
cout << *i p << \ n;
i p++; / / Two ar e act ual l y added.
cout << *i p << \ n;
i p++; / / Two ar e act ual l y added.
cout << *i p << \ n;
i p++; / / Two ar e act ual l y added.
cout << *i p << \ n;
i p++; / / Two ar e act ual l y added.
cout << *i p << \ n\ n;
cout << The i nt eger si ze i s << si zeof ( i nt ) ;
cout << byt es on t hi s machi ne \ n\ n;
r et ur n;
}
Chapter 27 o Pointers and Arrays
572
Here is the output from the program:
10
20
30
40
50
The i nt eger si ze i s t wo byt es on t hi s machi ne
2. Here is the same program using a character array and a
character pointer. Because a character takes only one byte of
storage, incrementing a character pointer actually adds just
one to the pointer; only one is needed because the characters
are only one byte apart.
/ / Fi l ename: C27PTC. CPP
/ / I ncr ement s a poi nt er t hr ough a char act er ar r ay.
#i ncl ude <i ost r eam. h>
voi d mai n( )
{
char car a[ ] = { a , b , c , d , e };
char *cp = car a; / / The poi nt er s poi nt t o
/ / t he st ar t of t he ar r ay.
cout << *cp << \ n;
cp++; / / One i s act ual l y added.
cout << *cp << \ n;
cp++; / / One i s act ual l y added.
cout << *cp << \ n;
cp++; / / One i s act ual l y added.
cout << *cp << \ n;
cp++; / / One i s act ual l y added.
cout << *cp << \ n\ n;
cout << The char act er si ze i s << si zeof ( char ) ;
cout << byt e on t hi s machi ne\ n;
r et ur n;
}
3. The next program shows the many ways you can add to,
subtract from, and reference arrays and pointers. The pro-
gram defines a floating-point array and a floating-point
pointer. The body of the program prints the values from the
array using array and pointer notation.
573
EXAMPLE
C+ + By
/ / Fi l ename: C27ARPT2. CPP
/ / Compr ehensi ve r ef er ence of ar r ays and poi nt er s.
#i ncl ude <i ost r eam. h>
voi d mai n( )
{
f l oat ar a[ ] = {100. 0, 200. 0, 300. 0, 400. 0, 500. 0};
f l oat *f pt r ; / / Fl oat i ng- poi nt poi nt er .
/ / Make poi nt er poi nt t o ar r ay s f i r st val ue.
f pt r = &ar a[ 0] ; / / Al so coul d have been t hi s:
/ / f pt r = ar a;
cout << *f pt r << \ n; / / Pr i nt s 100. 0
f pt r ++; / / Poi nt s t o next f l oat i ng- poi nt val ue.
cout << *f pt r << \ n; / / Pr i nt s 200. 0
f pt r ++; / / Poi nt s t o next f l oat i ng- poi nt val ue.
cout << *f pt r << \ n; / / Pr i nt s 300. 0
f pt r ++; / / Poi nt s t o next f l oat i ng- poi nt val ue.
cout << *f pt r << \ n; / / Pr i nt s 400. 0
f pt r ++; / / Poi nt s t o next f l oat i ng- poi nt val ue.
cout << *f pt r << \ n; / / Pr i nt s 500. 0
f pt r = ar a; / / Poi nt s t o f i r st el ement agai n.
cout << *( f pt r +2) << \ n; / / Pr i nt s 300. 00 but
/ / does not change f pt r .
/ / Ref er ences bot h ar r ay and poi nt er usi ng subscr i pt s.
cout << ( f pt r +0) [ 0] << << ( ar a+0) [ 0] << \ n;
/ / 100. 0 100. 0
cout << ( f pt r +1) [ 0] << << ( ar a+1) [ 0] << \ n;
/ / 200. 0 200. 0
cout << ( f pt r +4) [ 0] << << ( ar a+4) [ 0] << \ n;
/ / 500. 0 500. 0
r et ur n;
}
The following is the output from this program:
100. 0
200. 0
300. 0
400. 0
Chapter 27 o Pointers and Arrays
574
500. 0
300. 0
100. 0 100. 0
200. 0 200. 0
500. 0 500. 0
Arrays of Strings
You now are ready for one of the most useful applications of
character pointers: storing arrays of strings. Actually, you cannot
store an array of strings, but you can store an array of character
pointers, and each character pointer can point to a string in memory.
By defining an array of character pointers, you define a ragged-
edge array. A ragged-edge array is similar to a two-dimensional
table, except each row contains a different number of characters
(instead of being the same length).
The word ragged-edge derives from the use of word processors.
A word processor typically can print text fully justified or with a
ragged-right margin. The columns of this paragraph are fully justi-
fied, because both the left and the right columns align evenly. Letters
you write by hand and type on typewriters (remember what a
typewriter is?) generally have ragged-right margins. It is difficult to
type so each line ends in exactly the same right column.
All two-dimensional tables you have seen so far have been fully
justified. For example, if you declared a character table with five
rows and 20 columns, each row would contain the same number of
characters. You could define the table with the following statement:
char names[ 5] [ 20] ={ {Geor ge},
{Mi chel l e},
{J oe},
{Mar cus},
{St ephani e} };
This table is shown in Figure 27.5. Notice that much of the table
is wasted space. Each row takes 20 characters, even though the data
in each row takes far fewer characters. The unfilled elements contain
null zeros because C++ nullifies all elements you do not initialize in
arrays. This type of table uses too much memory.
An array that a
character poi nter
defi nes i s a ragged-
edge array.
575
EXAMPLE
C+ + By
Figure 27.5. A fully justified table.
To fix the memory-wasting problem of fully justified tables,
you should declare a single-dimensional array of character pointers.
Each pointer points to a string in memory, and the strings do not
have to be the same length.
Here is the definition for such an array:
char *names[ 5] ={ {Geor ge},
{Mi chel l e},
{J oe},
{Mar cus},
{St ephani e} };
This array is single-dimensional. The definition should not
confuse you, although it is something you have not seen. The
asterisk before names makes this an array of pointers. The data type
of the pointers is character. The strings are not being assigned to the
array elements, but they are being pointed to by the array elements.
Figure 27.6 shows this array of pointers. The strings are stored
elsewhere in memory. Their actual locations are not critical because
each pointer points to the starting character. The strings waste
no data. Each string takes only as much memory as needed by the
string and its terminating zero. This gives the data its ragged-right
appearance.
Most of the table is wasted
Rows
Columns
Chapter 27 o Pointers and Arrays
576
Figure 27.6. The array that points to each of the five strings.
To print the first string, you would use this cout :
cout << *names; / / Pr i nt s Geor ge
To print the second string, you would use this cout :
cout << *( names+1) ; / / Pr i nt s Mi chel l e
Whenever you dereference any pointer element with the *
dereferencing operator, you access one of the strings in the array.
You can use a dereferenced element any place you use a string
constant or character array (with st r cpy( ) , st r cmp( ) , and so on).
TIP: Working with pointers to strings is much more efficient
than working directly with the strings. For instance, sorting a
list of strings takes much time if they are stored as a fully
justified table. Sorting strings pointed to by a pointer array is
much faster. You swap only pointers during the sort, not entire
strings.
Examples
1. Here is a full program that uses the pointer array with five
names. The f or loop controls the cout function, printing each
name in the string data. Now you can see why learning
about pointer notation for arrays pays off!
/ / Fi l ename: C27PTST1. CPP
/ / Pr i nt s st r i ngs poi nt ed t o by an ar r ay.
#i ncl ude <i ost r eam. h>
577
EXAMPLE
C+ + By
voi d mai n( )
{
char *name[ 5] ={ {Geor ge}, / / Def i nes a r agged- edge
{Mi chel l e}, / / ar r ay of poi nt er s t o
{J oe}, / / st r i ngs.
{Mar cus},
{St ephani e} };
i nt ct r ;
f or ( ct r =0; ct r <5; ct r ++)
{ cout << St r i ng # << ( ct r +1) <<
i s << *( name+ct r ) << \ n; }
r et ur n;
}
The following is the output from this program:
St r i ng #1 i s Geor ge
St r i ng #2 i s Mi chel l e
St r i ng #3 i s J oe
St r i ng #4 i s Mar cus
St r i ng #5 i s St ephani e
2. The following program stores the days of the week in an
array. When the user types a number from 1 to 7, the day of
the week that matches that number (with Sunday being 1)
displays by dereferencing the pointer referencing that string.
/ / Fi l ename: C27PTST2. CPP
/ / Pr i nt s t he day of t he week based on an i nput val ue.
#i ncl ude <i ost r eam. h>
voi d mai n( )
{
char *days[ ] = {Sunday, / / The seven separ at e set s
Monday, / / of br aces ar e opt i onal .
Tuesday,
Wednesday,
Thur sday,
Fr i day,
Sat ur day};
i nt day_num;
Chapter 27 o Pointers and Arrays
578
do
{ cout << What i s a day number ( f r om1 t o 7) ? ;
ci n >> day_num;
} whi l e ( ( day_num<1) | | ( day_num>7) ) ; / / Ensur es
/ / an accur at e number .
day_num- - ; / / Adj ust s f or subscr i pt .
cout << The day i s << *( days+day_num) << \ n;
r et ur n;
}
Review Questions
The answers to the review questions are in Appendix B.
1. What is the difference between an array name and a pointer?
2. If you performed the following statement (assume i poi nt er
points to integers that take four bytes of memory),
i poi nt er += 2;
how many bytes are added to i poi nt er ?
3. Which of the following are equivalent, assuming i ar y is an
integer array and i pt r is an integer pointer pointing to the
start of the array?
a. i ar y and i pt r
b. i ar y[ 1] and i pt r +1
c. i ar y[ 3] and *( i pt r + 3)
d. *i ar y and i ar y[ 0]
e. i ar y[ 4] and *i pt r +4
4. Why is it more efficient to sort a ragged-edge character array
than a fully justified string array?
579
EXAMPLE
C+ + By
5. Given the following array and pointer definition
i nt ar a[ ] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
i nt *i p1, *i p2;
which of the following is allowed?
a. i p1 = ar a;
b. i p2 = i p1 = &ar a[ 3] ;
c. ar a = 15;
d. *( i p2 + 2) = 15; / / Assumi ng i p2 and ar a ar e equal .
Review Exerc ises
1. Write a program to store your family members names in a
character array of pointers. Print the names.
2. Write a program that asks the user for 15 daily stock market
averages and stores those averages in a floating-point array.
Using only pointer notation, print the array forward and
backward. Again using only pointer notation, print the
highest and lowest stock market quotes in the list.
3. Modify the bubble sort shown in Chapter 24, Array Pro-
cessing, so that it sorts using pointer notation. Add this
bubble sort to the program in Exercise 2 to print the stock
market averages in ascending order
4. Write a program that requests 10 song titles from the user.
Store the titles in an array of character pointers (a ragged-
edge array). Print the original titles, print the alphabetized
titles, and print the titles in reverse alphabetical order (from
Z to A).
Chapter 27 o Pointers and Arrays
580
Summary
You deserve a break! You now understand the foundation of
C++s pointers and array notation. When you have mastered this
section, you are on your way to thinking in C++ as you design your
programs. C++ programmers know that C++s arrays are pointers
in disguise, and they program them accordingly.
Being able to use ragged-edge arrays offers two advantages:
You can hold arrays of string data without wasting extra space, and
you can quickly change the pointers without having to move the
string data around in memory.
As you progress into advanced C++ concepts, you will appre-
ciate the time you spend mastering pointer notation. The next
chapter introduces a new topic called structures. Structures enable
you to store data in a more unified manner than simple variables
have allowed.
Part VII
Structures and File
Input/Output
583
EXAMPLE
C+ + By
28
Struc tures
Using structures, you have the ability to group data and work with
the grouped data as a whole. Business data processing uses the
concept of structures in almost every program. Being able to ma-
nipulate several variables as a single group makes your programs
easier to manage.
This chapter introduces the following concepts:
o Structure definitions
o Initializing structures
o The dot operator (. )
o Structure assignment
o Nested structures
This chapter is one of the last in the book to present new
concepts. The remainder of the book builds on the structure con-
cepts you learn in this chapter.
Chapter 28 o Structures
584
Introduc tion to Struc tures
A structure is a collection of one or more variable types. As you
know, each element in an array must be the same data type, and you
must refer to the entire array by its name. Each element (called a
member) in a structure can be a different data type.
Suppose you wanted to keep track of your CD music collection.
You might want to track the following pieces of information about
each CD:
Title
Artist
Number of songs
Cost
Date purchased
There would be five members in this CD structure.
TIP: If you have programmed in other computer languages, or
if you have ever used a database program, C++ structures are
analogous to file records, and members are analogous to fields
in those records.
After deciding on the members, you must decide what data
type each member is. The title and artist are character arrays, the
number of songs is an integer, the cost is floating-point, and the date
is another character array. This information is represented like this:
Member Name Data Type
Title Character array of 25 characters
Artist Character array of 20 characters
Number of songs Integer
Cost Floating-point
Date purchased Character array of eight characters
Structures can have
members of di fferent
data types.
585
EXAMPLE
C+ + By
Each structure you define can have an associated structure
name called a structure tag. Structure tags are not required in most
cases, but it is generally best to define one for each structure in your
program. The structure tag is not a variable name. Unlike array
names, which reference the array as variables, a structure tag is
simply a label for the structures format.
You name structure tags yourself, using the same naming rules
for variables. If you give the CD structure a structure tag named
cd_col l ect i on, you are informing C++ that the tag called cd_col l ect i on
looks like two character arrays, followed by an integer, a floating-
point value, and a final character array.
A structure tag is actually a newly defined data type that you,
the programmer, define. When you want to store an integer, you do
not have to define to C++ what an integer is. C++ already recognizes
an integer. When you want to store a CD collections data, however,
C++ is not capable of recognizing what format your CD collection
takes. You have to tell C++ (using the example being described here)
that you need a new data type. That data type will be your structure
tag, called cd_col l ect i on in this example, and it looks like the struc-
ture previously described (two character arrays, integer, floating-
point, and character array).
NOTE: No memory is reserved for structure tags. A structure
tag is your own data type. C++ does not reserve memory for the
integer data type until you declare an integer variable. C++
does not reserve memory for a structure until you declare a
structure variable.
Figure 28.1 shows the CD structure, graphically representing
the data types in the structure. Notice that there are five members
and each member is a different data type. The entire structure is
called cd_col l ect i on because that is the structure tag.
A structure tag i s
a l abel for the
structures format.
Chapter 28 o Structures
586
Figure 28.1. The layout of the cd_col l ect i on structure.
NOTE: The mailing-list application in Appendix F uses a
structure to hold peoples names, addresses, cities, states, and
ZIP codes.
Examples
1. Suppose you were asked to write a program for a companys
inventory system. The company had been using a card-file
inventory system to track the following items:
Item name
Quantity in stock
Quantity on order
Retail price
Wholesale price
This would be a perfect use for a structure containing five
members. Before defining the structure, you have to deter-
mine the data types of each member. After asking questions
about the range of data (you must know the largest item
name, and the highest possible quantity that would appear
on order to ensure your data types can hold the data), you
decide to use the following structure tag and data types:
587
EXAMPLE
C+ + By
Member Data Type
Item name Character array of 20 characters
Quantity in stock l ong i nt
Quantity on order l ong i nt
Retail price doubl e
Wholesale price doubl e
2. Suppose the same company also wanted you to write a
program to keep track of their monthly and annual salaries
and to print a report at the end of the year that showed each
months individual salary and the total salary at the end of
the year.
What would the structure look like? Be careful! This type of
data probably does not need a structure. Because all the
monthly salaries must be the same data type, a floating-
point or a double floating-point array holds the monthly
salaries nicely without the complexity of a structure.
Structures are useful for keeping track of data that must be
grouped, such as inventory data, a customers name and
address data, or an employee data file.
Defining Struc tures
To define a structure, you must use the st r uct statement. The
st r uct statement defines a new data type, with more than one
member, for your program. The format of the st r uct statement is
st r uct [ st r uct ur e t ag]
{
member def i ni t i on;
member def i ni t i on;
:
member def i ni t i on;
} [ one or mor e st r uct ur e var i abl es] ;
Chapter 28 o Structures
588
As mentioned earlier, st r uct ur e t ag is optional (hence the
brackets in the format). Each member def i ni t i on is a normal variable
definition, such as i nt i ; or f l oat sal es[ 20] ; or any other valid
variable definition, including variable pointers if the structure re-
quires a pointer as a member. At the end of the structures definition,
before the final semicolon, you can specify one or more structure
variables.
If you specify a structure variable, you request C++ to reserve
space for that variable. This enables C++ to recognize that the
variable is not integer, character, or any other internal data type.
C++ also recognizes that the variable must be a type that looks like
the structure. It might seem strange that the members do not reserve
storage, but they dont. The structure variables do. This becomes
clear in the examples that follow.
Here is the way you declare the CD structure:
st r uct cd_col l ect i on
{
char t i t l e[ 25] ;
char ar t i st [ 20] ;
i nt num_songs;
f l oat pr i ce;
char dat e_pur ch[ 9] ;
} cd1, cd2, cd3;
Before going any further, you should be able to answer the
following questions about this structure:
o What is the structure tag?
o How many members are there?
o What are the member data types?
o What are the member names?
o How many structure variables are there?
o What are their names?
The structure tag is called cd_col l ect i on. There are five mem-
bers, two character arrays, an integer, a floating-point, and a charac-
ter array. The member names are t i t l e, ar t i st , num_songs, pr i ce, and
dat e_pur ch. There are three structure variablescd1, cd2, and cd3.
589
EXAMPLE
C+ + By
TIP: Often, you can visualize structure variables as a card-file
inventory system. Figure 28.2 shows how you might keep your
CD collection in a 3-by-5 card file. Each CD takes one card
(represented by its structure variable), which contains the
information about that CD (the structure members).
Figure 28.2. Using a card-file CD inventory system.
If you had 1000 CDs, you would have to declare 1000 structure
variables. Obviously, you would not want to list that many structure
variables at the end of a structure definition. To help define struc-
tures for a large number of occurrences, you must define an array of
structures. Chapter 29, Arrays of Structures, shows you how to do
that. For now, concentrate on familiarizing yourself with structure
definitions.
Examples
1. Here is a structure definition of the inventory application
described earlier in this chapter.
Chapter 28 o Structures
590
st r uct i nvent or y
{
char i t em_name[ 20] ;
l ong i nt i n_st ock;
l ong i nt or der _qt y;
f l oat r et ai l ;
f l oat whol esal e;
} i t em1, i t em2, i t em3, i t em4;
Four inventory structure variables are defined. Each struc-
ture variablei t em1, i t em2, i t em3, and i t em4looks like the
structure.
2. Suppose a company wanted to track its customers and
personnel. The following two structure definitions would
create five structure variables for each structure. This ex-
ample, having five employees and five customers, is very
limited, but it shows how structures can be defined.
st r uct empl oyees
{
char emp_name[ 25] ; / / Empl oyee s f ul l name.
char addr ess[ 30] ; / / Empl oyee s addr ess.
char ci t y[ 10] ;
char st at e[ 2] ;
l ong i nt zi p;
doubl e sal ar y; / / Annual sal ar y.
} emp1, emp2, emp3, emp4, emp5;
st r uct cust omer s
{
char cust _name[ 25] ; / / Cust omer s f ul l name.
char addr ess[ 30] ; / / Cust omer s addr ess.
char ci t y[ 10] ;
char st at e[ 2] ;
l ong i nt zi p;
doubl e bal ance; / / Bal ance owed t o company.
} cust 1, cust 2, cust 3, cust 4, cust 5;
Each structure has similar data. Later in this chapter, you
learn how to consolidate similar member definitions by
creating nested structures.
591
EXAMPLE
C+ + By
TIP: Put comments to the right of members in order to docu-
ment the purpose of the members.
Initializing Struc ture Data
There are two ways to initialize members of a structure. You
can initialize members when you declare a structure, and you can
initialize a structure in the body of the program. Most programs lend
themselves to the latter method, because you do not always know
structure data when you write your program.
Here is an example of a structure declared and initialized at the
same time:
st r uct cd_col l ect i on
{
char t i t l e[ 25] ;
char ar t i st [ 20] ;
i nt num_songs;
f l oat pr i ce;
char dat e_pur ch[ 9] ;
} cd1 = {Red Moon Men, Samand t he Sneeds,
12, 11. 95, 02/ 13/ 92};
When first learning about structures, you might be tempted to
initialize members individually inside the structure, such as
char ar t i st [ 20] =Samand t he Sneeds; / / I nval i d
You cannot initialize individual members because they are not
variables. You can assign only values to variables. The only struc-
ture variable in this structure is cd1. The braces must enclose the data
you initialize in the structure variables, just as they enclose data
when you initialize arrays.
This method of initializing structure variables becomes tedious
when there are several structure variables (as there usually are).
Putting the data in several variables, each set of data enclosed in
braces, becomes messy and takes too much space in your code.
You can defi ne a
structures data when
you decl are the
structure.
Chapter 28 o Structures
592
More importantly, you usually do not even know the contents
of the structure variables. Generally, the user enters data to be stored
in structures, or you read them from a disk file.
A better approach to initializing structures is to use the dot
operator (. ). The dot operator is one way to initialize individual
members of a structure variable in the body of your program. With
the dot operator, you can treat each structure member almost as if it
were a regular nonstructure variable.
The format of the dot operator is
st r uct ur e_var i abl e_name. member _name
A structure variable name must always precede the dot opera-
tor, and a member name must always appear after the dot operator.
Using the dot operator is easy, as the following examples show.
Examples
1. Here is a simple program using the CD collection structure
and the dot operator to initialize the structure. Notice the
program treats members as if they were regular variables
when combined with the dot operator.
Identify the program and include the necessary header file. Define
a CD structure variable with five members. Fill the CD structure
variable with data, then print it.
/ / Fi l ename: C28ST1. CPP
/ / St r uct ur e i ni t i al i zat i on wi t h t he CD col l ect i on.
#i ncl ude <i ost r eam. h>
#i ncl ude <st r i ng. h>
voi d mai n( )
{
st r uct cd_col l ect i on
{
char t i t l e[ 25] ;
char ar t i st [ 20] ;
i nt num_songs;
f l oat pr i ce;
char dat e_pur ch[ 9] ;
} cd1;
Use the dot operator
to i ni ti al i ze members
of structures.
593
EXAMPLE
C+ + By
/ / I ni t i al i ze member s her e.
st r cpy( cd1. t i t l e, Red Moon Men) ;
st r cpy( cd1. ar t i st , Samand t he Sneeds) ;
cd1. num_songs=12;
cd1. pr i ce=11. 95;
st r cpy( cd1. dat e_pur ch, 02/ 13/ 92) ;
/ / Pr i nt t he dat a t o t he scr een.
cout << Her e i s t he CD i nf or mat i on: \ n\ n;
cout << Ti t l e: << cd1. t i t l e << \ n;
cout << Ar t i st : << cd1. ar t i st << \ n;
cout << Songs: << cd1. num_songs << \ n;
cout << Pr i ce: << cd1. pr i ce << \ n;
cout << Dat e pur chased: << cd1. dat e_pur ch << \ n;
r et ur n;
}
Here is the output from this program:
Her e i s t he CD i nf or mat i on:
Ti t l e: Red Moon Men
Ar t i st : Samand t he Sneeds
Songs: 12
Pr i ce: 11. 95
Dat e pur chased: 02/ 13/ 92
2. By using the dot operator, you can receive structure data
from the keyboard with any of the data-input functions you
know, such as ci n, get s( ) , and get .
The following program asks the user for student informa-
tion. To keep the example reasonably short, only two stu-
dents are defined in the program.
/ / Fi l ename: C28ST2. CPP
/ / St r uct ur e i nput wi t h st udent dat a.
#i ncl ude <i ost r eam. h>
#i ncl ude <st r i ng. h>
#i ncl ude <i omani p. h>
#i ncl ude <st di o. h>
Chapter 28 o Structures
594
voi d mai n( )
{
st r uct st udent s
{
char name[ 25] ;
i nt age;
f l oat aver age;
} st udent 1, st udent 2;
/ / Get dat a f or t wo st udent s.
cout << What i s f i r st st udent s name? ;
get s( st udent 1. name) ;
cout << What i s t he f i r st st udent s age? ;
ci n >> st udent 1. age;
cout << What i s t he f i r st st udent s aver age? ;
ci n >> st udent 1. aver age;
f f l ush( st di n) ; / / Cl ear i nput buf f er f or next i nput .
cout << \ nWhat i s second st udent s name? ;
get s( st udent 2. name) ;
cout << What i s t he second st udent s age? ;
ci n >> st udent 2. age;
cout << What i s t he second st udent s aver age? ;
ci n >> st udent 2. aver age;
/ / Pr i nt t he dat a.
cout << \ n\ nHer e i s t he st udent i nf or mat i on you <<
ent er ed: \ n\ n;
cout << St udent #1: \ n;
cout << Name: << st udent 1. name << \ n;
cout << Age: << st udent 1. age << \ n;
cout << Aver age: << set pr eci si on( 2) << st udent 1. aver age
<< \ n;
cout << \ nSt udent #2: \ n;
cout << Name: << st udent 2. name << \ n;
cout << Age: << st udent 2. age << \ n;
cout << Aver age: << st udent 2. aver age << \ n;
r et ur n;
}
595
EXAMPLE
C+ + By
Here is the output from this program:
What i s f i r st st udent s name? Lar r y
What i s t he f i r st st udent s age? 14
What i s t he f i r st st udent s aver age? 87. 67
What i s second st udent s name? J udy
What i s t he second st udent s age? 15
What i s t he second st udent s aver age? 95. 38
Her e i s t he st udent i nf or mat i on you ent er ed:
St udent #1:
Name: Lar r y
Age: 14
Aver age: 87. 67
St udent #2:
Name: J udy
Age: 15
Aver age: 95. 38
3. Structure variables are passed by copy, not by address as
arrays are. Therefore, if you fill a structure in a function, you
must return it to the calling function in order for the calling
function to recognize the structure, or use global structure
variables, which is generally not recommended.
TIP: A good solution to the local/global structure problem
is this: Define your structures globally without any structure
variables. Define all your structure variables locally to the
functions that need them. As long as your structure definition
is global, you can declare local structure variables from that
structure. All subsequent examples in this book use this method.
The structure tag plays an important role in the local/global
problem. Use the structure tag to define local structure
variables. The following program is similar to the previous
one. Notice the student structure is defined globally with no
Defi ne structures
gl obal l y and
structure vari abl es
l ocal l y.
Chapter 28 o Structures
596
structure variables. In each function, local structure variables
are declared by referring to the structure tag. The structure
tag keeps you from having to redefine the structure mem-
bers every time you define a new structure variable.
/ / Fi l ename: C28ST3. CPP
/ / St r uct ur e i nput wi t h st udent dat a passed t o f unct i ons.
#i ncl ude <i ost r eam. h>
#i ncl ude <st r i ng. h>
#i ncl ude <st di o. h>
#i ncl ude <i omani p. h>
st r uct st udent s f i l l _st r uct s( st r uct st udent s st udent _var ) ;
voi d pr _st udent s( st r uct st udent s st udent _var ) ;
st r uct st udent s / / A gl obal st r uct ur e.
{
char name[ 25] ;
i nt age;
f l oat aver age;
}; / / No memor y r eser ved.
voi d mai n( )
{
st udent s st udent 1, st udent 2; / / Def i nes t wo
/ / l ocal var i abl es.
/ / Cal l f unct i on t o f i l l st r uct ur e var i abl es.
st udent 1 = f i l l _st r uct s( st udent 1) ; / / st udent 1
/ / i s passed by copy, so i t must be
/ / r et ur ned f or mai n( ) t o r ecogni ze i t .
st udent 2 = f i l l _st r uct s( st udent 2) ;
/ / Pr i nt t he dat a.
cout << \ n\ nHer e i s t he st udent i nf or mat i on you;
cout << ent er ed: \ n\ n;
pr _st udent s( st udent 1) ; / / Pr i nt s f i r st st udent s dat a.
pr _st udent s( st udent 2) ; / / Pr i nt s second st udent s dat a.
r et ur n;
}
597
EXAMPLE
C+ + By
st r uct st udent s f i l l _st r uct s( st r uct st udent s st udent _var )
{
/ / Get st udent s dat a
f f l ush( st di n) ; / / Cl ear s i nput buf f er f or next i nput .
cout << What i s st udent s name? ;
get s( st udent _var . name) ;
cout << What i s t he st udent s age? ;
ci n >> st udent _var . age;
cout << What i s t he st udent s aver age? ;
ci n >> st udent _var . aver age;
r et ur n ( st udent _var ) ;
}
voi d pr _st udent s( st r uct st udent s st udent _var )
{
cout << Name: << st udent _var . name << \ n;
cout << Age: << st udent _var . age << \ n;
cout << Aver age: << set pr eci si on( 2) <<
st udent _var . aver age << \ n;
r et ur n;
}
The prototype and definition of the f i l l _st r uct s( ) function
might seem complicated, but it follows the same pattern you
have seen throughout this book. Before a function name, you
must declare voi d or put the return data type if the function
returns a value. f i l l _st r uct s( ) does return a value, and the
type of value it returns is st r uct st udent s.
4. Because structure data is nothing more than regular vari-
ables grouped together, feel free to calculate using structure
members. As long as you use the dot operator, you can treat
structure members just as you would other variables.
The following example asks for a customers balance and
uses a discount rate, included in the customers structure, to
calculate a new balance. To keep the example short, the
structures data is initialized at variable declaration time.
This program does not actually require structures because
only one customer is used. Individual variables could have
Chapter 28 o Structures
598
been used, but they dont illustrate the concept of calculating
with structures.
/ / Fi l ename: C28CUST. CPP
/ / Updat es a cust omer bal ance i n a st r uct ur e.
#i ncl ude <i ost r eam. h>
#i ncl ude <i omani p. h>
st r uct cust omer _r ec
{
char cust _name[ 25] ;
doubl e bal ance;
f l oat di s_r at e;
} ;
voi d mai n( )
{
st r uct cust omer _r ec cust omer = {St eve Thompson,
431. 23, . 25};
cout << Bef or e t he updat e, << cust omer . cust _name;
cout << has a bal ance of $ << set pr eci si on( 2) <<
cust omer . bal ance << \ n;
/ / Updat e t he bal ance
cust omer . bal ance *= ( 1. 0- cust omer . di s_r at e) ;
cout << Af t er t he updat e, << cust omer . cust _name;
cout << has a bal ance of $ << cust omer . bal ance << \ n;
r et ur n;
}
5. You can copy the members of one structure variable to the
members of another as long as both structures have the same
format. Some older versions of C++ require you to copy each
member individually when you want to copy one structure
variable to another, but AT&T C++ makes duplicating
structure variables easy.
599
EXAMPLE
C+ + By
Being able to copy one structure variable to another will
seem more meaningful when you read Chapter 29, Arrays
of Structures.
The following program declares three structure variables,
but initializes only the first one with data. The other two are
then initialized by assigning the first structure variable to
them.
/ / Fi l ename: C28STCPY. CPP
/ / Demonst r at es assi gni ng one st r uct ur e t o anot her .
#i ncl ude <i ost r eam. h>
#i ncl ude <i omani p. h>
st r uct st udent
{
char st _name[ 25] ;
char gr ade;
i nt age;
f l oat aver age;
};
voi d mai n( )
{
st udent st d1 = {J oe Br own, A , 13, 91. 4};
st r uct st udent st d2, st d3; / / Not i ni t i al i zed
st d2 = st d1; / / Copi es each member of st d1
st d3 = st d1; / / t o st d2 and st d3.
cout << The cont ent s of st d2: \ n;
cout << st d2. st _name << << st d2. gr ade << ;
cout << st d2. age << << set pr eci si on( 1) << st d2. aver age
<< \ n\ n;
cout << The cont ent s of st d3: \ n;
cout << st d3. st _name << << st d3. gr ade << ;
cout << st d3. age << << st d3. aver age << \ n;
r et ur n;
}
Chapter 28 o Structures
600
Here is the output from the program:
The cont ent s of st d2
J oe Br own, A, 13, 91. 4
The cont ent s of st d3
J oe Br own, A, 13, 91. 4
Notice each member of st d1 was assigned to st d2 and st d3
with two single assignments.
Nested Struc tures
C++ gives you the ability to nest one structure definition in
another. This saves time when you are writing programs that use
similar structures. You have to define the common members only
once in their own structure and then use that structure as a member
in another structure.
The following two structure definitions illustrate this point:
st r uct empl oyees
{
char emp_name[ 25] ; / / Empl oyee s f ul l name.
char addr ess[ 30] ; / / Empl oyee s addr ess.
char ci t y[ 10] ;
char st at e[ 2] ;
l ong i nt zi p;
doubl e sal ar y; / / Annual sal ar y.
};
st r uct cust omer s
{
char cust _name[ 25] ; / / Cust omer s f ul l name.
char addr ess[ 30] ; / / Cust omer s addr ess.
char ci t y[ 10] ;
char st at e[ 2] ;
l ong i nt zi p;
doubl e bal ance; / / Bal ance owed t o company.
};
601
EXAMPLE
C+ + By
These structures hold different data. One structure is for em-
ployee data and the other holds customer data. Even though the data
should be kept separate (you dont want to send a customer a
paycheck!), the structure definitions have much overlap and can be
consolidated by creating a third structure.
Suppose you created the following structure:
st r uct addr ess_i nf o
{
char addr ess[ 30] ; / / Common addr ess i nf or mat i on.
char ci t y[ 10] ;
char st at e[ 2] ;
l ong i nt zi p;
};
This structure could then be used as a member in the other
structures like this:
st r uct empl oyees
{
char emp_name[ 25] ; / / Empl oyee s f ul l name.
addr ess_i nf o e_addr ess; / / Empl oyee s addr ess.
doubl e sal ar y; / / Annual sal ar y.
};
st r uct cust omer s
{
char cust _name[ 25] ; / / Cust omer s f ul l name.
addr ess_i nf o c_addr ess; / / Cust omer s addr ess.
doubl e bal ance; / / Bal ance owed t o company.
};
It is important to realize there are a total of three structures, and
that they have the tags addr ess_i nf o, empl oyees, and cust omer s. How
many members does the empl oyees structure have? If you answered
three, you are correct. There are three members in both empl oyees and
cust omer s. The empl oyees structure has the structure of a character
array, followed by the addr ess_i nf o structure, followed by the double
floating-point member, sal ar y.
Figure 28.3 shows how these structures look.
Chapter 28 o Structures
602
Figure 28.3. Defining a nested structure.
When you define a structure, that structure becomes a new data
type in the program and can be used anywhere a data type (such as
i nt , f l oat , and so on) can appear.
You can assign members values using the dot operator. To
assign the customer balance a number, type something like this:
cust omer . bal ance = 5643. 24;
The nested structure might seem to pose a problem. How can
you assign a value to one of the nested members? By using the dot
operator, you must nest the dot operator just as you nest the
structure definitions. You would assign a value to the customers
ZIP code like this:
cust omer . c_addr ess. zi p = 34312;
603
EXAMPLE
C+ + By
To assign a value to the employees ZIP code, you would do
this:
empl oyee. e_addr ess. zi p = 59823;
Review Questions
The answers to the review questions are in Appendix B.
1. What is the difference between structures and arrays?
2. What are the individual elements of a structure called?
3. What are the two ways to initialize members of a structure?
4. Do you pass structures by copy or by address?
5. True or false: The following structure definition reserves
storage in memory:
st r uct cr ec
{ char name[ 25] ;
i nt age;
f l oat sal es[ 5] ;
l ong i nt num;
}
6. Should you declare a structure globally or locally?
7. Should you declare a structure variable globally or locally?
8. How many members does the following structure declara-
tion contain?
st r uct i t em
{
i nt quant i t y;
par t _r ec i t em_desc;
f l oat pr i ce;
char dat e_pur ch[ 8] ;
};
Chapter 28 o Structures
604
Review Exerc ises
1. Write a structure in a program that tracks a video stores
tape inventory. Be sure the structure includes the tape title,
the length of the tape (in minutes), the initial purchase price
of the tape, the rental price of the tape, and the date of the
movies release.
2. Write a program using the structure you declared in Exer-
cise 1. Define three structure variables and initialize them
when you declare the variables with data. Print the data to
the screen.
3. Write a teachers program to keep track of 10 students
names, ages, letter grades, and IQs. Use 10 different struc-
ture variable names and retrieve the data for the students in
a f or loop from the keyboard. Print the data on the printer
when the teacher finishes entering the information for all the
students.
Summary
With structures, you have the ability to group data in more
flexible ways than with arrays. Your structures can contain mem-
bers of different data types. You can initialize the structures either
at declaration time or during the program with the dot operator.
Structures become even more powerful when you declare
arrays of structure variables. Chapter 29, Arrays of Structures,
shows you how to declare several structure variables without giving
them each a different name. This enables you to step through
structures much quicker with loop constructs.
605
EXAMPLE
C+ + By
29
Arrays of
Struc tures
This chapter builds on the previous one by showing you how to
create many structures for your data. After creating an array of
structures, you can store many occurrences of your data values.
Arrays of structures are good for storing a complete employee
file, inventory file, or any other set of data that fits in the structure
format. Whereas arrays provide a handy way to store several values
that are the same type, arrays of structures store several values of
different types together, grouped as structures.
This chapter introduces the following concepts:
Creating arrays of structures
Initializing arrays of structures
Referencing elements from a structure array
Arrays as members
Many C++ programmers use arrays of structures as a prelude
to storing their data in a disk file. You can input and calculate your
disk data in arrays of structures, and then store those structures in
memory. Arrays of structures also provide a means of holding data
you read from the disk.
Chapter 29 o Arrays of Structures
606
Dec laring Arrays
of Struc tures
It is easy to declare an array of structures. Specify the number
of reserved structures inside array brackets when you declare the
structure variable. Consider the following structure definition:
st r uct st or es
{ i nt empl oyees;
i nt r egi st er s;
doubl e sal es;
} st or e1, st or e2, st or e3, st or e4, st or e5;
This structure should not be difficult for you to understand
because there are no new commands used in the structure declara-
tion. This structure declaration creates five structure variables.
Figure 29.1 shows how C++ stores these five structures in memory.
Each of the structure variables has three memberstwo integers
followed by a double floating-point value.
Figure 29.1. The structure of St or e 1, St or e 2, St or e 3, St or e 4, and
St or e 5.
607
EXAMPLE
C+ + By
If the fourth store increased its employee count by three, you
could update the stores employee number with the following
assignment statement:
st or e4. empl oyees += 3; / / Add t hr ee t o t hi s st or e s
/ / empl oyee count .
Suppose the fifth store just opened and you want to initialize its
members with data. If the stores are a chain and the new store is
similar to one of the others, you can begin initializing the stores data
by assigning each of its members the same data as another stores,
like this:
st or e5 = st or e2; / / Def i ne i ni t i al val ues f or
/ / t he member s of st or e5.
Such structure declarations are fine for a small number of
structures, but if the stores were a national chain, five structure
variables would not be enough. Suppose there were 1000 stores. You
would not want to create 1000 different store variables and work
with each one individually. It would be much easier to create an
array of store structures.
Consider the following structure declaration:
st r uct st or es
{ i nt empl oyees;
i nt r egi st er s;
doubl e sal es;
} st or e[ 1000] ;
In one quick declaration, this code creates 1000 store structures,
each one containing three members. Figure 29.2 shows how these
structure variables appear in memory. Notice the name of each
individual structure variable: st or e[ 0] , st or e[ 1] , st or e[ 2] , and so on.
CAUTION: Be careful that your computer does not run out
of memory when you create a large number of structures.
Arrays of structures quickly consume valuable memory. You
might have to create fewer structures, storing more data in disk
files and less data in memory.
Arrays of structures
make worki ng wi th
l arge numbers of
structure vari abl es
manageabl e.
Chapter 29 o Arrays of Structures
608
Figure 29.2. An array of the st or e structures.
The element st or e[ 2] is an array element. This array element,
unlike the others you have seen, is a structure variable. Therefore, it
contains three members, each of which you can reference with the
dot operator.
The dot operator works the same way for structure array
elements as it does for regular structure variables. If the number of
employees for the fifth store (st or e[ 4] ) increased by three, you could
update the structure variable like this:
st or e[ 4] . empl oyees += 3; / / Add t hr ee t o t hi s st or e s
/ / empl oyee count .
You can assign complete structures to one another also by
using array notation. To assign all the members of the 20th store to
the 45th store, you would do this:
609
EXAMPLE
C+ + By
st or e[ 44] = st or e[ 19] ; / / Copy al l member s f r omt he
/ / 20t h st or e t o t he 45t h.
The rules of arrays are still in force here. Each element of the
array called st or e is the same data type. The data type of st or e is the
structure st or es. As with any array, each element must be the same
data type; you cannot mix data types in the same array. This arrays
data type happens to be a structure you created containing three
members. The data type for st or e[ 316] is the same for st or e[ 981] and
st or e[ 74] .
The name of the array, st or e, is a pointer constant to the starting
element of the array, st or e[ 0] . Therefore, you can use pointer nota-
tion to reference the stores. To assign st or e[ 60] the same value as
st or e[ 23] , you can reference the two elements like this:
*( st or e+60) = *( st or e+23) ;
You also can mix array and pointer notation, such as
st or e[ 60] = *( st or e+23) ;
and receive the same results.
You can increase the sales of st or e[ 8] by 40 percent using
pointer or subscript notation as well, as in
st or e[ 8] . sal es = ( *( st or e+8) ) . sal es * 1. 40;
The extra pair of parentheses are required because the dot
operator has precedence over the dereferencing symbol in C++s
hierarchy of operators (see Appendix D, C++ Precedence Table).
Of course, in this case, the code is not helped by the pointer notation.
The following is a much clearer way to increase the sal es by 40
percent:
st or e[ 8] . sal es *= 1. 40;
The following examples build an inventory data-entry system
for a mail-order firm using an array of structures. There is very little
new you have to know when working with arrays of structures. To
become comfortable with the arrays of structure notation, concen-
trate on the notation used when accessing arrays of structures and
their members.
Chapter 29 o Arrays of Structures
610
Keep Your Array Notation Straight
You would never access the member sal es like this:
st or e. sal es[ 8] = 3234. 54; / / I nval i d
Array subscripts follow only array elements. sal es is not an
array; it was declared as being a double floating-point number.
st or e can never be used without a subscript (unless you are
using pointer notation).
Here is a corrected version of the previous assignment state-
ment:
st or e[ 8] . sal es=3234. 54; / / Cor r ect l y assi gns
/ / t he val ue.
Examples
1. Suppose you work for a mail-order company that sells disk
drives. You are given the task of writing a tracking program
for the 125 different drives you sell. You must keep track of
the following information:
Storage capacity in megabytes
Access time in milliseconds
Vendor code (A, B, C, or D)
Cost
Price
Because there are 125 different disk drives in the inventory,
the data fits nicely into an array of structures. Each array
element is a structure containing the five members described
in the list.
The following structure definition defines the inventory:
st r uct i nvent or y
{
611
EXAMPLE
C+ + By
l ong i nt st or age;
i nt access_t i me;
char vendor _code;
doubl e code;
doubl e pr i ce;
} dr i ve[ 125] ; / / Def i nes 125 occur r ences of t he st r uct ur e.
2. When working with a large array of structures, your first
concern should be how the data inputs into the array ele-
ments. The best method of data-entry depends on the
application.
For example, if you are converting from an older computer-
ized inventory system, you have to write a conversion
program that reads the inventory file in its native format and
saves it to a new file in the format required by your C++
programs. This is no easy task. It demands that you have
extensive knowledge of the system from which you are
converting.
If you are writing a computerized inventory system for the
first time, your job is a little easier because you do not have
to convert the old files. You still must realize that someone
has to type the data into the computer. You must write a
data-entry program that receives each inventory item from
the keyboard and saves it to a disk file. You should give the
user a chance to edit inventory data to correct any data he or
she originally might have typed incorrectly.
One of the reasons disk files are introduced in the last half of
the book is that disk-file formats and structures share a
common bond. When you store data in a structure, or more
often, in an array of structures, you can easily write that data
to a disk file using straightforward disk I/O commands.
The following program takes the array of disk drive struc-
tures shown in the previous example and adds a data-entry
function so the user can enter data into the array of struc-
tures. The program is menu-driven. The user has a choice,
when starting the program, to add data, print data on-
screen, or exit the program. Because you have yet to see disk
I/O commands, the data in the array of structures goes away
Chapter 29 o Arrays of Structures
612
when the program ends. As mentioned earlier, saving those
structures to disk is an easy task after you learn C++s disk
I/O commands. For now, concentrate on the manipulation
of the structures.
This program is longer than many you previously have seen
in this book, but if you have followed the discussions of
structures and the dot operator, you should have little
trouble following the code.
Identify the program and include the necessary header files. Define a
structure that describes the format of each inventory item. Create an
array of structures called di sk.
Display a menu that gives the user the choice of entering new
inventory data, displaying the data on-screen, or quitting the pro-
gram. If the user wants to enter new inventory items, prompt the user
for each item and store the data into the array of structures. If the user
wants to see the inventory, loop through each inventory item in the
array, displaying each one on-screen.
/ / Fi l ename: C29DSI NV. CPP
/ / Dat a- ent r y pr ogr amf or a di sk dr i ve company.
#i ncl ude <i ost r eam. h>
#i ncl ude <st dl i b. h>
#i ncl ude <i omani p. h>
#i ncl ude <st di o. h>
st r uct i nvent or y / / Gl obal st r uct ur e def i ni t i on.
{
l ong i nt st or age;
i nt access_t i me;
char vendor _code;
f l oat cost ;
f l oat pr i ce;
}; / / No st r uct ur e var i abl es def i ned gl obal l y.
voi d di sp_menu( voi d) ;
st r uct i nvent or y ent er _dat a( ) ;
voi d see_dat a( i nvent or y di sk[ 125] , i nt num_i t ems) ;
voi d mai n( )
613
EXAMPLE
C+ + By
{
i nvent or y di sk[ 125] ; / / Local ar r ay of st r uct ur es.
i nt ans;
i nt num_i t ems=0; / / Number of t ot al i t ems
/ / i n t he i nvent or y.
do
{
do
{ di sp_menu( ) ; / / Di spl ay menu of user choi ces.
ci n >> ans; / / Get user s r equest .
} whi l e ( ( ans<1) | | ( ans>3) ) ;
swi t ch ( ans)
{ case ( 1) : { di sk[ num_i t ems] = ent er _dat a( ) ; / / Ent er
/ / di sk dat a.
num_i t ems++; / / I ncr ement number of i t ems.
br eak; }
case ( 2) : { see_dat a( di sk, num_i t ems) ; / / Di spl ay
/ / di sk dat a.
br eak; }
def aul t : { br eak; }
}
} whi l e ( ans! =3) ; / / Qui t pr ogr am
/ / when user i s done.
r et ur n;
}
voi d di sp_menu( voi d)
{
cout << \ n\ n*** Di sk Dr i ve I nvent or y Syst em***\ n\ n;
cout << Do you want t o: \ n\ n;
cout << \ t 1. Ent er new i t emi n i nvent or y\ n\ n;
cout << \ t 2. See i nvent or y dat a\ n\ n;
cout << \ t 3. Exi t t he pr ogr am\ n\ n;
cout << What i s your choi ce? ;
r et ur n;
}
i nvent or y ent er _dat a( )
Chapter 29 o Arrays of Structures
614
{
i nvent or y di sk_i t em; / / Local var i abl e t o f i l l
/ / wi t h i nput .
cout << \ n\ nWhat i s t he next dr i ve s st or age i n byt es? ;
ci n >> di sk_i t em. st or age;
cout << What i s t he dr i ve s access t i me i n ms? ;
ci n >> di sk_i t em. access_t i me;
cout << What i s t he dr i ve s vendor code ( A, B, C, or D) ? ;
f f l ush( st di n) ; / / Di scar d i nput buf f er
/ / bef or e accept i ng char act er .
di sk_i t em. vendor _code = get char ( ) ;
get char ( ) ; / / Di scar d car r i age r et ur n
cout << What i s t he dr i ve s cost ? ;
ci n >> di sk_i t em. cost ;
cout << What i s t he dr i ve s pr i ce? ;
ci n >> di sk_i t em. pr i ce;
r et ur n ( di sk_i t em) ;
}
voi d see_dat a( i nvent or y di sk[ 125] , i nt num_i t ems)
{
i nt ct r ;
cout << \ n\ nHer e i s t he i nvent or y l i st i ng: \ n\ n;
f or ( ct r =0; ct r <num_i t ems; ct r ++)
{
cout << St or age: << di sk[ ct r ] . st or age << \ t ;
cout << Access t i me: << di sk[ ct r ] . access_t i me << \ n;
cout << Vendor code: << di sk[ ct r ] . vendor _code << \ t ;
cout << set pr eci si on( 2) ;
cout << Cost : $ << di sk[ ct r ] . cost << \ t ;
cout << Pr i ce: $ << di sk[ ct r ] . pr i ce << \ n;
}
r et ur n;
}
Figure 29.3 shows an item being entered into the inventory
file. Figure 29.4 shows the inventory listing being displayed
to the screen. There are many features and error-checking
functions you can add, but this program is the foundation of
a more comprehensive inventory system. You can easily
615
EXAMPLE
C+ + By
adapt it to a different type of inventory, a video tape collec-
tion, a coin collection, or any other tracking system by
changing the structure definition and the member names
throughout the program.
Figure 29.3. Entering inventory information.
Arrays as Members
Members of structures can be arrays. Array members pose no
new problems, but you have to be careful when you access indi-
vidual array elements. Keeping track of arrays of structures that
contain array members might seem like a great deal of work on your
part, but there is nothing to it.
Consider the following structure definition. This statement
declares an array of 100 structures, each structure holding payroll
information for a company. Two of the members, name and depar t -
ment , are arrays.
st r uct payr ol l
{ char name[ 25] ; / / Empl oyee name ar r ay.
Chapter 29 o Arrays of Structures
616
i nt dependent s;
char depar t ment [ 10] ; / / Depar t ment name ar r ay.
f l oat sal ar y;
} empl oyee[ 100] ; / / An ar r ay of 100 empl oyees.
Figure 29.4. Displaying the inventory data.
Figure 29.5 shows what these structures look like. The first and
third members are arrays. name is an array of 25 characters, and
depar t ment is an array of 10 characters.
Suppose you must save the 25th employees initial in a charac-
ter variable. Assuming initial is already declared as a character
variable, the following statement assigns the employees initial to
the varible i ni t i al :
i ni t i al = empl oyee[ 24] . name[ 0] ;
The double subscripts might look confusing, but the dot opera-
tor requires a structure variable on its left (empl oyee[ 24] ) and a
member on its right (names first array element). Being able to refer to
member arrays makes the processing of character data in structures
simple.
617
EXAMPLE
C+ + By
Figure 29.5. The payroll data.
Chapter 29 o Arrays of Structures
618
Examples
1. Suppose an employee got married and wanted her name
changed in the payroll file. (She happens to be the 45th
employee in the array of structures.) Given the payroll
structure described in the previous section, this would
assign a new name to her structure:
st r cpy( empl oyee[ 44] . name, Mar y Lar son) ; / / Assi gn
/ / a new name.
When you refer to a structure variable using the dot opera-
tor, you can use regular commands and functions to process
the data in the structure members.
2. A bookstore wants to catalog its inventory of books. The
following program creates an array of 100 structures. Each
structure contains several types of variables, including
arrays. This program is the data-entry portion of a larger
inventory system. Study the references to the members to
see how member-arrays are used.
/ / Fi l ename: C29BOOK. CPP
/ / Bookst or e dat a- ent r y pr ogr am.
#i ncl ude <i ost r eam. h>
#i ncl ude <st di o. h>
#i ncl ude <ct ype. h>
st r uct i nvent or y
{ char t i t l e[ 25] ; / / Book s t i t l e.
char pub_dat e[ 19] ; / / Publ i cat i on dat e.
char aut hor [ 20] ; / / Aut hor s name.
i nt num; / / Number i n st ock.
i nt on_or der ; / / Number on or der .
f l oat r et ai l ; / / Ret ai l pr i ce.
};
voi d mai n( )
{
i nvent or y book[ 100] ;
i nt t ot al =0; / / Tot al books i n i nvent or y.
i nt ans;
619
EXAMPLE
C+ + By
do / / Thi s pr ogr ament er s dat a i nt o t he st r uct ur es.
{ cout << Book # << ( t ot al +1) << : \ n, ( t ot al +1) ;
cout << What i s t he t i t l e? ;
get s( book[ t ot al ] . t i t l e) ;
cout << What i s t he publ i cat i on dat e? ;
get s( book[ t ot al ] . pub_dat e) ;
cout << Who i s t he aut hor ? ;
get s( book[ t ot al ] . aut hor ) ;
cout << How many books of t hi s t i t l e ar e t her e? ;
ci n >> book[ t ot al ] . num;
cout << How many ar e on or der ? ;
ci n >> book[ t ot al ] . on_or der ;
cout << What i s t he r et ai l pr i ce? ;
ci n >> book[ t ot al ] . r et ai l ;
f f l ush( st di n) ;
cout << \ nAr e t her e mor e books? ( Y/ N) ;
ans=get char ( ) ;
f f l ush( st di n) ; / / Di scar d car r i age r et ur n.
ans=t oupper ( ans) ; / / Conver t t o upper case.
i f ( ans== Y )
{ t ot al ++;
cont i nue; }
} whi l e ( ans== Y ) ;
r et ur n;
}
You need much more to make this a usable inventory pro-
gram. An exercise at the end of this chapter recommends
ways you can improve on this program by adding a printing
routine and a title and author search. One of the first things
you should do is put the data-entry routine in a separate
function to make the code more modular. Because this
example is so short, and because the program performs only
one task (data-entry), there was no advantage to putting the
data-entry task in a separate function.
3. Here is a comprehensive example of the steps you might go
through to write a C++ program. You should begin to
understand the C++ language enough to start writing some
advanced programs.
Chapter 29 o Arrays of Structures
620
Assume you have been hired by a local bookstore to write a
magazine inventory system. You have to track the following:
Magazine title (at most, 25 characters)
Publisher (at most, 20 characters)
Month (1, 2, 3,...12)
Publication year
Number of copies in stock
Number of copies on order
Price of magazine (dollars and cents)
Suppose there is a projected maximum of 1000 magazine
titles the store will ever carry. This means you need 1000
occurrences of the structure, not 1000 magazines total. Here
is a good structure definition for such an inventory:
st r uct mag_i nf o
{ char t i t l e[ 25] ;
char pub[ 25] ;
i nt mont h;
i nt year ;
i nt st ock_copi es;
i nt or der _copi es;
f l oat pr i ce;
} mags[ 1000] ; / / Def i ne 1000 occur r ences.
Because this program consists of more than one function, it
is best to declare the structure globally, and the structure
variables locally in the functions that need them.
This program needs three basic functions: a mai n( ) control-
ling function, a data-entry function, and a data printing
function. You can add much more, but this is a good start for
an inventory system. To keep the length of this example
reasonable, assume the user wants to enter several maga-
zines, then print them. (To make the program more us-
able, you should add a menu so the user can control when
she or he adds and prints the information, and should add
more error-checking and editing capabilities.)
621
EXAMPLE
C+ + By
Here is an example of the complete data-entry and printing
program with prototypes. The arrays of structures are
passed between the functions from mai n( ) .
/ / Fi l ename: C29MAG. CPP
/ / Magazi ne i nvent or y pr ogr amf or addi ng and di spl ayi ng
/ / a bookst or e s magazi nes.
#i ncl ude <i ost r eam. h>
#i ncl ude <ct ype. h>
#i ncl ude <st di o. h>
st r uct mag_i nf o
{ char t i t l e[ 25] ;
char pub[ 25] ;
i nt mont h;
i nt year ;
i nt st ock_copi es;
i nt or der _copi es;
f l oat pr i ce;
};
mag_i nf o f i l l _mags( st r uct mag_i nf o mag) ;
voi d pr i nt _mags( st r uct mag_i nf o mags[ ] , i nt mag_ct r ) ;
voi d mai n( )
{
mag_i nf o mags[ 1000] ;
i nt mag_ct r =0; / / Number of magazi ne t i t l es.
char ans;
do
{ / / Assumes t her e i s
/ / at l east one magazi ne f i l l ed.
mags[ mag_ct r ] = f i l l _mags( mags[ mag_ct r ] ) ;
cout << Do you want t o ent er anot her magazi ne? ;
f f l ush( st di n) ;
ans = get char ( ) ;
f f l ush( st di n) ; / / Di scar ds car r i age r et ur n.
i f ( t oupper ( ans) == Y )
{ mag_ct r ++; }
} whi l e ( t oupper ( ans) == Y ) ;
pr i nt _mags( mags, mag_ct r ) ;
Chapter 29 o Arrays of Structures
622
r et ur n; / / Ret ur ns t o oper at i ng syst em.
}
voi d pr i nt _mags( mag_i nf o mags[ ] , i nt mag_ct r )
{
i nt i ;
f or ( i =0; i <=mag_ct r ; i ++)
{ cout << \ n\ nMagazi ne << i +1 << : \ n; / / Adj ust s f or
/ / subscr i pt .
cout << \ nTi t l e: << mags[ i ] . t i t l e << \ n;
cout << \ t Publ i sher : << mags[ i ] . pub << \ n;
cout << \ t Pub. Mont h: << mags[ i ] . mont h << \ n;
cout << \ t Pub. Year : << mags[ i ] . year << \ n;
cout << \ t I n- st ock: << mags[ i ] . st ock_copi es << \ n;
cout << \ t On or der : << mags[ i ] . or der _copi es << \ n;
cout << \ t Pr i ce: << mags[ i ] . pr i ce << \ n;
}
r et ur n;
}
mag_i nf o f i l l _mags( mag_i nf o mag)
{
put s( \ n\ nWhat i s t he t i t l e? ) ;
get s( mag. t i t l e) ;
put s( Who i s t he publ i sher ? ) ;
get s( mag. pub) ;
put s( What i s t he mont h ( 1, 2, . . . , 12) ? ) ;
ci n >> mag. mont h;
put s( What i s t he year ? ) ;
ci n >> mag. year ;
put s( How many copi es i n st ock? ) ;
ci n >> mag. st ock_copi es;
put s( How many copi es on or der ? ) ;
ci n >> mag. or der _copi es;
put s( How much i s t he magazi ne? ) ;
ci n >> mag. pr i ce;
r et ur n ( mag) ;
}
623
EXAMPLE
C+ + By
Review Questions
The answers to the review questions are in Appendix B.
1. True or false: Each element in an array of structures must be
the same type.
2. What is the advantage of creating an array of structures
rather than using individual variable names for each struc-
ture variable?
3. Given the following structure declaration:
st r uct i t em
{ char par t _no[ 8] ;
char descr [ 20] ;
f l oat pr i ce;
i nt i n_st ock;
} i nvent or y[ 100] ;
a. How would you assign a price of 12.33 to the 33rd items
in-stock quantity?
b. How would you assign the first character of the 12th
items part number the value of X?
c. How would you assign the 97th inventory item the same
values as the 63rd?
4. Given the following structure declaration:
st r uct i t em
{ char desc[ 20] ;
i nt num;
f l oat cost ;
} i nvent or y[ 25] ;
a. What is wrong with the following statement?
i t em[ 1] . cost = 92. 32;
b. What is wrong with the following statement?
st r cpy( i nvent or y. desc, Wi dget s) ;
Chapter 29 o Arrays of Structures
624
c. What is wrong with the following statement?
i nvent or y. cost [ 10] = 32. 12;
Review Exerc ises
1. Write a program that stores an array of friends names,
phone numbers, and addresses and prints them two ways:
with their name, address, and phone number, or with only
their name and phone number for a phone listing.
2. Add a sort function to the program in Exercise 1 so you can
print your friends names in alphabetical order. (Hint: You
have to make the member holding the names a character
pointer.)
3. Expand on the book data-entry program, C29BOOK.CPP,
by adding features to make it more usable (such as search
book by author, by title, and print an inventory of books on
order).
Summary
You have mastered structures and arrays of structures. Many
useful inventory and tracking programs can be written using struc-
tures. By being able to create arrays of structures, you can now create
several occurrences of data.
The next step in the process of learning C++ is to save these
structures and other data to disk files. The next two chapters explore
the concepts of disk file processing.
625
EXAMPLE
C+ + By
30
Sequential Files
So far, every example in this book has processed data that resided
inside the program listing or came from the keyboard. You assigned
constants and variables to other variables and created new data
values from expressions. The programs also received input with ci n,
get s( ) , and the character input functions.
The data created by the user and assigned to variables with
assignment statements is sufficient for some applications. With the
large volumes of data most real-world applications must process,
however, you need a better way of storing that data. For all but the
smallest computer programs, disk files offer the solution.
After storing data on the disk, the computer helps you enter,
find, change, and delete the data. The computer and C++ are simply
tools to help you manage and process data. This chapter focuses on
disk- and file-processing concepts and teaches you the first of two
methods of disk access, sequential file access.
This chapter introduces you to the following concepts:
o An overview of disk files
o The types of files
o Processing data on the disk
o Sequential file access
o File I/O functions
Chapter 30 o Sequential Files
626
After this chapter, you will be ready to tackle the more ad-
vanced random-file-access methods covered in the next chapter. If
you have programmed computerized data files with another pro-
gramming language, you might be surprised at how C++ borrows
from other programming languages, especially BASIC, when work-
ing with disk files. If you are new to disk-file processing, disk files
are simple to create and to read.
Why Use a Disk?
The typical computer system has much less memory storage
than hard disk storage. Your disk drive holds much more data than
can fit in your computers RAM. This is the primary reason for using
the disk for storing your data. The disk memory, because it is
nonvolatile, also lasts longer; when you turn your computer off, the
disk memory is not erased, whereas RAM is erased. Also, when your
data changes, you (or more important, your users) do not have to
edit the program and look for a set of assignment statements.
Instead, the users run previously written programs that make
changes to the disk data.
This makes programming more difficult at first because pro-
grams have to be written to change the data on the disk.
Nonprogrammers, however, can then use the programs and modify
the data without knowing C++.
The capacity of your disk makes it a perfect place to store your
data as well as your programs. Think about what would happen if
all data had to be stored with a programs assignment statements.
What if the Social Security Office in Washington, D.C., asked you to
write a C++ program to compute, average, filter, sort, and print each
persons name and address in his or her files? Would you want your
program to include millions of assignment statements? Not only
would you not want the program to hold that much data, but it could
not do so because only relatively small amounts of data fit in a
program before you run out of RAM.
Di sks hol d more
data than computer
memory.
627
EXAMPLE
C+ + By
By storing data on your disk, you are much less limited because
you have more storage. Your disk can hold as much data as you have
disk capacity. Also, if your program requirements grow, you can
usually increase your disk space, whereas you cannot always add
more RAM to your computer.
NOTE: C++ cannot access the special extended or expanded
memory some computers have.
When working with disk files, C++ does not have to access
much RAM because C++ reads data from your disk drive and
processes the data only parts at a time. Not all your disk data has to
reside in RAM for C++ to process it. C++ reads some data, processes
it, and then reads some more. If C++ requires disk data a second
time, it rereads that place on the disk.
Types of Disk File Ac c ess
Your programs can access files two ways: through sequential
access or random access. Your application determines the method
you should choose. The access mode of a file determines how you
read, write, change, and delete data from the file. Some of your files
can be accessed in both ways, sequentially and randomly as long as
your programs are written properly and the data lends itself to both
types of file access.
A sequential file has to be accessed in the same order the file
was written. This is analogous to cassette tapes: You play music in
the same order it was recorded. (You can quickly fast-forward or
rewind over songs you do not want to listen to, but the order of the
songs dictates what you do to play the song you want.) It is difficult,
and sometimes impossible, to insert data in the middle of a sequen-
tial file. How easy is it to insert a new song in the middle of two other
songs on a tape? The only way to truly add or delete records from the
middle of a sequential file is to create a completely new file that
combines both old and new records.
It might seem that sequential files are limiting, but it turns
out that many applications lend themselves to sequential-file
processing.
Chapter 30 o Sequential Files
628
Unlike sequential files, you can access random-access files in
any order you want. Think of data in a random-access file as you
would songs on a compact disc or record; you can go directly to any
song you want without having to play or fast-forward over the other
songs. If you want to play the first song, the sixth song, and then the
fourth song, you can do so. The order of play has nothing to do with
the order in which the songs were originally recorded. Random-file
access sometimes takes more programming but rewards your effort
with a more flexible file-access method. Chapter 31 discusses how to
program for random-access files.
Sequential File Conc epts
There are three operations you can perform on sequential disk
files. You can
o Create disk files
o Add to disk files
o Read from disk files
Your application determines what you must do. If you are
creating a disk file for the first time, you must create the file and write
the initial data to it. Suppose you wanted to create a customer data
file. You would create a new file and write your current customers
to that file. The customer data might originally be in arrays, arrays
of structures, pointed to with pointers, or placed in regular variables
by the user.
Over time, as your customer base grows, you can add new
customers to the file (called appending to the file). When you add to
the end of a file, you append to that file. As your customers enter
your store, you would read their information from the customer
data file.
Customer disk processing is an example of one disadvantage
of sequential files, however. Suppose a customer moves and wants
you to change his or her address in your files. Sequential-access files
do not lend themselves well to changing data stored in them. It is
also difficult to remove information from sequential files. Random
files, described in the next chapter, provide a much easier approach
629
EXAMPLE
C+ + By
to changing and removing data. The primary approach to changing
or removing data from a sequential-access file is to create a new one,
from the old one, with the updated data. Because of the updating
ease provided with random-access files, this chapter concentrates
on creating, reading, and adding to sequential files.
Opening and Closing Files
Before you can create, write to, or read from a disk file, you
must open the file. This is analogous to opening a filing cabinet
before working with a file stored in the cabinet. Once you are done
with a cabinets file, you close the file drawer. You also must close
a disk file when you finish with it.
When you open a disk file, you only have to inform C++ of the
filename and what you want to do (write to, add to, or read from).
C++ and your operating system work together to make sure the disk
is ready and to create an entry in your file directory (if you are
creating a file) for the filename. When you close a file, C++ writes any
remaining data to the file, releases the file from the program, and
updates the file directory to reflect the files new size.
CAUTION: You must ensure that the FI LES= statement in your
CONFIG.SYS file is large enough to hold the maximum num-
ber of disk files you have open, with one left for your C++
program. If you are unsure how to do this, check your DOS
reference manual or a beginners book about DOS.
To open a file, you must call the open( ) function. To close a file,
call the cl ose( ) function. Here is the format of these two function
calls:
f i l e_pt r . open( f i l e_name, access) ;
and
f i l e_pt r . cl ose( ) ;
f i l e_pt r is a special type of pointer that only points to files, not
data variables.
Chapter 30 o Sequential Files
630
Your operating system handles the exact location of your data
in the disk file. You dont want to worry about the exact track and
sector number of your data on the disk. Therefore, you let f i l e_pt r
point to the data you are reading and writing. Your program only
has to generically manage f i l e_pt r , whereas C++ and your operat-
ing system take care of locating the actual physical data.
f i l e_name is a string (or a character pointer that points to a
string) containing a valid filename for your computer. f i l e_name can
contain a complete disk and directory pathname. You can specify
the filename in uppercase or lowercase letters.
access must be one of the values from Table 30.1.
Table 30.1. Possible ac c ess modes.
Mode Description
app Open the file for appending (adding to it).
at e Seek to end of file on opening it.
i n Open the file for reading.
out Open the file for writing.
bi nar y Open the file in binary mode.
t r unc Discard contents if file exists
nocr eat e If file doesnt exist, open fails.
nor epl ace If file exists, open fails unless appending or seeking
to end of file on opening.
The default access mode for file access is a text mode. A text file
is an ASCII file, compatible with most other programming lan-
guages and applications. Text files do not always contain text, in the
word-processing sense of the word. Any data you have to store can
go in a text file. Programs that read ASCII files can read data you
create as C++ text files. For a discussion of binary file access, see the
box that follows.
631
EXAMPLE
C+ + By
Binary Modes
If you specify binary access, C++ creates or reads the file in a
binary format. Binary data files are squeezedthey take less
space than text files. The disadvantage of using binary files is
that other programs cannot always read the data files. Only
C++ programs written to access binary files can read and write
to them. The advantage of binary files is that you save disk
space because your data files are more compact. Other than the
access mode in the open( ) function, you use no additional
commands to access binary files with your C++ programs.
The binary format is a system-specific file format. In other
words, not all computers can read a binary file created on
another computer.
If you open a file for writing, C++ creates the file. If a file by
that name already exists, C++ overwrites the old file with
no warning. You must be careful when opening files so you do
not overwrite existing data that you want to save.
If an error occurs during the opening of a file, C++ does not
create a valid file pointer. Instead, C++ creates a file pointer equal to
zero. For example, if you open a file for output, but use a disk name
that is invalid, C++ cannot open the file and makes the file pointer
equal to zero. Always check the file pointer when writing disk file
programs to ensure the file opened properly.
TIP: Beginning programmers like to open all files at the begin-
ning of their programs and close them at the end. This is not
always the best method. Open files immediately before
you access them and close them immediately when you are
done with them. This habit protects the files because they are
closed immediately after you are done with them. A closed file
is more likely to be protected in the unfortunate (but possible)
event of a power failure or computer breakdown.
Chapter 30 o Sequential Files
632
This section contains much information on file-access theories.
The following examples help illustrate these concepts.
Examples
1. Suppose you want to create a file for storing your house
payment records for the previous year. Here are the first few
lines in the program which creates a file called HOUSE.DAT
on your disk:
#i ncl ude <f st r eam. h>
mai n( )
{
of st r eamf i l e_pt r ; / / Decl ar es a f i l e poi nt er f or wr i t i ng
f i l e_pt r . open( house. dat , i os: : out ) ; / / Cr eat es t he f i l e
The remainder of the program writes data to the file. The
program never has to refer to the filename again. The pro-
gram uses the f i l e_pt r variable to refer to the file. Examples
in the next few sections illustrate how. There is nothing
special about f i l e_pt r , other than its name (although the
name is meaningful in this case). You can name file pointer
variables XYZ or a908973 if you like, but these names would not
be meaningful.
You must include the fstream.h header file because it con-
tains the definition for the of st r eamand i f st r eamdeclarations.
You dont have to worry about the physical specifics. The
f i l e_pt r points to data in the file as you write it. Put the
declarations in your programs where you declare other
variables and arrays.
TIP: Because files are not part of your program, you might
find it useful to declare file pointers globally. Unlike data in
variables, there is rarely a reason to keep file pointers local.
633
EXAMPLE
C+ + By
Before finishing with the program, you should close the file.
The following cl ose( ) function closes the house file:
f i l e_pt r . cl ose( ) ; / / Cl ose t he house payment f i l e.
2. If you want, you can put the complete pathname in the files
name. The following opens the household payment file in a
subdirectory on the D: disk drive:
f i l e_pt r . open( d: \ mydat a\ house. dat , i os: : out ) ;
3. If you want, you can store a filename in a character array or
point to it with a character pointer. Each of the following
sections of code is equivalent:
char f n[ ] = house. dat ; / / Fi l ename i n char act er ar r ay.
f i l e_pt r . open( f n, i os: : out ) ; / / Cr eat es t he f i l e.
char *myf i l e = house. dat ; / / Fi l ename poi nt ed t o.
f i l e_pt r . open( myf i l e, i os: : out ) ; / / Cr eat es t he f i l e.
/ / Let t he user ent er t he f i l ename.
cout << What i s t he name of t he househol d f i l e? ;
get s( f i l ename) ; / / Fi l ename must be an ar r ay or
/ / char act er poi nt er .
f i l e_pt r . open( f i l ename, i os: : out ) ; / / Cr eat es t he f i l e.
No matter how you specify the filename when opening the
file, close the file with the file pointer. This cl ose( ) function
closes the open file, no matter which method you used to
open the file:
f i l e_pt r . cl ose( ) ; / / Cl ose t he house payment f i l e.
4. You should check the return value from open( ) to ensure the
file opened properly. Here is code after open( ) that checks for
an error:
#i ncl ude <f st r eam. h>
mai n( )
{
of st r eamf i l e_pt r ; / / Decl ar es a f i l e poi nt er .
Chapter 30 o Sequential Files
634
f i l e_pt r . open( house. dat , i os: : out ) ; / / Cr eat es t he f i l e.
i f ( ! f i l e_pt r )
{ cout << Er r or openi ng f i l e. \ n; }
el se
{
/ / Rest of out put commands go her e.
5. You can open and write to several files in the same program.
Suppose you wanted to read data from a payroll file and
create a backup payroll data file. You have to open the
current payroll file using the i n reading mode, and the
backup file in the output out mode.
For each open file in your program, you must declare a
different file pointer. The file pointers used by your input
and output statement determine on which file they operate.
If you have to open many files, you can declare an array of
file pointers.
Here is a way you can open the two payroll files:
#i ncl ude <f st r eam. h>
i f st r eam f i l e_i n; / / I nput f i l e
of st r eam f i l e_out ; / / Out put f i l e
mai n( )
{
f i l e_i n. open( payr ol l . dat , i os: : i n) ; / / Exi st i ng f i l e
f i l e_out . open( payr ol l . BAK, i os: : out ) ; / / New f i l e
When you finish with these files, be sure to close them with
these two cl ose( ) function calls:
f i l e_i n. cl ose( ) ;
f i l e_out . cl ose( ) ;
635
EXAMPLE
C+ + By
Writing to a File
Any input or output function that requires a device performs
input and output with files. You have seen most of these already.
The most common file I/O functions are
get ( ) and put ( )
get s( ) and put s( )
You also can use f i l e_pt r as you do with cout or ci n.
The following function call reads three integers from a file
pointed to by f i l e_pt r :
f i l e_pt r >> num1 >> num2 >> num3; / / Reads t hr ee var i abl es.
There is always more than one way to write data to a disk file.
Most the time, more than one function will work. For example, if
you write many names to a file, both put s( ) and f i l e_pt r << work.
You also can write the names using put ( ) . You should use which-
ever function you are most comfortable with. If you want a newline
character (\ n) at the end of each line in your file, the f i l e_pt r <<and
put s( ) are probably easier than put ( ) , but all three will do the job.
TIP: Each line in a file is called a record. By putting a newline
character at the end of file records, you make the input of those
records easier.
Examples
1. The following program creates a file called NAMES.DAT.
The program writes five names to a disk file using
f i l e_pt r <<.
/ / Fi l ename: C30WR1. CPP
/ / Wr i t es f i ve names t o a di sk f i l e.
#i ncl ude <f st r eam. h>
of st r eamf p;
Chapter 30 o Sequential Files
636
voi d mai n( )
{
f p. open( NAMES. DAT, i os: : out ) ; / / Cr eat es a new f i l e.
f p << Mi chael Langst on\ n;
f p << Sal l y Reddi ng\ n;
f p << J ane Ki r k\ n;
f p << St acy Wi ker t \ n;
f p << J oe Hi quet \ n;
f p. cl ose( ) ; / / Rel ease t he f i l e.
r et ur n;
}
To keep this first example simple, error checking was not
done on the open( ) function. The next few examples check for
the error.
NAMES.TXT is a text data file. If you want, you can read this
file into your word processor (use your word processors
command for reading ASCII files) or use the MS-DOS TYPE
command (or your operating systems equivalent command)
to display this file on-screen. If you were to display
NAMES.TXT, you would see:
Mi chael Langst on
Sal l y Reddi ng
J ane Ki r k
St acy Wi ker t
J oe Hi quet
2. The following file writes the numbers from 1 to 100 to a file
called NUMS.1.
/ / Fi l ename: C30WR2. CPP
/ / Wr i t es 1 t o 100 t o a di sk f i l e.
#i ncl ude <f st r eam. h>
of st r eam f p;
voi d mai n( )
637
EXAMPLE
C+ + By
{
i nt ct r ;
f p. open( NUMS. 1, i os: : out ) ; / / Cr eat es a new f i l e.
i f ( ! f p)
{ cout << Er r or openi ng f i l e. \ n; }
el se
{
f or ( ct r = 1; ct r < 101; ct r ++)
{ f p << ct r << ; }
}
f p. cl ose( ) ;
r et ur n;
}
The numbers are not written one per line, but with a space
between each of them. The format of the f i l e_pt r << deter-
mines the format of the output data. When writing data to
disk files, keep in mind that you have to read the data later.
You have to use mirror-image input functions to read data
you output to files.
Writing to a Printer
Functions such as open( ) and others were not designed to write
only to files. They were designed to write to any device, including
files, the screen, and the printer. If you must write data to a printer,
you can treat the printer as if it were a file. The following program
opens a file pointer using the MS-DOS name for a printer located at
LPT1 (the MS-DOS name for the first parallel printer port):
/ / Fi l ename: C30PRNT. CPP
/ / Pr i nt s t o t he pr i nt er devi ce
#i ncl ude <f st r eam. h>
of st r eampr nt ; / / Poi nt s t o t he pr i nt er .
voi d mai n( )
Chapter 30 o Sequential Files
638
{
pr nt . open( LPT1, i os: : out ) ;
pr nt << Pr i nt er l i ne 1\ n; / / 1st l i ne pr i nt ed.
pr nt << Pr i nt er l i ne 2\ n; / / 2nd l i ne pr i nt ed.
pr nt << Pr i nt er l i ne 3\ n; / / 3r d l i ne pr i nt ed.
pr nt . cl ose( ) ;
r et ur n;
}
Make sure your printer is on and has paper before you run this
program. When you run the program, you see this printed on the
printer:
Pr i nt er l i ne 1
Pr i nt er l i ne 2
Pr i nt er l i ne 3
Adding to a File
You can easily add data to an existing file or create new files, by
opening the file in append access mode. Data files on the disk are
rarely static; they grow almost daily due to (hopefully!) increased
business. Being able to add to data already on the disk is very useful,
indeed.
Files you open for append access (using i os: : app) do not have
to exist. If the file exists, C++ appends data to the end of the file when
you write the data. If the file does not exist, C++ creates the file (as
is done when you open a file for write access).
Example
The following program adds three more names to the
NAMES.DAT file created in an earlier example.
/ / Fi l ename: C30AP1. CPP
/ / Adds t hr ee names t o a di sk f i l e.
#i ncl ude <f st r eam. h>
639
EXAMPLE
C+ + By
of st r eam f p;
voi d mai n( )
{
f p. open( NAMES. DAT, i os: : app) ; / / Adds t o f i l e.
f p << J ohnny Smi t h\ n;
f p << Laur a Hul l \ n;
f p << Mar k Br own\ n;
f p. cl ose( ) ; / / Rel ease t he f i l e.
r et ur n;
}
Here is what the file now looks like:
Mi chael Langst on
Sal l y Reddi ng
J ane Ki r k
St acy Wi ker t
J oe Hi quet
J ohnny Smi t h
Laur a Hul l
Mar k Br own
NOTE: If the file does not exist, C++ creates it and stores the
three names to the file.
Basically, you only have to change the open( ) functions access
mode to turn a file-creation program into a file-appending program.
Reading from a File
Once the data is in a file, you must be able to read that data. You
must open the file in a read access mode. There are several ways to
read data. You can read character data one character at a time or one
string at a time. The choice depends on the format of the data.
Files you open for read access (using i os: : i n) must exist al-
ready, or C++ gives you an error. You cannot read a file that does not
exist. open( ) returns zero if the file does not exist when you open it
for read access.
Fi l es must exi st
pri or to openi ng
them for read
access.
Chapter 30 o Sequential Files
640
Another event happens when reading files. Eventually, you
read all the data. Subsequent reading produces errors because there
is no more data to read. C++ provides a solution to the end-of-file
occurrence. If you attempt to read from a file that you have com-
pletely read the data from, C++ returns the value of zero. To find the
end-of-file condition, be sure to check for zero when reading infor-
mation from files.
Examples
1. This program asks the user for a filename and prints the
contents of the file to the screen. If the file does not exist, the
program displays an error message.
/ / Fi l ename: C30RE1. CPP
/ / Reads and di spl ays a f i l e.
#i ncl ude <f st r eam. h>
#i ncl ude <st dl i b. h>
i f st r eamf p;
voi d mai n( )
{
char f i l ename[ 12] ; / / Hol ds user s f i l ename.
char i n_char ; / / I nput char act er .
cout << What i s t he name of t he f i l e you want t o see? ;
ci n >> f i l ename;
f p. open( f i l ename, i os: : i n) ;
i f ( ! f p)
{
cout << \ n\ n*** That f i l e does not exi st ***\ n;
exi t ( 0) ; / / Exi t pr ogr am.
}
whi l e ( f p. get ( i n_char ) )
{ cout << i n_char ; }
f p. cl ose( ) ;
r et ur n;
}
641
EXAMPLE
C+ + By
Here is the resulting output when the NAMES.DAT file is
requested:
What i s t he name of t he f i l e you want t o see? NAMES. DAT
Mi chael Langst on
Sal l y Reddi ng
J ane Ki r k
St acy Wi ker t
J oe Hi quet
J ohnny Smi t h
Laur a Hul l
Mar k Br own
Because newline characters are in the file at the end of each
name, the names appear on-screen, one per line. If you
attempt to read a file that does not exist, the program dis-
plays the following message:
*** That f i l e does not exi st ***
2. This program reads one file and copies it to another. You
might want to use such a program to back up important data
in case the original file is damaged.
The program must open two files, the first for reading, and
the second for writing. The file pointer determines which of
the two files is being accessed.
/ / Fi l ename: C30RE2. CPP
/ / Makes a copy of a f i l e.
#i ncl ude <f st r eam. h>
#i ncl ude <st dl i b. h>
i f st r eami n_f p;
of st r eamout _f p;
voi d mai n( )
{
char i n_f i l ename[ 12] ; / / Hol ds or i gi nal f i l ename.
char out _f i l ename[ 12] ; / / Hol ds backup f i l ename.
char i n_char ; / / I nput char act er .
Chapter 30 o Sequential Files
642
cout << What i s t he name of t he f i l e you want t o back up?
;
ci n >> i n_f i l ename;
cout << What i s t he name of t he f i l e ;
cout << you want t o copy << i n_f i l ename << t o? ;
ci n >> out _f i l ename;
i n_f p. open( i n_f i l ename, i os: : i n) ;
i f ( ! i n_f p)
{
cout << \ n\ n*** << i n_f i l ename << does not exi st
***\ n;
exi t ( 0) ; / / Exi t pr ogr am
}
out _f p. open( out _f i l ename, i os: : out ) ;
i f ( ! out _f p)
{
cout << \ n\ n*** Er r or openi ng << i n_f i l ename <<
***\ n;
exi t ( 0) ; / / Exi t pr ogr am
}
cout << \ nCopyi ng. . . \ n; / / Wai t i ng message.
whi l e ( i n_f p. get ( i n_char ) )
{ out _f p. put ( i n_char ) ; }
cout << \ nThe f i l e i s copi ed. \ n;
i n_f p. cl ose( ) ;
out _f p. cl ose( ) ;
r et ur n;
}
Review Questions
Answers to the review questions are in Appendix B.
1. What are the three ways to access sequential files?
2. What advantage do disk files have over holding data in
memory?
3. How do sequential files differ from random-access files?
643
EXAMPLE
C+ + By
4. What happens if you open a file for read access and the file
does not exist?
5. What happens if you open a file for write access and the file
already exists?
6. What happens if you open a file for append access and the
file does not exist?
7. How does C++ inform you that you have reached the end-
of-file condition?
Review Exerc ises
1. Write a program that creates a file containing the following
data:
Your name
Your address
Your phone number
Your age
2. Write a second program that reads and prints the data file
you created in Exercise 1.
3. Write a program that takes your data created in Exercise 1
and writes it to the screen one word per line.
4. Write a program for PCs that backs up two important files:
the AUTOEXEC.BAT and CONFIG.SYS. Call the backup
files AUTOEXEC.SAV and CONFIG.SAV.
5. Write a program that reads a file and creates a new file with
the same data, except reverse the case on the second file.
Everywhere uppercase letters appear in the first file, write
lowercase letters to the new file, and everywhere lowercase
letters appear in the first file, write uppercase letters to the
new file.
Chapter 30 o Sequential Files
644
Summary
You can now perform one of the most important requirements
of data processing: writing and reading to and from disk files. Before
this chapter, you could only store data in variables. The short life of
variables (they only last as long as your program is running) made
long-term storage of data impossible. You can now save large
amounts of data in disk files to process later.
Reading and writing sequential files involves learning more
concepts than actual commands or functions. The open( ) and cl ose( )
functions are the most important functions you learned in this
chapter. You are now familiar with most of the I/O functions needed
to retrieve data to and from disk files.
The next chapter concludes the discussion of disk files in this
book. You will learn how to create and use random-access files. By
programming with random file access, you can read selected data
from a file, as well as change data without having to rewrite the
entire file.
645
EXAMPLE
C+ + By
31
Random-Ac c ess
Files
This chapter introduces the concept of random file access. Random
file access enables you to read or write any data in your disk file
without having to read or write every piece of data before it. You can
quickly search for, add, retrieve, change, and delete information in
a random-access file. Although you need a few new functions to
access files randomly, you find that the extra effort pays off in
flexibility, power, and speed of disk access.
This chapter introduces
o Random-access files
o File records
o The seekg( ) function
o Special-purpose file I/O functions
With C++s sequential and random-access files, you can do
everything you would ever want to do with disk data.
Chapter 31 o Random -Access Files
646
Random File Rec ords
Random files exemplify the power of data processing with
C++. Sequential file processing is slow unless you read the entire
file into arrays and process them in memory. As explained in
Chapter 30, however, you have much more disk space than RAM,
and most disk files do not even fit in your RAM at one time.
Therefore, you need a way to quickly read individual pieces of
data from a file in any order and process them one at a time.
Generally, you read and write file records. A record to a file is
analogous to a C++ structure. A record is a collection of one or more
data values (called fields) you read and write to disk. Generally, you
store data in structures and write the structures to disk where they
are called records. When you read a record from disk, you generally
read that record into a structure variable and process it with your
program.
Unlike most programming languages, not all disk data for C++
programs has to be stored in record format. Typically, you write a
stream of characters to a disk file and access that data either sequen-
tially or randomly by reading it into variables and structures.
The process of randomly accessing data in a file is simple. Think
about the data files of a large credit card organization. When you
make a purchase, the store calls the credit card company to receive
authorization. Millions of names are in the credit card companys
files. There is no quick way the credit card company could read
every record sequentially from the disk that comes before yours.
Sequential files do not lend themselves to quick access. It is not
feasible, in many situations, to look up individual records in a data
file with sequential access.
The credit card companies must use a random file access so
their computers can go directly to your record, just as you go directly
to a song on a compact disk or record album. The functions you use
are different from the sequential functions, but the power that
results from learning the added functions is worth the effort.
When your program reads and writes files randomly, it treats
the file like a big array. With arrays, you know you can add, print,
or remove values in any order. You do not have to start at the first
A record to a fi l e i s
l i ke a structure to
vari abl es.
You do not have to
rewri te an enti re fi l e
to change random-
access fi l e data.
647
EXAMPLE
C+ + By
array element, sequentially looking at the next one, until you get the
element you need. You can view your random-access file in the same
way, accessing the data in any order.
Most random file records are fixed-length records. Each record
(usually a row in the file) takes the same amount of disk space.
Most of the sequential files you read and wrote in the previous
chapters were variable-length records. When you are reading or
writing sequentially, there is no need for fixed-length records be-
cause you input each value one character, word, string, or number
at a time, and look for the data you want. With fixed-length records,
your computer can better calculate where on the disk the desired
record is located.
Although you waste some disk space with fixed-length records
(because of the spaces that pad some of the fields), the advantages
of random file access compensate for the wasted disk space (when
the data do not actually fill the structure size).
TIP: With random-access files, you can read or write records
in any order. Therefore, even if you want to perform sequential
reading or writing of the file, you can use random-access
processing and randomly read or write the file in sequential
record number order.
Opening Random-Ac c ess
Files
Just as with sequential files, you must open random-access files
before reading or writing to them. You can use any of the read access
modes mentioned in Chapter 30 (such as i os: : i n) only to read a file
randomly. However, to modify data in a file, you must open the file
in one of the update modes, repeated for you in Table 31.1.
Chapter 31 o Random -Access Files
648
Table 31.1. Random-ac c ess update modes.
Mode Description
app Open the file for appending (adding to it)
at e Seek to end of file on opening it
i n Open file for reading
out Open file for writing
bi nar y Open file in binary mode
t r unc Discard contents if file exists
nocr eat e If file doesnt exist, open fails
nor epl ace If file exists, open fails unless appending or seeking to
end of file on opening
There is really no difference between sequential files and
random files in C++. The difference between the files is not physical,
but lies in the method you use to access them and update them.
Examples
1. Suppose you want to write a program to create a file of your
friends names. The following open( ) function call suffices,
assuming f p is declared as a file pointer:
f p. open( NAMES. DAT, i os: : out ) ;
i f ( ! f p)
{ cout << \ n*** Cannot open f i l e ***\ n; }
No update open( ) access mode is needed if you are only
creating the file. However, what if you wanted to create the
file, write names to it, and give the user a chance to change
any of the names before closing the file? You then have to
open the file like this:
f p. open( NAMES. DAT, i os: : i n | i os: : out ) ;
i f ( ! f p)
cout << \ n*** Cannot open f i l e ***\ n;
649
EXAMPLE
C+ + By
This code enables you to create the file, then change data
you wrote to the file.
2. As with sequential files, the only difference between using a
binary open( ) access mode and a text mode is that the file
you create is more compact and saves disk space. You
cannot, however, read that file from other programs as an
ASCII text file. The previous open( ) function can be rewritten
to create and allow updating of a binary file. All other file-
related commands and functions work for binary files just as
they do for text files.
f p. open( NAMES. DAT, i os: : i n | i os: : out | i os: : bi nar y) ;
i f ( ! f p)
cout << \ n*** Cannot open f i l e ***\ n;
The seekg( ) Func tion
C++ provides a function that enables you to read to a specific
point in a random-access data file. This is the seekg( ) function. The
format of seekg( ) is
f i l e_pt r . seekg( l ong_num, or i gi n) ;
f i l e_pt r is the pointer to the file that you want to access,
initialized with an open( ) statement. l ong_num is the number of bytes
in the file you want to skip. C++ does not read this many bytes, but
literally skips the data by the number of bytes specified in l ong_num.
Skipping the bytes on the disk is much faster than reading them. If
l ong_num is negative, C++ skips backwards in the file (this allows for
rereading of data several times). Because data files can be large, you
must declare l ong_num as a long integer to hold a large amount of
bytes.
or i gi n is a value that tells C++ where to begin the skipping of
bytes specified by l ong_num. or i gi n can be any of the three values
shown in Table 31.2.
You can read
forwards or
backwards from any
poi nt i n the fi l e wi th
seekg( ) .
Chapter 31 o Random -Access Files
650
Table 31.2. Possible or i gi n values.
Description or i gi n Equivalent
Beginning of file SEEK_SET i os: : beg
Current file position SEEK_CUR i os: : cur
End of file SEEK_END i os: : end
The origins SEEK_SET, SEEK_CUR, and SEEK_END are de-
fined in stdio.h. The equivalents i os: : beg, i os: : cur , and i os: : end are
defined in fstream.h.
NOTE: Actually, the file pointer plays a much more important
role than simply pointing to the file on the disk. The file
pointer continually points to the exact location of the next byte
to read or write. In other words, as you read data from either a
sequential or random-access file, the file pointer increments
with each byte read. By using seekg( ) , you can move the file
pointer forward or backward in the file.
Examples
1. No matter how far into a file you have read, the following
seekg( ) function positions the file pointer back to the begin-
ning of a file:
f p. seekg( 0L, SEEK_SET) ; / / Posi t i on f i l e poi nt er at begi nni ng.
The constant 0L passes a long integer 0 to the seekg( ) func-
tion. Without the L, C++ passes a regular integer and this
does not match the prototype for seekg( ) that is located in
fstream.h. Chapter 4, Variables and Literals, explained the
use of data type suffixes on numeric constants, but the
suffixes have not been used until now.
This seekg( ) function literally reads move the file pointer 0
bytes from the beginning of the file.
651
EXAMPLE
C+ + By
2. The following example reads a file named MYFILE.TXT
twice, once to send the file to the screen and once to send the
file to the printer. Three file pointers are used, one for each
device (the file, the screen, and the printer).
/ / Fi l ename: C31TWI C. CPP
/ / Wr i t es a f i l e t o t he pr i nt er , r er eads i t ,
/ / and sends i t t o t he scr een.
#i ncl ude <f st r eam. h>
#i ncl ude <st dl i b. h>
#i ncl ude <st di o. h>
i f st r eami n_f i l e; / / I nput f i l e poi nt er .
of st r eamscr n; / / Scr een poi nt er .
of st r eampr nt ; / / Pr i nt er poi nt er .
voi d mai n( )
{
char i n_char ;
i n_f i l e. open( MYFI LE. TXT, i os: : i n) ;
i f ( ! i n_f i l e)
{
cout << \ n*** Er r or openi ng MYFI LE. TXT ***\ n;
exi t ( 0) ;
}
scr n. open( CON, i os: : out ) ; / / Open scr een devi ce.
whi l e ( i n_f i l e. get ( i n_char ) )
{ scr n << i n_char ; } / / Out put char act er s t o t he scr een.
scr n. cl ose( ) ; / / Cl ose scr een because i t i s no
/ / l onger needed.
i n_f i l e. seekg( 0L, SEEK_SET) ; / / Reposi t i on f i l e poi nt er .
pr nt . open( LPT1, i os: : out ) ; / / Open pr i nt er devi ce.
whi l e ( i n_f i l e. get ( i n_char ) )
{ pr nt << i n_char ; } / / Out put char act er s t o t he
/ / pr i nt er .
pr nt . cl ose( ) ; / / Al ways cl ose al l open f i l es.
i n_f i l e. cl ose( ) ;
r et ur n;
}
Chapter 31 o Random -Access Files
652
You also can close then reopen a file to position the file
pointer at the beginning, but using seekg( ) is a more efficient
method.
Of course, you could have used regular I/O functions to
write to the screen, rather than having to open the screen as
a separate device.
3. The following seekg( ) function positions the file pointer at
the 30th byte in the file. (The next byte read is the 31st byte.)
f i l e_pt r . seekg( 30L, SEEK_SET) ; / / Posi t i on f i l e poi nt er
/ / at t he 30t h byt e.
This seekg( ) function literally reads move the file pointer 30
bytes from the beginning of the file.
If you write structures to a file, you can quickly seek any
structure in the file using the si zeof ( ) function. Suppose you
want the 123rd occurrence of the structure tagged with
i nvent or y. You would search using the following seekg( )
function:
f i l e_pt r . seekg( ( 123L * si zeof ( st r uct i nvent or y) ) , SEEK_SET) ;
4. The following program writes the letters of the alphabet to a
file called ALPH.TXT. The seekg( ) function is then used to
read and display the ninth and 17th letters (I and Q).
/ / Fi l ename: C31ALPH. CPP
/ / St or es t he al phabet i n a f i l e, t hen r eads
/ / t wo l et t er s f r omi t .
#i ncl ude <f st r eam. h>
#i ncl ude <st dl i b. h>
#i ncl ude <st di o. h>
f st r eamf p;
voi d mai n( )
{
char ch; / / Hol ds A t hr ough Z.
653
EXAMPLE
C+ + By
/ / Open i n updat e mode so you can r ead f i l e af t er wr i t i ng t o i t .
f p. open( al ph. t xt , i os: : i n | i os: : out ) ;
i f ( ! f p)
{
cout << \ n*** Er r or openi ng f i l e ***\ n;
exi t ( 0) ;
}
f or ( ch = A ; ch <= Z ; ch++)
{ f p << ch; } / / Wr i t e l et t er s.
f p. seekg( 8L, i os: : beg) ; / / Ski p ei ght l et t er s, poi nt t o I .
f p >> ch;
cout << The f i r st char act er i s << ch << \ n;
f p. seekg( 16L, i os: : beg) ; / / Ski p 16 l et t er s, poi nt t o Q.
f p >> ch;
cout << The second char act er i s << ch << \ n;
f p. cl ose( ) ;
r et ur n;
}
5. To point to the end of a data file, you can use the seekg( )
function to position the file pointer at the last byte. Subse-
quent seekg( ) s should then use a negative l ong_numvalue to
skip backwards in the file. The following seekg( ) function
makes the file pointer point to the end of the file:
f i l e_pt r . seekg( 0L, SEEK_END) ; / / Posi t i on f i l e
/ / poi nt er at t he end.
This seekg( ) function literally reads move the file pointer 0
bytes from the end of the file. The file pointer now points to
the end-of-file marker, but you can seekg( ) backwards to find
other data in the file.
6. The following program reads the ALPH.TXT file (created in
Exercise 4) backwards, printing each character as it skips
back in the file.
/ / Fi l ename: C31BACK. CPP
/ / Reads and pr i nt s a f i l e backwar ds.
Chapter 31 o Random -Access Files
654
#i ncl ude <f st r eam. h>
#i ncl ude <st dl i b. h>
#i ncl ude <st di o. h>
i f st r eamf p;
voi d mai n( )
{
i nt ct r ; / / St eps t hr ough t he 26 l et t er s i n t he f i l e.
char i n_char ;
f p. open( ALPH. TXT, i os: : i n) ;
i f ( ! f p)
{
cout << \ n*** Er r or openi ng f i l e ***\ n;
exi t ( 0) ;
}
f p. seekg( - 1L, SEEK_END) ; / / Poi nt t o l ast byt e i n
/ / t he f i l e.
f or ( ct r = 0; ct r < 26; ct r ++)
{
f p >> i n_char ;
f p. seekg( - 2L, SEEK_CUR) ;
cout << i n_char ;
}
f p. cl ose( ) ;
r et ur n;
}
This program also uses the SEEK_CUR or i gi n value. The last
seekg( ) in the program seeks two bytes backwards from the
current position, not the beginning or end as the previous
examples have. The f or loop towards the end of the program
performs a skip-two-bytes-back, read-one-byte-forward
method to skip through the file backwards.
7. The following program performs the same actions as Ex-
ample 4 (C31ALPH.CPP), with one addition. When the
letters I and Q are found, the letter x is written over the I and
Q. The seekg( ) must be used to back up one byte in the file to
overwrite the letter just read.
655
EXAMPLE
C+ + By
/ / Fi l ename: C31CHANG. CPP
/ / St or es t he al phabet i n a f i l e, r eads t wo l et t er s f r omi t ,
/ / and changes t hose l et t er s t o xs.
#i ncl ude <f st r eam. h>
#i ncl ude <st dl i b. h>
#i ncl ude <st di o. h>
f st r eamf p;
voi d mai n( )
{
char ch; / / Hol ds A t hr ough Z.
/ / Open i n updat e mode so you can r ead f i l e af t er wr i t i ng t o i t .
f p. open( al ph. t xt , i os: : i n | i os: : out ) ;
i f ( ! f p)
{
cout << \ n*** Er r or openi ng f i l e ***\ n;
exi t ( 0) ;
}
f or ( ch = A ; ch <= Z ; ch++)
{ f p << ch; } / / Wr i t e l et t er s
f p. seekg( 8L, SEEK_SET) ; / / Ski p ei ght l et t er s, poi nt t o I .
f p >> ch;
/ / Change t he Q t o an x.
f p. seekg( - 1L, SEEK_CUR) ;
f p << x ;
cout << The f i r st char act er i s << ch << \ n;
f p. seekg( 16L, SEEK_SET) ; / / Ski p 16 l et t er s, poi nt t o Q.
f p >> ch;
cout << The second char act er i s << ch << \ n;
/ / Change t he Q t o an x.
f p. seekg( - 1L, SEEK_CUR) ;
f p << x ;
f p. cl ose( ) ;
r et ur n;
}
Chapter 31 o Random -Access Files
656
The file named ALPH.TXT now looks like this:
ABCDEFGHxJ KLMNOPxRSTUVWXYZ
This program forms the basis of a more complete data file
management program. After you master the seekg( ) func-
tions and become more familiar with disk data files, you will
begin to write programs that store more advanced data
structures and access them.
The mailing list application in Appendix F is a good example
of what you can do with random file access. The user is
given a chance to change names and addresses already in
the file. The program, using random access, seeks for and
changes selected data without rewriting the entire disk file.
Other Helpful I/O Func tions
There are several more disk I/O functions available that you
might find useful. They are mentioned here for completeness. As
you perform more powerful disk I/O, you might find a use for many
of these functions. Each of these functions is prototyped in the
fstream.h header file.
o r ead( ar r ay, count ) : Reads the data specified by count into the
array or pointer specified by ar r ay. r ead( ) is called a buffered
I/O function. r ead( ) enables you to read much data with a
single function call.
o wr i t e( ar r ay, count ) : Writes count ar r ay bytes to the specified
file. wr i t e( ) is a buffered I/O function. wr i t e( ) enables you to
write much data in a single function call.
o r emove( f i l ename) : Erases the file named by f i l ename. r emove( )
returns a 0 if the file was erased successfully and - 1 if an
error occurred.
Many of these (and other built-in I/O functions that you learn
in your C++ programming career) are helpful functions that you
could duplicate using what you already know.
657
EXAMPLE
C+ + By
The buffered I/O file functions enable you to read and write
entire arrays (including arrays of structures) to the disk in a single
function call.
Examples
1. The following program requests a filename from the user
and erases the file from the disk using the r emove( ) function.
/ / Fi l ename: C31ERAS. CPP
/ / Er ases t he f i l e speci f i ed by t he user .
#i ncl ude <st di o. h>
#i ncl ude <i ost r eam. h>
voi d mai n( )
{
char f i l ename[ 12] ;
cout << What i s t he f i l ename you want me t o er ase? ;
ci n >> f i l ename;
i f ( r emove( f i l ename) == - 1)
{ cout << \ n*** I coul d not r emove t he f i l e ***\ n; }
el se
{ cout << \ nThe f i l e << f i l ename << i s now r emoved\ n; }
r et ur n;
}
2. The following function is part of a larger program that
receives inventory data, in an array of structures, from the
user. This function is passed the array name and the number
of elements (structure variables) in the array. The wr i t e( )
function then writes the complete array of structures to the
disk file pointed to by f p.
voi d wr i t e_st r ( i nvent or y i t ems[ ] , i nt i nv_cnt )
{
f p. wr i t e( i t ems, i nv_cnt * si zeof ( i nvent or y) ;
r et ur n;
}
Chapter 31 o Random -Access Files
658
If the inventory array had 1,000 elements, this one-line
function would still write the entire array to the disk file.
You could use the r ead( ) function to read the entire array of
structures from the disk in a single function call.
Review Questions
The answers to the review questions are in Appendix B.
1. What is the difference between records and structures?
2. True or false: You have to create a random-access file before
reading from it randomly.
3. What happens to the file pointer as you read from a file?
4. What are the two buffered file I/O functions?
5. What is wrong with this program?
#i ncl ude <f st r eam. h>
i f st r eam f p;
voi d mai n( )
{
char i n_char ;
f p. open( i os: : i n | i os: : bi nar y) ;
i f ( f p. get ( i n_char ) )
{ cout << i n_char ; } / / Wr i t e t o t he scr een
f p. cl ose( ) ;
r et ur n;
}
Review Exerc ises
1. Write a program that asks the user for a list of five names,
then writes the names to a file. Rewind the file and display
its contents on-screen using the seekg( ) and get ( ) functions.
659
EXAMPLE
C+ + By
2. Rewrite the program in Exercise 1 so it displays every other
character in the file of names.
3. Write a program that reads characters from a file. If the input
character is a lowercase letter, change it to uppercase. If the
input character is an uppercase letter, change it to lowercase.
Do not change other characters in the file.
4. Write a program that displays the number of nonalphabetic
characters in a file.
5. Write a grade-keeping program for a teacher. Allow the
teacher to enter up to 10 students grades. Each student has
three grades for the semester. Store the students names and
their three grades in an array of structures and store the data
on the disk. Make the program menu-driven. Include op-
tions of adding more students, viewing the files data, or
printing the grades to the printer with a calculated class
average.
Summary
C++ supports random-access files with several functions. These
functions include error checking, file pointer positioning, and the
opening and closing of files. You now have the tools you need to save
your C++ program data to disk for storage and retrieval.
The mailing-list application in Appendix F offers a complete
example of random-access file manipulation. The program enables
the user to enter names and addresses, store them to disk, edit them,
change them, and print them from the disk file. The mailing-list
program combines almost every topic from this book into a com-
plete application that puts it all together.
Chapter 31 o Random -Access Files
660
661
EXAMPLE
C+ + By
32
Introduc tion to
Objec t-Oriented
Programming
The most widely used object-oriented programming language to-
day is C++. C++ provides classeswhich are its objects. Classes
really distinguish C++ from C. In fact, before the name C++ was
coined, the C++ language was called C with classes.
This chapter attempts to expose you to the world of object-
oriented programming, often called OOP. You will probably not
become a master of OOP in these few short pages, however, you are
ready to begin expanding your C++ knowledge.
This chapter introduces the following concepts:
o C++ classes
o Member functions
o Constructors
o Destructors
This chapter concludes your introduction to the C++ language.
After mastering the techniques taught in this book, you will be ready
to modify the mailing list program in Appendix F to suit your own
needs.
Chapter 32 o Introduction to O bject-O riented Program m ing
662
What Is a Class?
A class is a user-defined data type that resembles a structure. A
class can have data members, but unlike the structures you have
seen thus far, classes can also have member functions. The data
members can be of any type, whether defined by the language or by
you. The member functions can manipulate the data, create and
destroy class variables, and even redefine C++s operators to act on
the class objects.
Classes have several types of members, but they all fall into two
categories: data members and member functions.
Data Members
Data members can be of any type. Here is a simple class:
/ / A spher e cl ass.
cl ass Spher e
{
publ i c:
f l oat r ; / / Radi us of spher e
f l oat x, y, z; / / Coor di nat es of spher e
};
Notice how this class resembles structures you have already
seen, with the exception of the publ i c keyword. The Spher e class has
four data members: r , x, y, and z. In this case, the publ i c keyword
plays an important role; it identifies the class Spher e as a structure.
As a matter of fact, in C++, a public class is physically identical to a
structure. For now, ignore the publ i c keyword; it is explained later
in this chapter.
Member Func tions
A class can also have member functions (members of a class that
manipulate data members). This is one of the primary features that
distinguishes a class from a structure. Here is the Spher e class again,
with member functions added:
663
EXAMPLE
C+ + By
#i ncl ude <mat h. h>
const f l oat PI = 3. 14159;
/ / A spher e cl ass.
cl ass Spher e
{
publ i c:
f l oat r ; / / Radi us of spher e
f l oat x, y, z; / / Coor di nat es of spher e
Spher e( f l oat xcoor d, f l oat ycoor d, f l oat zcoor d, f l oat r adi us)
{ x = xcoor d; y = ycoor d; z = zcoor d; r = r adi us; }
~Spher e( ) { }
f l oat vol ume( )
{
r et ur n ( r * r * r * 4 * PI / 3) ;
}
f l oat sur f ace_ar ea( )
{
r et ur n ( r * r * 4 * PI ) ;
}
};
This Spher e class has four member functions: Spher e( ) , ~Spher e( ) ,
vol ume( ) , and sur f ace_ar ea( ) . The class is losing its similarity to a
structure. These member functions are very short. (The one with the
strange name of ~Spher e( ) has no code in it.) If the codes of the
member functions were much longer, only the prototypes would
appear in the class, and the code for the member functions would
follow later in the program.
C++ programmers call class data objects because classes do
more than simply hold data. Classes act on data; in effect, a class is
an object that manipulates itself. All the data you have seen so far in
this book is passive data (data that has been manipulated by code in
the program). Classes member functions actually manipulate class
data.
In this example, the class member Spher e( ) is a special function.
It is a constructor function, and its name must always be the same as
its class. Its primary use is declaring a new instance of the class.
Constructors create
and i ni ti al i ze cl ass
data.
Chapter 32 o Introduction to O bject-O riented Program m ing
664
Examples
1. The following program uses the Spher e( ) class to initialize a
class variable (called a class instance) and print it.
/ / Fi l ename: C32CON. CPP
/ / Demonst r at es use of a cl ass const r uct or f unct i on.
#i ncl ude <i ost r eam. h>
const f l oat PI = 3. 14159; / / Appr oxi mat e val ue of pi .
/ / A spher e cl ass.
cl ass Spher e
{
publ i c:
f l oat r ; / / Radi us of spher e
f l oat x, y, z; / / Coor di nat es of spher e
Spher e( f l oat xcoor d, f l oat ycoor d,
f l oat zcoor d, f l oat r adi us)
{ x = xcoor d; y = ycoor d; z = zcoor d; r = r adi us; }
~Spher e( ) { }
f l oat vol ume( )
{
r et ur n ( r * r * r * 4 * PI / 3) ;
}
f l oat sur f ace_ar ea( )
{
r et ur n ( r * r * 4 * PI ) ;
}
};
voi d mai n( )
{
Spher e s( 1. 0, 2. 0, 3. 0, 4. 0) ;
cout << X = << s. x << , Y = << s. y
<< , Z = << s. z << , R = << s. r << \ n;
r et ur n;
}
665
EXAMPLE
C+ + By
Note: In OOP, the mai n( ) function (and all it calls) becomes
smaller because member functions contain the code that ma-
nipulates all class data.
Indeed, this program looks different from those you have
seen so far. This example is your first true exposure to OOP
programming. Here is the output of this program:
X = 1, Y = 2, Z = 3, R = 4
This program illustrates the Spher e( ) constructor function.
The constructor function is the only member function called
by the program. Notice the ~Spher e( ) member function
constructed s, and initialized its data members as well.
The other special function is the destructor function,
~Spher e( ) . Notice that it also has the same name as the class,
but with a tilde (~) as a prefix. The destructor function never
takes arguments, and never returns values. Also notice that
this destructor doesnt do anything. Most destructors do
very little. If a destructor has no real purpose, you do not
have to specify it. When the class variable goes out of scope,
the memory allocated for that class variable is returned to
the system (in other words, an automatic destruction oc-
curs). Programmers use destructor functions to free memory
occupied by class data in advanced C++ applications.
Similarly, if a constructor doesnt serve any specific function,
you arent required to declare one. C++ allocates memory for
a class variable when you define the class variable, just as it
does for all other variables. As you learn more about C++
programming, especially when you begin using the ad-
vanced concept of dynamic memory allocation, constructors
and destructors become more useful.
2. To illustrate that the ~Spher e( ) destructor does get called (it
just doesnt do anything), you can put a cout statement in the
constructor as seen in the next program:
/ / Fi l ename: C32DES. CPP
/ / Demonst r at es use of a cl ass dest r uct or f unct i on.
Destructors erase
cl ass data.
Chapter 32 o Introduction to O bject-O riented Program m ing
666
#i ncl ude <i ost r eam. h>
#i ncl ude <mat h. h>
const f l oat PI = 3. 14159; / / Appr oxi mat e val ue of pi .
/ / A spher e cl ass
cl ass Spher e
{
publ i c:
f l oat r ; / / Radi us of spher e
f l oat x, y, z; / / Coor di nat es of spher e
Spher e( f l oat xcoor d, f l oat ycoor d,
f l oat zcoor d, f l oat r adi us)
{ x = xcoor d; y = ycoor d; z = zcoor d; r = r adi us; }
~Spher e( )
{
cout << Spher e ( << x << , << y
<< , << z << , << r << ) dest r oyed\ n;
}
f l oat vol ume( )
{
r et ur n ( r * r * r * 4 * PI / 3) ;
}
f l oat sur f ace_ar ea( )
{
r et ur n ( r * r * 4 * PI ) ;
}
};
voi d mai n( voi d)
{
Spher e s( 1. 0, 2. 0, 3. 0, 4. 0) ;
/ / Const r uct a cl ass i nst ance.
cout << X = << s. x << , Y =
<< s. y << , Z = << s. z << , R = << s. r << \ n;
r et ur n;
}
Here is the output of this program:
X = 1, Y = 2, Z = 3, R = 4
Spher e ( 1, 2, 3, 4) dest r oyed
667
EXAMPLE
C+ + By
Notice that mai n( ) did not explicitly call the destructor
function, but ~Spher e( ) was called automatically when the
class instance went out of scope.
3. The other member functions have been waiting to be used.
The following program uses the vol ume( ) and sur f ace_ar ea( )
functions:
/ / Fi l ename: C32MEM. CPP
/ / Demonst r at es use of cl ass member f unct i ons.
#i ncl ude <i ost r eam. h>
#i ncl ude <mat h. h>
const f l oat PI = 3. 14159; / / Appr oxi mat e val ue of pi .
/ / A spher e cl ass.
cl ass Spher e
{
publ i c:
f l oat r ; / / Radi us of spher e
f l oat x, y, z; / / Coor di nat es of spher e
Spher e( f l oat xcoor d, f l oat ycoor d,
f l oat zcoor d, f l oat r adi us)
{ x = xcoor d; y = ycoor d; z = zcoor d; r = r adi us; }
~Spher e( )
{
cout << Spher e ( << x << , << y
<< , << z << , << r << ) dest r oyed\ n;
}
f l oat vol ume( )
{
r et ur n ( r * r * r * 4 * PI / 3) ;
}
f l oat sur f ace_ar ea( )
{
r et ur n ( r * r * 4 * PI ) ;
}
}; / / End of cl ass.
voi d mai n( )
{
Spher e s( 1. 0, 2. 0, 3. 0, 4. 0) ;
cout << X = << s. x << , Y = << s. y
<< , Z = << s. z << , R = << s. r << \ n;
Chapter 32 o Introduction to O bject-O riented Program m ing
668
cout << The vol ume i s << s. vol ume( ) << \ n;
cout << The sur f ace ar ea i s
<< s. sur f ace_ar ea( ) << \ n;
}
The vol ume( ) and sur f ace_ar ea( ) functions could have been
made in-line. This means that the compiler embeds the
functions in the code, rather than calling them as functions.
In C32MEM.CPP, there is essentially a separate function that
is called using the data in Spher e( ) . By making it in-line,
Spher e( ) essentially becomes a macro and is expanded in the
code.
4. In the following program, vol ume( ) has been changed to an
in-line function, creating a more efficient program:
/ / Fi l ename: C32MEM1. CPP
/ / Demonst r at es use of i n- l i ne cl ass member f unct i ons.
#i ncl ude <i ost r eam. h>
#i ncl ude <mat h. h>
const f l oat PI = 3. 14159; / / Appr oxi mat e val ue of pi .
/ / A spher e cl ass.
cl ass Spher e
{
publ i c:
f l oat r ; / / Radi us of spher e
f l oat x, y, z; / / Coor di nat es of spher e
Spher e( f l oat xcoor d, f l oat ycoor d, f l oat zcoor d, f l oat r adi us)
{ x = xcoor d; y = ycoor d; z = zcoor d; r = r adi us; }
~Spher e( )
{
cout << Spher e ( << x << , << y
<< , << z << , << r << ) dest r oyed\ n;
}
i nl i ne f l oat vol ume( )
{
r et ur n ( r * r * r * 4 * PI / 3) ;
}
f l oat sur f ace_ar ea( )
{
r et ur n ( r * r * 4 * PI ) ;
669
EXAMPLE
C+ + By
}
};
voi d mai n( )
{
Spher e s( 1. 0, 2. 0, 3. 0, 4. 0) ;
cout << X = << s. x << , Y = << s. y
<< , Z = << s. z << , R = << s. r << \ n;
cout << The vol ume i s << s. vol ume( ) << \ n;
cout << The sur f ace ar ea i s << s. sur f ace_ar ea( ) << \ n;
}
The inline functions expand to look like this to the compiler:
/ / C32MEM1A. CPP
/ / Demonst r at es use of i n- l i ne cl ass member f unct i ons.
#i ncl ude <i ost r eam. h>
#i ncl ude <mat h. h>
const f l oat PI = 3. 14159; / / Appr oxi mat e val ue of pi .
/ / A spher e cl ass
cl ass Spher e
{
publ i c:
f l oat r ; / / Radi us of spher e
f l oat x, y, z; / / Coor di nat es of spher e
Spher e( f l oat xcoor d, f l oat ycoor d, f l oat zcoor d, f l oat r adi us)
{ x = xcoor d; y = ycoor d; z = zcoor d; r = r adi us; }
~Spher e( )
{
cout << Spher e ( << x << , << y
<< , << z << , << r << ) dest r oyed\ n;
}
i nl i ne f l oat vol ume( )
{
r et ur n ( r * r * r * 4 * PI / 3) ;
}
f l oat sur f ace_ar ea( )
{
r et ur n ( r * r * 4 * PI ) ;
}
};
Chapter 32 o Introduction to O bject-O riented Program m ing
670
The advantage of using in-line functions is that they execute
fastertheres no function-call overhead involved because
no function is actually called. The disadvantage is that if
your functions are used frequently, your programs become
larger and larger as functions are expanded.
Default Member Arguments
You can also give member functions arguments by default.
Assume by default that the y coordinate of a sphere will be 2.0, the
z coordinate will be 2.5, and the radius will be 1.0. Rewriting the
previous examples constructor function to do this results in this
code:
Spher e( f l oat xcoor d, f l oat ycoor d = 2. 0, f l oat zcoor d = 2. 5,
f l oat r adi us = 1. 0)
{ x = xcoor d; y = ycoor d; z = zcoor d; r = r adi us; }
You can create a sphere with the following instructions:
Spher e s( 1. 0) ; / / Use al l def aul t
Spher e t ( 1. 0, 1. 1) ; / / Over r i de y coor d
Spher e u( 1. 0, 1. 1, 1. 2) ; / / Over r i de y and z
Spher e v( 1. 0, 1. 1, 1. 2, 1. 3) ; / / Over r i de al l def aul t s
voi d mai n( )
{
Spher e s( 1. 0, 2. 0, 3. 0, 4. 0) ;
cout << X = << s. x << , Y = << s. y
<< , Z = << s. z << , R = << s. r << \ n;
cout << The vol ume i s << ( s. r * s. r * s. r * 4 * PI / 3)
<< \ n;
cout << The sur f ace ar ea i s << s. sur f ace_ar ea( ) << \ n;
}
671
EXAMPLE
C+ + By
Examples
1. Default arguments are used in the following code.
/ / Fi l ename: C32DEF. CPP
/ / Demonst r at es use of def aul t ar gument s i n
/ / cl ass member f unct i ons.
#i ncl ude <i ost r eam. h>
#i ncl ude <mat h. h>
const f l oat PI = 3. 14159; / / Appr oxi mat e val ue of pi .
/ / A spher e cl ass.
cl ass Spher e
{
publ i c:
f l oat r ; / / Radi us of spher e
f l oat x, y, z; / / Coor di nat es of spher e
Spher e( f l oat xcoor d, f l oat ycoor d = 2. 0,
f l oat zcoor d = 2. 5, f l oat r adi us = 1. 0)
{ x = xcoor d; y = ycoor d; z = zcoor d; r = r adi us; }
~Spher e( )
{
cout << Spher e ( << x << , << y
<< , << z << , << r << ) dest r oyed\ n;
}
i nl i ne f l oat vol ume( )
{
r et ur n ( r * r * r * 4 * PI / 3) ;
}
f l oat sur f ace_ar ea( )
{
r et ur n ( r * r * 4 * PI ) ;
}
};
voi d mai n( )
{
Spher e s( 1. 0) ; / / use al l def aul t
Spher e t ( 1. 0, 1. 1) ; / / over r i de y coor d
Spher e u( 1. 0, 1. 1, 1. 2) ; / / over r i de y and z
Spher e v( 1. 0, 1. 1, 1. 2, 1. 3) ; / / over r i de al l def aul t s
cout << s: X = << s. x << , Y = << s. y
<< , Z = << s. z << , R = << s. r << \ n;
Chapter 32 o Introduction to O bject-O riented Program m ing
672
cout << The vol ume of s i s << s. vol ume( ) << \ n;
cout << The sur f ace ar ea of s i s << s. sur f ace_ar ea( ) << \ n;
cout << t : X = << t . x << , Y = << t . y
<< , Z = << t . z << , R = << t . r << \ n;
cout << The vol ume of t i s << t . vol ume( ) << \ n;
cout << The sur f ace ar ea of t i s << t . sur f ace_ar ea( ) << \ n;
cout << u: X = << u. x << , Y = << u. y
<< , Z = << u. z << , R = << u. r << \ n;
cout << The vol ume of u i s << u. vol ume( ) << \ n;
cout << The sur f ace ar ea of u i s << u. sur f ace_ar ea( ) << \ n;
cout << v: X = << v. x << , Y = << v. y
<< , Z = << v. z << , R = << v. r << \ n;
cout << The vol ume of v i s << v. vol ume( ) << \ n;
cout << The sur f ace ar ea of v i s << v. sur f ace_ar ea( ) << \ n;
r et ur n;
}
Here is the output from this program:
s: X = 1, Y = 2, Z = 2. 5, R = 1
The vol ume of s i s 4. 188787
The sur f ace ar ea of s i s 12. 56636
t : X = 1, Y = 1. 1, Z = 2. 5, R = 1
The vol ume of t i s 4. 188787
The sur f ace ar ea of t i s 12. 56636
u: X = 1, Y = 1. 1, Z = 1. 2, R = 1
The vol ume of u i s 4. 188787
The sur f ace ar ea of u i s 12. 56636
v: X = 1, Y = 1. 1, Z = 1. 2, R = 1. 3
The vol ume of v i s 9. 202764
The sur f ace ar ea of v i s 21. 237148
Spher e ( 1, 1. 1, 1. 2, 1. 3) dest r oyed
Spher e ( 1, 1. 1, 1. 2, 1) dest r oyed
Spher e ( 1, 1. 1, 2. 5, 1) dest r oyed
Spher e ( 1, 2, 2. 5, 1) dest r oyed
Notice that when you use a default value, you must also use
the other default values to its right. Similarly, once you
define a functions parameter as having a default value,
every parameter to its right must have a default value as well.
673
EXAMPLE
C+ + By
2. You also can call more than one constructor; this is called
overloading the constructor. When having more than one
constructor, all with the same name of the class, you must
give them each a different parameter list so the compiler can
determine which one you intend to use. A common use of
overloaded constructors is to create an uninitialized object
on the receiving end of an assignment, as you see done here:
/ / C32OVCON. CPP
/ / Demonst r at es use of over l oaded const r uct or s.
#i ncl ude <i ost r eam. h>
#i ncl ude <mat h. h>
const f l oat PI = 3. 14159; / / Appr oxi mat e val ue of pi .
/ / A spher e cl ass.
cl ass Spher e
{
publ i c:
f l oat r ; / / Radi us of spher e
f l oat x, y, z; / / Coor di nat es of spher e
Spher e( ) { / * doesn t do anyt hi ng. . . */ }
Spher e( f l oat xcoor d, f l oat ycoor d,
f l oat zcoor d, f l oat r adi us)
{ x = xcoor d; y = ycoor d; z = zcoor d; r = r adi us; }
~Spher e( )
{
cout << Spher e ( << x << , << y
<< , << z << , << r << ) dest r oyed\ n;
}
i nl i ne f l oat vol ume( )
{
r et ur n ( r * r * r * 4 * PI / 3) ;
}
f l oat sur f ace_ar ea( )
{
r et ur n ( r * r * 4 * PI ) ;
}
};
voi d mai n( )
{
Spher e s( 1. 0, 2. 0, 3. 0, 4. 0) ;
Chapter 32 o Introduction to O bject-O riented Program m ing
674
Spher e t ; / / No par amet er s ( an uni ni t i al i zed spher e) .
cout << X = << s. x << , Y = << s. y
<< , Z = << s. z << , R = << s. r << \ n;
t = s;
cout << The vol ume of t i s << t . vol ume( ) << \ n;
cout << The sur f ace ar ea of t i s << t . sur f ace_ar ea( )
<< \ n;
r et ur n;
}
Class Member Visibility
Recall that the Spher e( ) class had the label publ i c. Declaring the
publ i c label is necessary because, by default, all members of a class
are pr i vat e. Private members cannot be accessed by anything but a
member function. In order for data or member functions to be used
by other programs, they must be explicitly declared publ i c. In the
case of the Spher e( ) class, you probably want to hide the actual data
from other classes. This protects the datas integrity. The next
program adds a cube( ) and squar e( ) function to do some of the work
of the vol ume( ) and sur f ace_ar ea( ) functions. There is no need for
other functions to use those member functions.
/ / Fi l ename: C32VI SI B. CPP
/ / Demonst r at es use of cl ass vi si bi l i t y l abel s.
#i ncl ude <i ost r eam. h>
#i ncl ude <mat h. h>
const f l oat PI = 3. 14159; / / Appr oxi mat e val ue of pi .
/ / A spher e cl ass.
cl ass Spher e
{
pr i vat e:
f l oat r ; / / Radi us of spher e
f l oat x, y, z; / / Coor di nat es of spher e
f l oat cube( ) { r et ur n ( r * r * r ) ; }
f l oat squar e( ) { r et ur n ( r * r ) ; }
675
EXAMPLE
C+ + By
publ i c:
Spher e( f l oat xcoor d, f l oat ycoor d, f l oat zcoor d, f l oat r adi us)
{ x = xcoor d; y = ycoor d; z = zcoor d; r = r adi us; }
~Spher e( )
{
cout << Spher e ( << x << , << y
<< , << z << , << r << ) dest r oyed\ n;
}
f l oat vol ume( )
{
r et ur n ( cube( ) * 4 * PI / 3) ;
}
f l oat sur f ace_ar ea( )
{
r et ur n ( squar e( ) * 4 * PI ) ;
}
};
voi d mai n( )
{
Spher e s( 1. 0, 2. 0, 3. 0, 4. 0) ;
cout << The vol ume i s << s. vol ume( ) << \ n;
cout << The sur f ace ar ea i s << s. sur f ace_ar ea( ) << \ n;
r et ur n;
}
Notice that the line showing the data members had to be
removed from mai n( ) . The data members are no longer directly
accessible except by a member function of class Spher e. In other
words, mai n( ) can never directly manipulate data members such as
r and z, even though it calls the constructor function that created
them. The private member data is only visible in the member
functions. This is the true power of data hiding; even your own code
cannot get to the data! The advantage is that you define specific data-
retrieval, data-display, and data-changing member functions that
mai n( ) must call to manipulate member data. Through these member
functions, you set up a buffer between your program and the
programs data structures. If you change the way the data is stored,
you do not have to change mai n( ) or any functions that mai n( ) calls.
You only have to change the member functions of that class.
Chapter 32 o Introduction to O bject-O riented Program m ing
676
Review Questions
The answers to the review questions are in Appendix B.
1. What are the two types of class members called?
2. Is a constructor always necessary?
3. Is a destructor always necessary?
4. What is the default visibility of a class data member?
5. How do you make a class member visible outside its class?
Review Exerc ise
Construct a class to hold personnel records. Use the following
data members, and keep them private:
char name[ 25] ;
f l oat sal ar y;
char dat e_of _bi r t h[ 9] ;
Create two constructors, one to initialize the record with its
necessary values and another to create an uninitialized record.
Create member functions to alter the individuals name, salary, and
date of birth.
Summary
You have now been introduced to classes, the data type that
distinguishes C++ from its predecessor, C. This was only a cursory
glimpse of object-oriented programming. However, you saw that
OOP offers an advanced view of your data, combining the data with
the member functions that manipulate that data. If you desire to
learn more about C++ and become a guru of sorts, try Using
Microsoft C/C++ 7 (Que, 0-88022-809-1).
Part VIII
References
679
EXAMPLE
C+ + By
A
Memory
Addressing,
Binary, and
Hexadec imal
Review
You do not have to understand the concepts in this appendix to
become well-versed in C++. You can master C++, however, only if
you spend some time learning about the behind-the-scenes roles
played by binary numbers. The material presented here is not
difficult, but many programmers do not take the time to study it;
hence, there are a handful of C++ masters who learn this material
and understand how C++ works under the hood, and there are
those who will never master the language as they could.
You should take the time to learn about addressing, binary
numbers, and hexadecimal numbers. These fundamental principles
are presented here for you to learn, and although a working knowl-
edge of C++ is possible without knowing them, they greatly enhance
your C++ skills (and your skills in every other programming lan-
guage).
Appendix A o M em ory Addressing, Binary, and H exadecim al Review
680
After reading this appendix, you will better understand why
different C++ data types hold different ranges of numbers. You also
will see the importance of being able to represent hexadecimal
numbers in C++, and you will better understand C++ array and
pointer addressing.
Computer Memory
Each memory location inside your computer holds a single
character called a byte. A byte is any character, whether it is a letter
of the alphabet, a numeric digit, or a special character such as a
period, question mark, or even a space (a blank character). If your
computer contains 640K of memory, it can hold a total of approxi-
mately 640,000 bytes of memory. This means that as soon as you fill
your computers memory with 640K, there is no room for an addi-
tional character unless you overwrite something.
Before describing the physical layout of your computers
memory, it is best to take a detour and explain exactly what 640K
means.
Memory and Disk Measurements
By appending the K (from the metric word kilo) to memory
measurements, the manufacturers of computers do not have to
attach as many zeros to the end of numbers for disk and memory
storage. The K stands for approximately 1000 bytes. As you will see,
almost everything inside your computer is based on a power of 2.
Therefore, the K of computer memory measurements actually equals
the power of 2 closest to 1000, which is 2 to the 10th power, or 1024.
Because 1024 is very close to 1000, computer-users often think of K
as meaning 1000, even though they know it only approximately
equals 1000.
Think for a moment about what 640K exactly equals. Practi-
cally speaking, 640K is about 640,000 bytes. To be exact, however,
640K equals 640 times 1024, or 655,360. This explains why the PC
DOS command CHKDSK returns 655,360 as your total memory
(assuming that you have 640K of RAM) rather than 640,000.
K means approxi -
matel y 1000 bytes
and exactl y 1024
bytes.
681
EXAMPLE
C+ + By
Because extended memory and many disk drives can hold such
a large amount of data, typically several million characters, there is
an additional memory measurement shortcut called M, which stands
for meg, or megabytes. The M is a shortcut for approximately one
million bytes. Therefore, 20M is approximately 20,000,000 charac-
ters, or bytes, of storage. As with K, the M literally stands for
1,048,576 because that is the closest power of 2 (2 to the 20th power)
to one million.
How many bytes of storage is 60 megabytes? It is approxi-
mately 60 million characters, or 62,914,560 characters to be exact.
Memory Addresses
Each memory location in your computer, just as with each
house in your town, has a unique address. A memory address is
simply a sequential number, starting at 0, that labels each memory
location. Figure A.1 shows how your computer memory addresses
are numbered if you have 640K of RAM.
M means
approxi matel y
1,000,000 bytes
and exactl y
1,048,576 bytes.
Figure A.1. Memory addresses for a 640K computer.
By using unique addresses, your computer can track memory.
When the computer stores a result of a calculation in memory, it
finds an empty address, or one matching the data area where the
result is to go, and stores the result at that address.
Appendix A o M em ory Addressing, Binary, and H exadecim al Review
682
Your C++ programs and data share computer memory with
DOS. DOS must always reside in memory while you operate your
computer. Otherwise, your programs would have no way to access
disks, printers, the screen, or the keyboard. Figure A.2 shows
computer memory being shared by DOS and a C++ program. The
exact amount of memory taken by DOS and a C++ program is
determined by the version of DOS you use, how many DOS extras
(such as device drivers and buffers) your computer uses, and the
size and needs of your C++ programs and data.
Figure A.2. DOS, your C++ program, and your programs data share the
same memory.
Bits and Bytes
You now know that a single address of memory might contain
any character, called a byte. You know that your computer holds
many bytes of information, but it does not store those characters in
the same way that humans think of characters. For example, if you
type a letter W on your keyboard while working in your C++ editor,
you see the W on-screen, and you also know that the W is stored in
a memory location at some unique address. Actually, your com-
puter does not store the letter W; it stores electrical impulses that
stand for the letter W.
683
EXAMPLE
C+ + By
Electricity, which runs through the components of your com-
puter and makes it understand and execute your programs, can exist
in only two stateson or off. As with a light bulb, electricity is either
flowing (it is on) or it is not flowing (it is off). Even though you can
dim some lights, the electricity is still either on or off.
Todays modern digital computers employ this on-or-off con-
cept. Your computer is nothing more than millions of on and off
switches. You might have heard about integrated circuits, transis-
tors, and even vacuum tubes that computers have contained over
the years. These electrical components are nothing more than switches
that rapidly turn electrical impulses on and off.
This two-state on and off mode of electricity is called a binary
state of electricity. Computer people use a 1 to represent an on state
(a switch in the computer that is on) and a 0 to represent an off state
(a switch that is off). These numbers, 1 and 0, are called binary digits.
The term binary digits is usually shortened to bits. A bit is either a 1
or a 0 representing an on or an off state of electricity. Different
combinations of bits represent different characters.
Several years ago, someone listed every single character that
might be represented on a computer, including all uppercase letters,
all lowercase letters, the digits 0 through 9, the many other charac-
ters (such as %, *, {, and +), and some special control characters.
When you add the total number of characters that a PC can repre-
sent, you get 256 of them. The 256 ASCII characters are listed in
Appendix Cs ASCII (pronounced ask-ee) table.
The order of the ASCII tables 256 characters is basically arbi-
trary, just as the telegraphs Morse code table is arbitrary. With
Morse code, a different set of long and short beeps represent
different letters of the alphabet. In the ASCII table, a different
combination of bits (1s and 0s strung together) represent each of the
256 ASCII characters. The ASCII table is a standard table used by
almost every PC in the world. ASCII stands for American Standard
Code for Information Interchange. (Some minicomputers and main-
frames use a similar table called the EBCDIC table.)
It turns out that if you take every different combination of eight
0s strung together, to eight 1s strung together (that is, from 00000000,
00000001, 00000010, and so on until you get to 11111110, and finally,
11111111), you have a total of 256 of them. (256 is 2 to the 8th power.)
The bi nary di gi ts 1
and 0 (cal l ed bi ts)
represent on and off
states of el ectri ci ty.
Appendix A o M em ory Addressing, Binary, and H exadecim al Review
684
Each memory location in your computer holds eight bits each. These
bits can be any combination of eight 1s and 0s. This brings us to the
following fundamental rule of computers.
NOTE: Because it takes a combination of eight 1s and 0s to
represent a character, and because each byte of computer
memory can hold exactly one character, eight bits equals one
byte.
To bring this into better perspective, consider that the bit
pattern needed for the uppercase letter A is 01000001. No other
character in the ASCII table looks like this to the computer because
each of the 256 characters is assigned a unique bit pattern.
Suppose that you press the A key on your keyboard. Your
keyboard does not send a letter A to the computer; rather, it looks in
its ASCII table for the on and off states of electricity that represent
the letter A. As Figure A.3 shows, when you press the A key, the
keyboard actually sends 01000001 (as on and off impulses) to the
computer. Your computer simply stores this bit pattern for A in a
memory location. Even though you can think of the memory loca-
tion as holding an A, it really holds the byte 01000001.
Figure A.3. Your computer keeps track of characters by their bit
patterns.
Your Keyboard
Computer
Printer
685
EXAMPLE
C+ + By
If you were to print that A, your computer would not send an
A to the printer; it would send the 01000001 bit pattern for an A to the
printer. The printer receives that bit pattern, looks up the correct
letter in the ASCII table, and prints an A.
From the time you press the A until the time you see it on the
printer, it is not a letter A! It is the ASCII pattern of bits that the
computer uses to represent an A. Because a computer is electrical,
and because electricity is easily turned on and off, this is a nice way
for the computer to manipulate and move characters, and it can do
so very quickly. Actually, if it were up to the computer, you would
enter everything by its bit pattern, and look at all results in their bit
patterns. Of course, it would be much more difficult for us to learn
to program and use a computer, so devices such as the keyboard,
screen, and printer are created to work part of the time with letters
as we know them. That is why the ASCII table is such an integral
part of a computer.
There are times when your computer treats two bytes as a
single value. Even though memory locations are typically eight bits
wide, many CPUs access memory two bytes at a time. If this is the
case, the two bytes are called a word of memory. On other computers
(commonly mainframes), the word size might be four bytes (32 bits)
or even eight bytes (64 bits).
Summarizing Bits and Bytes
A bit is a 1 or a 0 representing an on or an off state of electricity.
Eight bits represents a byte.
A byte, or eight bits, represents one character.
Each memory location of your computer is eight bits (a single
byte) wide. Therefore, each memory location can hold one
character of data. Appendix C is an ASCII table listing all
possible characters.
If the CPU accesses memory two bytes at a time, those two bytes
are called a word of memory.
Appendix A o M em ory Addressing, Binary, and H exadecim al Review
686
The Order of Bits
To further understand memory, you should understand how
programmers refer to individual bits. Figure A.4 shows a byte and
a two-byte word. Notice that the bit on the far right is called bit 0.
From bit 0, keep counting by ones as you move left. For a byte, the
bits are numbered 0 to 7, from right to left. For a double-byte (a 16-
bit word), the bits are numbered from 0 to 15, from right to left.
Figure A.4. The order of bits in a byte and a two-byte word.
Bit 0 is called the least-significant bit, or sometimes the low-order
bit. Bit 7 (or bit 15 for a two-byte word) is called the most-significant
bit, or sometimes the high-order bit.
Binary Numbers
Because a computer works best with 1s and 0s, its internal
numbering method is limited to a base-2 (binary) numbering system.
People work in a base-10 numbering system in the real world. The
base-10 numbering system is sometimes called the decimal number-
ing system. There are always as many different digits as the base in
a numbering system. For example, in the base-10 system, there are
ten digits, 0 through 9. As soon as you count to 9 and run out of digits,
you have to combine some that you already used. The number 10 is
a representation of ten values, but it combines the digits 1 and 0.
687
EXAMPLE
C+ + By
The same is true of base-2. There are only two digits, 0 and 1.
As soon as you run out of digits, after the second one, you have to
reuse digits. The first seven binary numbers are 0, 1, 10, 11, 100, 101,
and 110.
It is okay if you do not understand how these numbers were
derived; you will see how in a moment. For the time being, you
should realize that no more than two digits, 0 and 1, can be used to
represent any base-2 number, just as no more than ten digits, 0
through 9, can be used to represent any base-10 number in the
regular numbering system.
You should know that a base-10 number, such as 2981, does not
really mean anything by itself. You must assume what base it is. You
get very used to working with base-10 numbers because you use
them every day. However, the number 2981 actually represents a
quantity based on powers of 10. For example, Figure A.5 shows what
the number 2981 actually represents. Notice that each digit in the
number represents a certain number of a power of 10.
Figure A.5. The base-10 breakdown of the number 2981.
This same concept applies when you work in a base-2 number-
ing system. Your computer does this because the power of 2 is just
as common to your computer as the power of 10 is to you. The only
difference is that the digits in a base-2 number represent powers of
2 and not powers of 10. Figure A.6 shows you what the binary
numbers 10101 and 10011110 are in base-10. This is how you convert
any binary number to its base-10 equivalent.
A bi nary number
can contai n onl y the
di gi ts 1 and 0.
Appendix A o M em ory Addressing, Binary, and H exadecim al Review
688
Figure A.6. The base-2 breakdown of the numbers 10101 and
10011110.
A base-2 number contains only 1s and 0s. To convert any base-
2 number to base-10, add each power of 2 everywhere a 1 appears in
the number. The base-2 number 101 represents the base-10 number
5. (There are two 1s in the number, one in the 2 to the 0 power, which
equals 1, and one in the 2 to the second power, which equals 4.) Table
A.1 shows the first 18 base-10 numbers and their matching base-2
numbers.
689
EXAMPLE
C+ + By
Table A.1. The first 17 base-10 and base-2 (binary)
numbers.
Base-10 Base-2
0 0
1 1
2 10
3 11
4 100
5 101
6 110
7 111
8 1000
9 1001
10 1010
11 1011
12 1100
13 1101
14 1110
15 1111
16 10000
17 10001
You do not have to memorize this table; you should be able to
figure the base-10 numbers from their matching binary numbers by
adding the powers of two for each 1 (on) bit. Many programmers do
memorize the first several binary numbers because it comes in
handy in advanced programming techniques.
What is the largest binary number a byte can hold? The answer
is all 1s, or 11111111. If you add the first eight powers of 2, you
get 255.
Appendix A o M em ory Addressing, Binary, and H exadecim al Review
690
A byte holds either a number or an ASCII character, depending
on how it is accessed. For example, if you were to convert the base-
2 number 01000001 to a base-10 number, you would get 65. How-
ever, this also happens to be the ASCII bit pattern for the uppercase
letter A. If you check the ASCII table, you see that the A is ASCII code
65. Because the ASCII table is so closely linked with the bit patterns,
the computer knows whether to work with a number 65 or a letter
Aby the context of how the patterns are used.
A binary number is not limited to a byte, as an ASCII character
is. Sixteen or 32 bits at a time can represent a binary number (and
usually do). There are more powers of 2 to add when converting that
number to a base-10 number, but the process is the same. By now you
should be able to figure out that 1010101010101010 is 43,690 in base-
10 decimal numbering system (although it might take a little time to
calculate).
To convert from decimal to binary takes a little more effort.
Luckily, you rarely need to convert in that direction. Converting
from base-10 to base-2 is not covered in this appendix.
Binary Arithmetic
At their lowest level, computers can only add and convert
binary numbers to their negative equivalents. Computers cannot
truly subtract, multiply, or divide, although they simulate these
operations through judicious use of the addition and negative-
conversion techniques.
If a computer were to add the numbers 7 and 6, it could do so
(at the binary level). The result is 13. If, however, the computer were
instructed to subtract 7 from 13, it could not do so. It can, however,
take the negative value of 7 and add that to 13. Because 7 plus 13
equals 6, the result is a simulated subtraction.
To multiply, computers perform repeated addition. To multi-
ply 6 by 7, the computer adds seven 6s together and gets 42 as the
answer. To divide 42 by 7, a computer keeps subtracting 7 from 42
repeatedly until it gets to a 0 answer (or less than 0 if there is a
remainder), then counts the number of times it took to reach 0.
691
EXAMPLE
C+ + By
Because all math is done at the binary level, the following
additions are possible in binary arithmetic:
0 + 0 = 0
0 + 1 = 1
1 + 0 = 1
1 + 1 = 10
Because these are binary numbers, the last result is not the
number 10, but the binary number 2. (Just as the binary 10 means no
ones, and carry an additional power of 2, the decimal number 10
means no ones, and carry a power of 10.) No binary digit repre-
sents a 2, so you have to combine the 1 and the 0 to form the new
number.
Because binary addition is the foundation of all other math, you
should learn how to add binary numbers. You will then understand
how computers do the rest of their arithmetic.
Using the binary addition rules shown previously, look at the
following binary calculations:
01000001 (65 decimal)
+00101100 (44 decimal)
01101101 (109 decimal)
The first number, 01000001, is 65 decimal. This also happens to
be the bit pattern for the ASCII A, but if you add with it, the computer
interprets it as the number 65 rather than the character A.
The following binary addition requires a carry into bit 4 and
bit 6:
00101011 (43 decimal)
+00100111 (39 decimal)
01010010 (82 decimal)
Typically, you have to ignore bits that carry past bit 7, or bit 15
for double-byte arithmetic. For example, both of the following
Appendix A o M em ory Addressing, Binary, and H exadecim al Review
692
binary additions produce incorrect positive results:
10000000 (128 decimal) 1000000000000000
(65536 decimal)
+10000000 (128 decimal) +1000000000000000
00000000 (0 decimal) (65536 decimal)
0000000000000000
(0 decimal)
There is no 9th or 17th bit for the carry, so both of these seem to
produce incorrect results. Because the byte and 16-bit word cannot
hold the answers, the magnitude of both these additions is not
possible. The computer must be programmed, at the bit level, to
perform multiword arithmetic, which is beyond the scope of this book.
Binary Negative Numbers
Because subtracting requires understanding binary negative
numbers, you need to learn how computers represent them. The
computer uses 2s complement to represent negative numbers in
binary form. To convert a binary number to its 2s complement (to
its negative) you must:
1. Reverse the bits (the 1s to 0s and the 0s to 1s).
2. Add 1.
This might seem a little strange at first, but it works very well
for binary numbers. To represent a binary 65, you have to take the
binary 65 and convert it to its 2s complement, such as
01000001 (65 decimal)
10111110 (Reverse the bits)
+1 (Add 1)
10111111 (65 binary)
Negati ve bi nary
numbers are stored
i n thei r 2s
compl ement format.
693
EXAMPLE
C+ + By
By converting the 65 to its 2s complement, you produce 65 in
binary. You might wonder what makes 10111111 mean 65, but by
the 2s complement definition it means 65.
If you were told that 10111111 is a negative number, how
would you know which binary number it is? You perform the 2s
complement on it. Whatever number you produce is the positive of
that negative number. For example:
10111111 (65 decimal)
01000000 (Reverse the bits)
+1 (Add 1)
01000001 (65 decimal)
Something might seem wrong at this point. You just saw that
10111111 is the binary 65, but isnt 10111111 also 191 decimal
(adding the powers of 2 marked by the 1s in the number, as
explained earlier)? It depends whether the number is a signed or an
unsigned number. If a number is signed, the computer looks at the
most-significant bit (the bit on the far left), called the sign bit. If the
most-significant bit is a 1, the number is negative. If it is 0, the
number is positive.
Most numbers are 16 bits long. That is, two-byte words are used
to store most integers. This is not always the case for all computers,
but it is true for most PCs.
In the C++ programming language, you can designate num-
bers as either signed integers or unsigned integers (they are signed
by default if you do not specify otherwise). If you designate a
variable as a signed integer, the computer interprets the high-order
bit as a sign bit. If the high-order bit is on (1), the number is negative.
If the high-order bit is off (0), the number is positive. If, however, you
designate a variable as an unsigned integer, the computer uses the
high-order bit as just another power of 2. That is why the range of
unsigned integer variables goes higher (generally from 0 to 65535,
but it depends on the computer) than for signed integer variables
(generally from 32768 to +32767).
After so much description, a little review is in order. Assume
that the following 16-bit binary numbers are unsigned:
Appendix A o M em ory Addressing, Binary, and H exadecim al Review
694
0011010110100101
1001100110101010
1000000000000000
These numbers are unsigned, so the bit 15 is not the sign bit, but
simply another power of 2. You should practice converting these
large 16-bit numbers to decimal. The decimal equivalents are
13733
39338
32768
If, on the other hand, these numbers are signed numbers, the
high-order bit (bit 15) indicates the sign. If the sign bit is 0, the
numbers are positive and you convert them to decimal in the usual
manner. If the sign bit is 1, you must convert the numbers to their 2s
complement to find what they equal. Their decimal equivalents are
+13733
26198
32768
To compute the last two binary numbers to their decimal
equivalents, take their 2s complement and convert it to decimal. Put
a minus sign in front of the result and you find what the original
number represents.
TIP: To make sure that you convert a number to its 2s com-
plement correctly, you can add the 2s complement to its
original positive value. If the answer is 0 (ignoring the extra
carry to the left), you know that the 2s complement number is
correct. This is similar to the concept that decimal opposites,
such as 72 + 72, add up to zero.
695
EXAMPLE
C+ + By
Hexadec imal Numbers
All those 1s and 0s get confusing. If it were up to your com-
puter, however, you would enter everything as 1s and 0s! This is
unacceptable to people because we do not like to keep track of all
those 1s and 0s. Therefore, a hexadecimal numbering system (some-
times called hex) was devised. The hexadecimal numbering system
is based on base-16 numbers. As with other bases, there are 16
unique digits in the base-16 numbering system. Here are the first 19
hexadecimal numbers:
0 1 2 3 4 5 6 7 8 9 A B C D E F 10 11 12
Because there are only 10 unique digits (0 through 9), the letters
A through F represent the remaining six digits. (Anything could
have been used, but the designers of the hexadecimal numbering
system decided to use the first six letters of the alphabet.)
To understand base-16 numbers, you should know how to
convert them to base-10 so they represent numbers with which
people are familiar. Perform the conversion to base-10 from base-16
the same way you did with base-2, but instead of using powers of 2,
represent each hexadecimal digit with powers of 16. Figure A.7
shows how to convert the number 3C5 to decimal.
Hexadeci mal
numbers use 16
uni que di gi ts, 0
through F.
Figure A.7. Converting hexadecimal 3C5 to its decimal equivalent.
TIP: There are calculators available that convert numbers
between base-16, base-10, and base-2, and also perform 2s
complement arithmetic.
Appendix A o M em ory Addressing, Binary, and H exadecim al Review
696
You should be able to convert 2B to its decimal 43 equivalent,
and E1 to decimal 225 in the same manner. Table A.2 shows the first
20 decimal, binary, and hexadecimal numbers.
Table A.2. The first 20 base-10, base-2 (binary),
and base-16 (hexadec imal) numbers.
Base-10 Base-2 Base-16
1 1 1
2 10 2
3 11 3
4 100 4
5 101 5
6 110 6
7 111 7
8 1000 8
9 1001 9
10 1010 A
11 1011 B
12 1100 C
13 1101 D
14 1110 E
15 1111 F
16 10000 10
17 10001 11
18 10010 12
19 10011 13
20 10100 14
697
EXAMPLE
C+ + By
Why Learn Hexadec imal?
Because of its close association to the binary numbers your
computer uses, hexadecimal notation is extremely efficient for de-
scribing memory locations and values. It is much easier for you (and
more importantly at this level, for your computer) to convert from
base-16 to base-2 than from base-10 to base-2. Therefore, you some-
times want to represent data at the bit level, but using hexadecimal
notation is easier (and requires less typing) than using binary
numbers.
To convert from hexadecimal to binary, convert each hex digit
to its four-bit binary number. You can use Table A.2 as a guide for
this. For example, the following hexadecimal number
5B75
can be converted to binary by taking each digit and converting it to
four binary numbers. If you need leading zeroes to pad the four
digits, use them. The number becomes
0101 1011 0111 0101
It turns out that the binary number 0101101101110101 is exactly
equal to the hexadecimal number 5B75. This is much easier than
converting them both to decimal first.
To convert from binary to hexadecimal, reverse this process. If
you were given the following binary number
1101000011110111111010
you could convert it to hexadecimal by grouping the bits into groups
of four, starting with the bit on the far right. Because there is not an
even number of groups of four, pad the one on the far left with
zeroes. You then have the following:
0011 0100 0011 1101 1111 1010
Now you only have to convert each group of four binary digits
into their hexadecimal number equivalent. You can use Table A.2 to
help. You then get the following base-16 number:
343DFA
Appendix A o M em ory Addressing, Binary, and H exadecim al Review
698
The C++ programming language also supports the base-8 octal
representation of numbers. Because octal numbers are rarely used
with todays computers, they are not covered in this appendix.
How Binary and Addressing
Relate to C++
The material presented here may seem foreign to many pro-
grammers. The binary and 2s complement arithmetic reside deep in
your computer, shielded from most programmers (except assem-
bly-language programmers). Understanding this level of your com-
puter, however, makes everything else you learn seem more clear.
Many C++ programmers learn C++ before delving into binary
and hexadecimal representation. For those programmers, much
about the C++ language seems strange, but it could be explained
very easily if they understood the basic concepts.
For example, a signed integer holds a different range of num-
bers than an unsigned integer. You now know that this is because
the sign bit is used in two different ways, depending on whether
the number is designated as signed or unsigned.
The ASCII table (see Appendix C) also should make more sense
to you after this discussion. The ASCII table is an integral part of
your computer. Characters are not actually stored in memory and
variables; rather, their ASCII bit patterns are. That is why C++ can
move easily between characters and integers. The following two
C++ statements are allowed, whereas they probably would not be in
another programming language:
char c = 65; / / Pl aces t he ASCI I l et t er A i n c.
i nt ci = A ; / / Pl aces t he number 65 i n ci .
The hexadecimal notation also makes much more sense if you
truly understand base-16 numbers. For example, if you see the
following line in a C++ program
char a = \ x041 ;
699
EXAMPLE
C+ + By
you could convert the hex 41 to decimal (65 decimal) if you want to
know what is being assigned. Also, C++ systems programmers find
that they can better interface with assembly-language programs
when they understand the concepts presented in this appendix.
If you gain only a cursory knowledge of this material at this
point, you will be very much ahead of the game when you program
in C++!
Appendix A o M em ory Addressing, Binary, and H exadecim al Review
700
701
EXAMPLE
C+ + By
B
Answers to
Review Questions
Chapter 1
1. BCPL or Algol
2. True
3. 1980s
4. False. C++s compact size makes it an excellent program-
ming language for smaller computers.
5. The hard disk
6. A modem
7. b. Input. By moving the mouse, you give cursor-direction
commands to the computer.
8. NumLock
9. UNIX
Appendix B o Answ ers to Review Q uestions
702
10. When you turn off the computer, the contents of RAM are
destroyed.
11. True
12. 524,288 bytes (512 times 1,024)
13. Modulate, demodulate
Chapter 2
1. A set of detailed instructions that tells the computer what
to do.
2. Buy one or write it yourself.
3. False
4. The program produces the output.
5. A program editor
6. The .CPP extension
7. You must first plan the program by deciding which steps
you will take to produce the final program.
8. To get the errors out of your program
9. So your programs work with various compilers and com-
puter equipment
10. False. You must compile a program before linking it. Most
compilers link the program automatically.
Chapter 3
1. Two comment markers (/ / )
2. A holding place for data that can be changed
3. A value that cannot be changed
4. The +, - , *, and / operators
703
EXAMPLE
C+ + By
5. The =assignment operator.
6. False. There are floating-point, double floating-point, short
integers, long integers, and many more variable data types.
7. cout
8. ci t y must be a variable name because it is not enclosed in
quotation marks.
9. All C++ commands must be in lowercase.
Chapter 4
1. my_name and sal es_89
2. Characters: X and 0
Strings: 2. 0 and X
Integers: 0 and - 708
Floating-point literals: - 12. 0 and 65. 4
3. Seven variables are declared: three integers, three characters,
and one floating-point variable.
4. A null zero, also called a binary zero or an ASCII zero.
5. True
6. 1
7. It is stored as a series of ASCII values, representing the
characters and blanks in the string, ending in an ASCII 0.
8. It is stored as a single ASCII 0.
9. The constant value called age cannot be changed.
Chapter 5
1. char my_name[ ] Thi s i s C++;
2. The string is 11 characters long.
Appendix B o Answ ers to Review Q uestions
704
3. It consumes 12 bytes.
4. All string literals end with a binary zero.
5. Two character arrays are declared, each with 25 elements.
6. False. The keyword char must precede the variable name.
7. True. The binary zero terminates the string.
8. False. The characters do not represent a string because there
is no terminating zero.
Chapter 6
1. False. You can define only constants with the #def i ne prepro-
cessor directive.
2. The #i ncl ude directive
3. The #def i ne directive
4. True
5. The preprocessor changes your source code before the
compiler reads the source code.
6. The const keyword
7. Use angled brackets when the i ncl ude files reside in the
compilers i ncl ude subdirectory. Use quotation marks when
the i ncl ude file resides in the same subdirectory as the source
program.
8. Defined literals are easier to change because you have to
change only the line with #def i ne and not several other lines
in the program.
9. iostream.h
10. False. You cannot define constants enclosed in quotation
marks (as MESSAGE is in the cout statement).
11. Amount i s 4
705
EXAMPLE
C+ + By
Chapter 7
1. cout sends output to the screen, and ci n gets input from the
keyboard.
2. The prompt tells the user what is expected.
3. The user enters four values.
4. ci n assigns values to variables when the user types them,
whereas the programmer must assign data when using the
assignment operator (=).
5. True. When printing strings, you do not need %s.
6. Arrays
7. The backsl ash \ char act er i s speci al
8. The following value prints, with one leading space: 123. 456
Chapter 8
1. a. 5
b. 6
c. 5
2. a. 2
b. 7
3. a. a = ( 3+3) / ( 4+4) ;
b. x = ( a- b) *( ( a- c) * ( a- c) ) ;
c. f = ( a*a) / ( b*b*b) ;
d. d = ( ( 8 - x*x) / ( x - 9) ) - ( ( 4*2 - 1) / ( x*x*x) ) ;
4. The area of a circle:
#i ncl ude st di o. h>
const f l oat PI = 3. 14159;
mai n( )
Appendix B o Answ ers to Review Q uestions
706
{
pr i nt f ( %f , ( PI *( 4*4) ) ;
r et ur n;
}
5. Assignment and pr i nt f ( ) statements:
r = 100%4;
cout << r ;
Chapter 9
1. The ==operator
2. a. True
b. True
c. True
d. True
3. True
4. The i f statement determines what code executes when the
relational test is true. The i f - el se statement determines what
happens for both the True and the False relational test.
5. No
6. a. False
b. False
c. False
Chapter 10
1. The &&, | | , and ! operators are the three logical operators.
2. a. False
b. False
707
EXAMPLE
C+ + By
c. True
d. True
3. a. True
b. True
c. True
4. g i s 25 and f got changed t o 8
5. a. True
b. True
c. False
d. True
6. Yes
Chapter 11
1. The i f - el se statement
2. The conditional operator is the only C++ operator with three
arguments.
3. i f ( a == b)
{ ans = c + 2; }
el se
{ ans = c + 3; }
4. True
5. The increment and decrement operators compile into single
assembly instructions.
6. A comma operator (, ), which forces a left-to-right execution
of the statements on either side
7. The output cannot be determined reliably. Do not pass an
increment operator as an argument.
Appendix B o Answ ers to Review Q uestions
708
8. The si ze of name i s 20
9. a. True
b. True
c. False
d. False
Chapter 12
1. The whi l e loop tests for a true condition at the beginning of
the loop. The do- whi l e tests for the condition at the end of the
loop.
2. A counter variable increments by one. A total variable
increments by the addition to the total you are performing.
3. The ++operator
4. If the body of the loop is a single statement, the braces are
not required. However, braces are always recommended.
5. There are no braces. The second cout always executes, re-
gardless of the result of the whi l e loops relational test.
6. The stdlib.h header file
7. One time
8. By returning a value inside the exi t ( ) functions parentheses
9. Thi s i s t he out er l oop
Thi s i s t he out er l oop
Thi s i s t he out er l oop
Thi s i s t he out er l oop
709
EXAMPLE
C+ + By
Chapter 13
1. A loop is a sequence of one or more instructions executed
repeatedly.
2. False
3. A nested loop is a loop within a loop.
4. Because the expressions might be initialized elsewhere, such
as before the loop or in the body of the loop
5. The inner loop
6. 10
7
4
1
7. True
8. The body of the f or loop stops repeating.
9. False, due to the semicolon after the first f or loop
10. There is no output. The value of st ar t is already less than end
when the loop begins; therefore, the f or loops test is imme-
diately False.
Chapter 14
1. Timing loops force a program to pause.
2. Because some computers are faster than others.
3. If the cont i nue and br eak statements were unconditional,
there would be little use for them.
4. Because of the unconditional cont i nue statement, there is no
output.
5. *****
Appendix B o Answ ers to Review Q uestions
710
6. A single variable rarely can hold a large enough value for
the timers count.
Chapter 15
1. The program does not execute sequentially, as it would
without got o.
2. The swi t ch statement
3. A br eak statement
4. False because you should place the case most likely to
execute at the beginning of the case options.
5. swi t ch ( num)
{ case ( 1) : { cout << Al pha;
br eak; }
case ( 2) : { cout << Bet a;
br eak; }
case ( 3) : { cout << Gamma;
br eak; }
def aul t : { cout << Ot her ;
br eak; }
}
6. do
{ cout << What i s your f i r st name? ;
ci n >> name;
} whi l e ( ( name[ 0] < A ) | | ( name[ 0] > Z ) ) ;
Chapter 16
1. True
2. mai n( )
711
EXAMPLE
C+ + By
3. Several smaller functions are better because each function
can perform a single task.
4. Function names always end with a pair of parentheses.
5. By putting separating comments between functions.
6. The function sq_25( ) cannot be nested in cal c_i t ( ) .
7. A function definition (a prototype).
8. True
Chapter 17
1. True
2. Local variables are passed as arguments.
3. False
4. The variable data types
5. Static
6. You should never pass global variablesthey do not need to
be passed.
7. Two arguments (the string The r ai n has f al l en %d i nches,
and the variable, r ai nf )
Chapter 18
1. Arrays
2. Nonarray variables are always passed by value, unless you
override the default with & before each variable name.
3. True
4. No
5. Yes
Appendix B o Answ ers to Review Q uestions
712
6. The data types of variables x, y, and z are not declared in the
receiving parameter list.
7. c
Chapter 19
1. By putting the return type to the left of the function name.
2. One
3. To prototype built-in functions.
4. i nt
5. False
6. Prototypes ensure that the correct number of parameters is
being passed.
7. Global variables are already known across functions.
8. The return type is f l oat . Three parameters are passed: a
character, an integer, and a floating-point variable.
Chapter 20
1. In the function prototypes.
2. Overloaded functions
3. Overloaded functions
4. False. You can specify multiple default arguments.
5. voi d my_f un( f l oat x, i nt i =7, char ch= A ) ;
6. False. Overloaded functions must differ in their argument
lists, not only in their return values.
713
EXAMPLE
C+ + By
Chapter 21
1. For portability between different computers
2. False. The standard output can be redirected to any device
through the operating system.
3. get ch( ) assumes st di n for the input device.
4. get
5. >and <
6. get che( )
7. False. The input from get goes to a buffer as you type it.
8. Enter
9. True
Chapter 22
1. The character-testing functions do not change the character
passed to them.
2. get s( ) and f get s( )
3. f l oor ( ) rounds down and cei l ( ) rounds up.
4. The function returns 0 (false) because i sl ower ( s ) returns a 1
(true) and i sal pha( 1) is 0.
5. Pet er Par ker
6. 8 9
7. True
8. Pr og with a null zero at the end.
9. True
Appendix B o Answ ers to Review Q uestions
714
Chapter 23
1. False
2. The array subscripts differentiate array elements.
3. C does not initialize arrays for you.
4. 0
5. Yes. All arrays are passed by address because an array name
is nothing more than an address to that array.
6. C++ initializes all types of global variables (and every other
static variable in your program) to zero or null zero.
Chapter 24
1. False
2. From the low numbers floating to the top of the array like
bubbles.
3. Ascending order
4. The name of an array is an address to the starting element of
that array.
5. a. Eagl es
b. Rams
c. l es
d. E
e. E
f. The statement prints the character string, s.
g. The third letter of Eagles (g) prints.
715
EXAMPLE
C+ + By
Chapter 25
1. i nt scor es[ 5] [ 6] ;
2. char i ni t i al s[ 4] [ 10] [ 20]
3. The first subscript represents rows and the last represents
columns.
4. 30 elements
5. a. 2
b. 1
c. 91
d. 8
6. Nested f or loops step through multidimensional tables very
easily.
7. a. 78
b. 100
c. 90
Chapter 26
1. a. Integer pointer
b. Character pointer
c. Floating-point pointer
2. Address of
3. The * operator
4. pt _sal = &sal ar y;
5. False
6. Yes
7. a. 2313.54
Appendix B o Answ ers to Review Q uestions
716
b. 2313.54
c. invalid
d. invalid
8. b
Chapter 27
1. Array names are pointer constants, not pointer variables.
2. 8
3. a, c, and d are equivalent. Parentheses are needed around
i pt r +4 and i pt r +1 to make b and e valid.
4. You have to move only pointers, not entire strings.
5. a and d
Chapter 28
1. Structures hold groups of more than one value, each of
which can be a different data type.
2. Members
3. At declaration time and at runtime
4. Structures pass by copy.
5. False. Memory is reserved only when structure variables are
declared.
6. Globally
7. Locally
8. 4
717
EXAMPLE
C+ + By
Chapter 29
1. True
2. Arrays are easier to manage.
3. a. i nvent or y[ 32] . pr i ce = 12. 33;
b. i nvent or y[ 11] . par t _no[ 0] = X ;
c. i nvent or y[ 96] = i nvent or y[ 62] ;
4. a. i t emis not a structure variable.
b. i nvent or y is an array and must have a subscript.
c. i nvent or y is an array and must have a subscript.
Chapter 30
1. Write, append, and read.
2. Disks hold more data than memory.
3. You can access sequential files only in the same order that
they were originally written.
4. An error condition occurs.
5. The old file is overwritten.
6. The file is created.
7. C++ returns an end-of-file condition.
Chapter 31
1. Records are stored in files and structures are stored in
memory.
2. False
3. The file pointer continually updates to point to the next byte
to read.
Appendix B o Answ ers to Review Q uestions
718
4. r ead( ) and wr i t e( )
5. The open( ) function cannot be called without a filename.
Chapter 32
1. Data members and member functions
2. No
3. No
4. Private
5. Declare it with the publ i c keyword.
719
EXAMPLE
C+ + By
C
000 00 0000 0000 null
001 01 0000 0001
002 02 0000 0010
003 03 0000 0011 n
004 04 0000 0100 N
005 05 0000 0101 p
006 06 0000 0110
007 07 0000 0111
008 08 0000 1000
009 09 0000 1001
010 0A 0000 1010
011 0B 0000 1011
012 0C 0000 1100
013 0D 0000 1101
014 0E 0000 1110
015 0F 0000 1111
016 10 0001 0000
ASCII Table
(Inc luding IBM Extended
Charac ter Codes)
Dec Hex Binary ASCII
X
10
X
16
X
2
Character
Appendix C o ASC II Table
720
017 11 0001 0001
018 12 0001 0010
019 13 0001 0011 !!
020 14 0001 0100
021 15 0001 0101
022 16 0001 0110
023 17 0001 0111
024 18 0001 1000
025 19 0001 1001
026 1A 0001 1010
027 1B 0001 1011
028 1C 0001 1100 FS
029 1D 0001 1101 GS
030 1E 0001 1110 RS
031 1F 0001 1111 US
032 20 0010 0000 SP
033 21 0010 0001 !
034 22 0010 0010 "
035 23 0010 0011 #
036 24 0010 0100 $
037 25 0010 0101 %
038 26 0010 0110 &
039 27 0010 0111 '
040 28 0010 1000 (
041 29 0010 1001 )
042 2A 0010 1010 *
043 2B 0010 1011 +
044 2C 0010 1100
045 2D 0010 1101 -
046 2E 0010 1110 .
047 2F 0010 1111 /
Dec Hex Binary ASCII
X
10
X
16
X
2
Character
721
EXAMPLE
C+ + By
048 30 0011 0000 0
049 31 0011 0001 1
050 32 0011 0010 2
051 33 0011 0011 3
052 34 0011 0100 4
053 35 0011 0101 5
054 36 0011 0110 6
055 37 0011 0111 7
056 38 0011 1000 8
057 39 0011 1001 9
058 3A 0011 1010 :
059 3B 0011 1011 ;
060 3C 0011 1100 <
061 3D 0011 1101 =
062 3E 0011 1110 >
063 3F 0011 1111 ?
064 40 0100 0000 @
065 41 0100 0001 A
066 42 0100 0010 B
067 43 0100 0011 C
068 44 0100 0100 D
069 45 0100 0101 E
070 46 0100 0110 F
071 47 0100 0111 G
072 48 0100 1000 H
073 49 0100 1001 I
074 4A 0100 1010 J
075 4B 0100 1011 K
076 4C 0100 1100 L
077 4D 0100 1101 M
078 4E 0100 1110 N
Dec Hex Binary ASCII
X
10
X
16
X
2
Character
Appendix C o ASC II Table
722
079 4F 0100 1111 O
080 50 0101 0000 P
081 51 0101 0001 Q
082 52 0101 0010 R
083 53 0101 0011 S
084 54 0101 0100 T
085 55 0101 0101 U
086 56 0101 0110 V
087 57 0101 0111 W
088 58 0101 1000 X
089 59 0101 1001 Y
090 5A 0101 1010 Z
091 5B 0101 1011 [
092 5C 0101 1100 \
093 5D 0101 1101 ]
094 5E 0101 1110 ^
095 5F 0101 1111
096 60 0110 0000 `
097 61 0110 0001 a
098 62 0110 0010 b
099 63 0110 0011 c
100 64 0110 0100 d
101 65 0110 0101 e
102 66 0110 0110 f
103 67 0110 0111 g
104 68 0110 1000 h
105 69 0110 1001 i
106 6A 0110 1010 j
107 6B 0110 1011 k
108 6C 0110 1100 l
109 6D 0110 1101 m
Dec Hex Binary ASCII
X
10
X
16
X
2
Character
723
EXAMPLE
C+ + By
110 6E 0110 1110 n
111 6F 0110 1111 o
112 70 0111 0000 p
113 71 0111 0001 q
114 72 0111 0010 r
115 73 0111 0011 s
116 74 0111 0100 t
117 75 0111 0101 u
118 76 0111 0110 v
119 77 0111 0111 w
120 78 0111 1000 x
121 79 0111 1001 y
122 7A 0111 1010 z
123 7B 0111 1011 {
124 7C 0111 1100 |
125 7D 0111 1101 }
126 7E 0111 1110 ~
127 7F 0111 1111 DEL
128 80 1000 0000
129 81 1000 0001
130 82 1000 0010
131 83 1000 0011
132 84 1000 0100
133 85 1000 0101
134 86 1000 0110
135 87 1000 0111
136 88 1000 1000
137 89 1000 1001
138 8A 1000 1010
139 8B 1000 1011
140 8C 1000 1100
Dec Hex Binary ASCII
X
10
X
16
X
2
Character
Appendix C o ASC II Table
724

141 8D 1000 1101

142 8E 1000 1110
143 8F 1000 1111
144 90 1001 0000
145 91 1001 0001
146 92 1001 0010
147 93 1001 0011
148 94 1001 0100
149 95 1001 0101
150 96 1001 0110
151 97 1001 0111
152 98 1001 1000
153 99 1001 1001
154 9A 1001 1010
155 9B 1001 1011
156 9C 1001 1100
157 9D 1001 1101
158 9E 1001 1110 Pt
159 9F 1001 1111
160 A0 1010 0000
161 A1 1010 0001
162 A2 1010 0010
163 A3 1010 0011
164 A4 1010 0100
165 A5 1010 0101
166 A6 1010 0110
167 A7 1010 0111
168 A8 1010 1000
169 A9 1010 1001
170 AA 1010 1010
171 AB 1010 1011
Dec Hex Binary ASCII
X
10
X
16
X
2
Character
725
EXAMPLE
C+ + By
172 AC 1010 1100
173 AD 1010 1101
174 AE 1010 1110
175 AF 1010 1111
176 B0 1011 0000
177 B1 1011 0001
178 B2 1011 0010
179 B3 1011 0011 |
180 B4 1011 0100
181 B5 1011 0101
182 B6 1011 0110
183 B7 1011 0111
184 B8 1011 1000
185 B9 1011 1001
186 BA 1011 1010
187 BB 1011 1011
188 BC 1011 1100
189 BD 1011 1101
190 BE 1011 1110
191 BF 1011 1111
192 C0 1100 0000 L
193 C1 1100 0001
194 C2 1100 0010
195 C3 1100 0011
196 C4 1100 0100
197 C5 1100 0101 +
198 C6 1100 0110
199 C7 1100 0111
200 C8 1100 1000
201 C9 1100 1001
202 CA 1100 1010
Dec Hex Binary ASCII
X
10
X
16
X
2
Character
Appendix C o ASC II Table
726
203 CB 1100 1011
204 CC 1100 1100
205 CD 1100 1101 =
206 CE 1100 1110
207 CF 1100 1111
208 D0 1101 0000
209 D1 1101 0001
210 D2 1101 0010
211 D3 1101 0011
212 D4 1101 0100
213 D5 1101 0101
214 D6 1101 0110
215 D7 1101 0111
216 D8 1101 1000
217 D9 1101 1001
218 DA 1101 1010
219 DB 1101 1011
220 DC 1101 1100
221 DD 1101 1101
222 DE 1101 1110
223 DF 1101 1111
224 E0 1110 0000
225 E1 1110 0001
226 E2 1110 0010
227 E3 1110 0011
228 E4 1110 0100
229 E5 1110 0101
230 E6 1110 0110
231 E7 1110 0111
232 E8 1110 1000
233 E9 1110 1001
Dec Hex Binary ASCII
X
10
X
16
X
2
Character
727
EXAMPLE
C+ + By
234 EA 1110 1010
235 EB 1110 1011
236 EC 1110 1100
237 ED 1110 1101
238 EE 1110 1110
239 EF 1110 1111
240 F0 1111 0000
241 F1 1111 0001
242 F2 1111 0010
243 F3 1111 0011
244 F4 1111 0100
245 F5 1111 0101
246 F6 1111 0110
247 F7 1111 0111
248 F8 1111 1000
249 F9 1111 1001
250 FA 1111 1010
251 FB 1111 1011
252 FC 1111 1100
253 FD 1111 1101 2
254 FE 1111 1110
255 FF 1111 1111
Dec Hex Binary ASCII
X
10
X
16
X
2
Character
Appendix C o ASC II Table
728
729
EXAMPLE
C+ + By
D
C++ Prec edenc e
Table
Precedence
Level Symbol Description Associativity
1
Highest ( ) Function call Left to right
[ ] Array subscript
C++ indirect component
selector
: : C++ scope access/resolution
. C++ direct component selector
2
Unary ! Logical negation Right to left
~ Bitwise (1s) complement
+ Unary plus
- Unary minus
Appendix D o C ++ Precedence Table
730
Precedence
Level Symbol Description Associativity
++ Preincrement or postincrement
Predecrement or postdecrement
& Address of
* Indirection
si zeof (Returns size of operand, in
bytes.)
new (Dynamically allocates
C++ storage.)
del et e (Dynamically deallocates
C++ storage.)
3
Member Left to right
Access . * C++ dereference
* C++ dereference
4
Multipli-
cative * Multiply Left to right
/ Divide
% Remainder (modulus)
5
Additive + Binary plus Left to right
- Binary minus
6
Shift << Shift left Left to right
>> Shift right
731
EXAMPLE
C+ + By
Precedence
Level Symbol Description Associativity
7
Relational < Less than Left to right
<= Less than or equal to
> Greater than
>= Greater than or equal to
8
Equality == Equal to Left to right
! = Not equal to
9 & Bitwise AND Left to right
10 ^ Bitwise XOR Left to right
11 | Bitwise OR Left to right
12 && Logical AND Left to right
13 | | Logical OR Left to right
14
Condi-
tional ?: Right to left
15
Assignment = Simple assignment Right to left
*= Assign product
/ = Assign quotient
Appendix D o C ++ Precedence Table
732
Precedence
Level Symbol Description Associativity
%= Assign remainder Right to left
+= Assign sum
- = Assign difference
&= Assign bitwise AND
^= Assign bitwise XOR
| = Assign bitwise OR
<<= Assign left shift
>>= Assign right shift
16
Comma , Evaluate Left to right
733
EXAMPLE
C+ + By
E
Keyword and
Func tion
Referenc e
These are the 46 C++ standard keywords:
aut o doubl e new* swi t ch
asm* el se oper at or * t empl at e
br eak enum pr i vat e* t hi s*
case ext er n pr ot ect ed t ypedef
cat ch* f l oat publ i c* uni on
char f or r egi st er unsi gned
cl ass* f r i end* r et ur n vi r t ual *
const got o shor t voi d
cont i nue i f si gned vol at i l e
def aul t i nl i ne* si zeof whi l e
del et e* i nt st at i c
do l ong st r uct
* These keywords are specific to C++. All others exist in both C and C++.
Appendix E o Keyw ord and Function Reference
734
The following are the built-in function prototypes, listed by their
header files. The prototypes describe the parameter data types that
each function requires.
stdio.h
i nt f cl ose( FI LE *st r eam) ;
i nt f eof ( FI LE *st r eam) ;
i nt f er r or ( FI LE *st r eam) ;
i nt f f l ush( FI LE *st r eam) ;
i nt f get c( FI LE *st r eam) ;
char *f get s( char *, i nt , FI LE *st r eam) ;
FI LE *f open( const char *f i l ename, const char *mode) ;
i nt f pr i nt f ( FI LE *st r eam, const char *f or mat , . . . ) ;
i nt f put c( i nt , FI LE *st r eam) ;
i nt f put s( const char *, FI LE *st r eam) ;
si ze_t f r ead( voi d *, si ze_t , si ze_t , FI LE *st r eam) ;
i nt f scanf ( FI LE *st r eam, const char *f or mat , . . . ) ;
i nt f seek( FI LE *st r eam, l ong of f set , i nt or i gi n) ;
si ze_t f wr i t e( const voi d *, si ze_t , si ze_t , FI LE *st r eam) ;
i nt get c( FI LE *st r eam) ;
i nt get char ( voi d) ;
char *get s( char *) ;
voi d per r or ( const char *) ;
i nt put c( i nt , FI LE *st r eam) ;
i nt put char ( i nt ) ;
i nt put s( const char *) ;
i nt r emove( const char *f i l ename) ;
voi d r ewi nd( FI LE *st r eam) ;
i nt scanf ( const char *f or mat , . . . ) ;
c type.h
i nt i sal num( unsi gned char ) ;
i nt asal pha( unsi gned char ) ;
i nt i scnt r l ( unsi gned char ) ;
i nt i sdi gi t ( unsi gned char ) ;
i nt i sgr aph( unsi gned char ) ;
i nt i sl ower ( unsi gned char ) ;
735
EXAMPLE
C+ + By
i nt i spr i nt ( unsi gned char ) ;
i nt i spunct ( unsi gned char ) ;
i nt i sspace( unsi gned char ) ;
i nt i supper ( unsi gned char ) ;
i nt i sxdi gi t ( unsi gned char ) ;
i nt t ol ower ( i nt ) ;
i nt t oupper ( i nt ) ;
string.h
char *st r cat ( char *, char *) ;
i nt st r cmp( char *, char *) ;
i nt st r cpy( char *, char *) ;
si ze_t st r l en( char *) ;
math.h
doubl e cei l ( doubl e) ;
doubl e cos( doubl e) ;
doubl e exp( doubl e) ;
doubl e f abs( doubl e) ;
doubl e f l oor ( doubl e) ;
doubl e f mod( doubl e, doubl e) ;
doubl e l og( doubl e) ;
doubl e l og10( doubl e) ;
doubl e pow( doubl e, doubl e) ;
doubl e si n( doubl e) ;
doubl e sqr t ( doubl e) ;
doubl e t an( doubl e) ;
stdlib.h
doubl e at of ( const char *) ;
i nt at oi ( const char *) ;
l ong at ol ( const char *) ;
voi d exi t ( i nt ) ;
i nt r and( voi d) ;
voi d sr and( unsi gned i nt ) ;
Appendix E o Keyw ord and Function Reference
736
737
EXAMPLE
C+ + By
F
The Mailing List
Applic ation
This appendix shows a complete program that contains most the
commands and functions you learned in this book. This program
manages a mailing list for your personal or business needs.
When you run the program, you are presented with a menu
of choices that guides you through the programs operation.
Comments throughout the program offer improvements you
might want to make. As your knowledge and practice of C++
improve, you might want to expand this mailing list application
into a complete database of contacts and relatives.
Here is the listing of the complete program:
/ / Fi l ename: MAI LI NG. CPP
/ / * Mai l i ng Li st Appl i cat i on *
/ / - - - - - - - - - - - - - - - - - - - - - - - -
/ /
/ / Thi s pr ogr amenabl es t he user t o ent er , edi t , mai nt ai n, and
/ / pr i nt a mai l i ng l i st of names and addr esses.
/ /
/ / Al l commands and concept s i ncl uded i n t hi s pr ogr amar e
/ / expl ai ned t hr oughout t he t ext of C++ By Exampl e.
Appendix F o The M ailing List Application
738
/ /
/ /
/ /
/ / These ar e i t ems you mi ght want t o add or change:
/ / 1. Fi nd your compi l er s cl ear scr een f unct i on t o
/ / i mpr ove upon t he scr een- cl ear i ng f unct i on.
/ / 2. Add an ent r y f or t he code member t o t r ack di f f er ent
/ / t ypes of names and addr esses ( i . e. , busi ness codes,
/ / per sonal codes, et c. )
/ / 3. Sear ch f or a par t i al name ( i . e. , t ypi ng Sm f i nds
/ / Smi t h and Smi t t y and Smyt he i n t he f i l e) .
/ / 4. When sear chi ng f or name mat ches, i gnor e case ( i . e. ,
/ / t ypi ng smi t h f i nds Smi t h i n t he f i l e) .
/ / 5. Pr i nt mai l i ng l abel s on your pr i nt er .
/ / 6. Al l ow f or sor t i ng a l i st i ng of names and addr ess by name
/ / or ZI P code.
/ / Header f i l es used by t he pr ogr am:
#i ncl ude <coni o. h>
#i ncl ude <ct ype. h>
#i ncl ude <f st r eam. h>
#i ncl ude <i ost r eam. h>
#i ncl ude <st r i ng. h>
const char FI LENAME[ ] = ADDRESS. DAT;
/ / Pr ot ot ype al l of t hi s pr ogr am s f unct i ons.
char get _answer ( voi d) ;
voi d di sp_menu ( voi d) ;
voi d cl ear _sc ( voi d) ;
voi d change_na ( voi d) ;
voi d pr i nt _na ( voi d) ;
voi d er r _msg ( char er r _msg[ ] ) ;
voi d pause_sc ( voi d) ;
const i nt NAME_SI ZE = 25;
const i nt ADDRESS_SI ZE = 25;
const i nt CI TY_SI ZE = 12;
739
EXAMPLE
C+ + By
const i nt STATE_SI ZE = 3;
const i nt ZI PCODE_SI ZE = 6;
const i nt CODE_SI ZE = 7;
/ / Cl ass of a name and addr ess
cl ass Mai l
{
pr i vat e:
char name[ NAME_SI ZE] ; / / Name st or ed her e, shoul d
/ / be Last , Fi r st or der
char addr ess[ ADDRESS_SI ZE] ;
char ci t y[ CI TY_SI ZE] ;
char st at e[ STATE_SI ZE] ; / / Save r oomf or nul l zer o.
char zi pcode[ ZI PCODE_SI ZE] ;
char code[ CODE_SI ZE] ; / / For addi t i onal expansi on. You
/ / mi ght want t o use t hi s member
/ / f or cust omer codes, vendor codes,
/ / or hol i day car d codes.
publ i c:
voi d pr _dat a( Mai l *i t em)
{
/ / Pr i nt s t he name and addr ess sent t o i t .
cout << \ nName : << ( *i t em) . name << \ n;
cout << Addr ess: << ( *i t em) . addr ess << \ n;
cout << Ci t y : << ( *i t em) . ci t y << \ t St at e:
<< ( *i t em) . st at e << Zi pcode: << ( *i t em) . zi pcode
<< \ n;
}
voi d get _new_i t em( Mai l *i t em)
{
Mai l t emp_i t em; / / Hol ds t empor ar y changed i nput .
cout << \ nEnt er new name and addr ess i nf or mat i on bel ow\ n( Pr ess t he ;
cout << Ent er key wi t hout t ypi ng dat a t o r et ai n ol d "
i nf or mat i on) \ n\ n;
cout << What i s t he new name? ;
ci n. get l i ne( t emp_i t em. name, NAME_SI ZE) ;
i f ( st r l en( t emp_i t em. name) ) / / Onl y save new dat a i f user
{ st r cpy( ( *i t em) . name, t emp_i t em. name) ; } / / t ypes somet hi ng.
cout << What i s t he addr ess? ;
ci n. get l i ne( t emp_i t em. addr ess, ADDRESS_SI ZE) ;
Appendix F o The M ailing List Application
740
i f ( st r l en( t emp_i t em. addr ess) )
{ st r cpy( ( *i t em) . addr ess, t emp_i t em. addr ess) ; }
cout << What i s t he ci t y? ;
ci n. get l i ne( t emp_i t em. ci t y, CI TY_SI ZE) ;
i f ( st r l en( t emp_i t em. ci t y) )
{ st r cpy( ( *i t em) . ci t y, t emp_i t em. ci t y) ; }
cout << What i s t he st at e? ( 2 l et t er abbr evi at i on onl y) ;
ci n. get l i ne( t emp_i t em. st at e, STATE_SI ZE) ;
i f ( st r l en( t emp_i t em. st at e) )
{ st r cpy( ( *i t em) . st at e, t emp_i t em. st at e) ; }
cout << What i s t he ZI P code? ;
ci n. get l i ne( t emp_i t em. zi pcode, ZI PCODE_SI ZE) ;
i f ( st r l en( t emp_i t em. zi pcode) )
{ st r cpy( ( *i t em) . zi pcode, t emp_i t em. zi pcode) ; }
( *i t em) . code[ 0] = 0; / / Nul l out t he code member
/ / ( unused her e) .
}
voi d add_t o_f i l e( Mai l *i t em) ;
voi d change_na( voi d) ;
voi d ent er _na( Mai l *i t em) ;
voi d get zi p( Mai l *i t em) ;
};
voi d Mai l : : change_na( voi d)
{
/ / Thi s sear ch f unct i on can be i mpr oved by usi ng t he
/ / code member t o assi gn a uni que code t o each per son on t he
/ / l i st . Names ar e di f f i cul t t o sear ch f or si nce t her e ar e
/ / so many var i at i ons ( such as Mc and Mac and St . and Sai nt ) .
Mai l i t em;
f st r eamf i l e;
i nt ans;
i nt s; / / Hol ds si ze of st r uct ur e.
i nt change_yes = 0; / / Wi l l become TRUE i f user f i nds
char t est _name[ 25] ; / / a name t o change.
cout << \ nWhat i s t he name of t he per son you want t o change? ;
ci n. get l i ne( t est _name, NAME_SI ZE) ;
s = si zeof ( Mai l ) ; / / To ensur e f r ead( ) r eads pr oper l y.
741
EXAMPLE
C+ + By
f i l e. open( FI LENAME, i os: : i n | i os: : out ) ;
i f ( ! f i l e)
{
er r _msg( *** Read er r or - Ensur e f i l e exi st s bef or e "
" r eadi ng i t ***) ;
r et ur n;
}
do
{
f i l e. r ead( ( unsi gned char *) &i t em, si zeof ( Mai l ) ) ;
i f ( f i l e. gcount ( ) ! = s)
{
i f ( f i l e. eof ( ) )
{ br eak; }
}
i f ( st r cmp( i t em. name, t est _name) == 0)
{
i t em. pr _dat a( &i t em) ; / / Pr i nt name and addr ess.
cout << \ nI s t hi s t he name and addr ess t o <<
change? ( Y/ N) ;
ans = get _answer ( ) ;
i f ( t oupper ( ans) == N )
{ br eak; } / / Get anot her name.
get _new_i t em( &i t em) ; / / Enabl e user t o t ype new
/ / i nf or mat i on.
f i l e. seekg( ( l ong) - s, i os: : cur ) ; / / Back up a st r uct ur e.
f i l e. wr i t e( ( const unsi gned char *) ( &i t em) ,
si zeof ( Mai l ) ) ; / / Rewr i t e i nf or mat i on.
change_yes = 1; / / Changed f l ag.
br eak; / / Fi ni shed
}
}
whi l e ( ! f i l e. eof ( ) ) ;
i f ( ! change_yes)
{ er r _msg( *** End of f i l e encount er ed bef or e f i ndi ng t he name ***) ; }
}
voi d Mai l : : get zi p( Mai l *i t em) / / Ensur e t hat ZI P code
/ / i s al l di gi t s.
{
i nt ct r ;
Appendix F o The M ailing List Application
742
i nt bad_zi p;
do
{
bad_zi p = 0;
cout << What i s t he ZI P code? ;
ci n. get l i ne( ( *i t em) . zi pcode, ZI PCODE_SI ZE) ;
f or ( ct r = 0; ct r < 5; ct r ++)
{
i f ( i sdi gi t ( ( *i t em) . zi pcode[ ct r ] ) )
{ cont i nue; }
el se
{
er r _msg( *** The ZI P code must consi st of di gi t s onl y ***) ;
bad_zi p = 1;
br eak;
}
}
}
whi l e ( bad_zi p) ;
}
voi d Mai l : : add_t o_f i l e( Mai l *i t em)
{
of st r eamf i l e;
f i l e. open( FI LENAME, i os: : app) ; / / Open f i l e i n append mode.
i f ( ! f i l e)
{
er r _msg( *** Di sk er r or - pl ease check di sk dr i ve ***) ;
r et ur n;
}
f i l e. wr i t e( ( const unsi gned char *) ( i t em) , si zeof ( Mai l ) ) ;
/ / Add st r uct ur e t o f i l e.
}
voi d Mai l : : ent er _na( Mai l *i t em)
{
char ans;
743
EXAMPLE
C+ + By
do
{
cout << \ n\ n\ n\ n\ nWhat i s t he name? ;
ci n. get l i ne( ( *i t em) . name, NAME_SI ZE) ;
cout << What i s t he addr ess? ;
ci n. get l i ne( ( *i t em) . addr ess, ADDRESS_SI ZE) ;
cout << What i s t he ci t y? ;
ci n. get l i ne( ( *i t em) . ci t y, CI TY_SI ZE) ;
cout << What i s t he st at e? ( 2 l et t er abbr evi at i on onl y) ;
ci n. get l i ne( ( *i t em) . st at e, STATE_SI ZE) ;
get zi p( i t em) ; / / Ensur e t hat ZI P code i s al l di gi t s.
st r cpy( ( *i t em) . code, ) ; / / Nul l out t he code member .
add_t o_f i l e( i t em) ; / / Wr i t e new i nf or mat i on t o di sk f i l e.
cout << \ n\ nDo you want t o ent er anot her name <<
and addr ess? ( Y/ N) ;
ans = get _answer ( ) ;
}
whi l e ( t oupper ( ans) == Y ) ;
}
/ / ************************************************************
/ / Def i ned const ant s
/ / MAX i s t ot al number of names al l owed i n memor y f or
/ / r eadi ng mai l i ng l i st .
const i nt MAX = 250;
const char BELL = \ x07 ;
/ / ************************************************************
i nt mai n( voi d)
{
char ans;
Mai l i t em;
do
{
di sp_menu( ) ; / / Di spl ay t he menu f or t he user .
ans = get _answer ( ) ;
swi t ch ( ans)
{
case 1 :
Appendix F o The M ailing List Application
744
i t em. ent er _na( &i t em) ;
br eak;
case 2 :
i t em. change_na( ) ;
br eak;
case 3 :
pr i nt _na( ) ;
br eak;
case 4 :
br eak;
def aul t :
er r _msg( *** You have t o ent er 1 t hr ough 4 ***) ;
br eak;
}
}
whi l e ( ans ! = 4 ) ;
r et ur n 0;
}
/ / ************************************************************
voi d di sp_menu( voi d) / / Di spl ay t he mai n menu of pr ogr am.
{
cl ear _sc( ) ; / / Cl ear t he scr een.
cout << \ t \ t *** Mai l i ng Li st Manager ***\ n;
cout << \ t \ t - - - - - - - - - - - - - - - - - - - - \ n\ n\ n\ n;
cout << Do you want t o: \ n\ n\ n;
cout << \ t 1. Add names and addr esses t o t he l i st \ n\ n\ n;
cout << \ t 2. Change names and addr esses i n t he l i st \ n\ n\ n;
cout << \ t 3. Pr i nt names and addr esses i n t he l i st \ n\ n\ n;
cout << \ t 4. Exi t t hi s pr ogr am\ n\ n\ n;
cout << What i s your choi ce? ;
}
/ / ************************************************************
voi d cl ear _sc( ) / / Cl ear t he scr een by sendi ng 25 bl ank
/ / l i nes t o i t .
{
i nt ct r ; / / Count er f or t he 25 bl ank l i nes.
f or ( ct r = 0; ct r < 25; ct r ++)
745
EXAMPLE
C+ + By
{ cout << \ n; }
}
/ / ************************************************************
voi d pr i nt _na( voi d)
{
Mai l i t em;
i f st r eamf i l e;
i nt s;
i nt l i nect r = 0;
s = si zeof ( Mai l ) ; / / To ensur e f r ead( ) r eads pr oper l y.
f i l e. open( FI LENAME) ;
i f ( ! f i l e)
{
er r _msg( *** Er r or - Ensur e f i l e exi st s bef or e"
" r eadi ng i t ***) ;
r et ur n;
}
do
{
f i l e. r ead( ( si gned char *) &i t em, s) ;
i f ( f i l e. gcount ( ) ! = s)
{
i f ( f i l e. eof ( ) ) / / I f EOF, qui t r eadi ng.
{ br eak; }
}
i f ( l i nect r > 20) / / Scr een i s f ul l .
{
pause_sc( ) ;
l i nect r = 0;
}
i t em. pr _dat a( &i t em) ; / / Pr i nt t he name and addr ess.
l i nect r += 4;
}
whi l e ( ! f i l e. eof ( ) ) ;
cout << \ n- End of l i st - ;
pause_sc( ) ; / / Gi ve user a chance t o see names
/ / r emai ni ng on- scr een.
}
Appendix F o The M ailing List Application
746
/ / ************************************************************
voi d er r _msg( char er r _msg[ ] )
{
cout << \ n\ n << er r _msg << BELL << \ n;
}
/ / ************************************************************
voi d pause_sc( )
{
cout << \ nPr ess t he Ent er key t o cont i nue. . . ;
whi l e ( get ch( ) ! = \ r )
{ ; } / / Wai t f or Ent er key.
}
/ / ************************************************************
char get _answer ( voi d)
{
char ans;
ans = get ch( ) ;
whi l e ( kbhi t ( ) )
{ get ch( ) ; }
put ch( ans) ;
r et ur n ans;
}
747
EXAMPLE
C+ + By
Glossary
Address. Each memory (RAM) location (each byte) has a unique
address. The first address in memory is 0, the second RAM locations
address is 1, and so on until the last RAM location (thousands of
bytes later).
ANSI. American National Standards Institute, the committee that
approves computer standards.
Argument. The value sent to a function or procedure. This can be
a constant or a variable and is enclosed inside parentheses.
Array. A list of variables, sometimes called a table of variables.
Array of Structures. A table of one or more structure variables.
ASCII. Acronym for American Standard Code for Information
Interchange.
ASCII File. A file containing characters that can be used by any
program on most computers. Sometimes called a text file or an
ASCII text file.
AUTOEXEC.BAT. A batch file in PCs that executes a series of
commands whenever you start or reset the computer.
Automatic Variables. Local variables that lose their values when
their block (the one in which they are defined) ends.
Glossary o
748
Backup File. A duplicate copy of a file that preserves your work in
case you damage the original file. Files on a hard disk are commonly
backed up on floppy disks or tapes.
Binary. A numbering system based on only two digits. The only
valid digits in a binary system are 0 and 1. See also Bit.
Binary zero. Another name for null zero.
Bit. Binary digit, the smallest unit of storage on a computer. Each
bit can have a value of 0 or 1, indicating the absence or presence of
an electrical signal. See also Binary.
Bit Mask. A pattern of bits that changes other bits on and off to
meet a certain logical condition.
Bitwise Operators. C++ operators that manipulate the binary
representation of values.
Block. One or more statements treated as though they are a single
statement. A block is always enclosed in braces, { and }.
Boot. To start a computer with the operating system software in
place. You must boot your computer before using it.
Bubble Sort. A method of sorting data into ascending or descend-
ing order. See also Quicksort, Shell Sort.
Bug. An error in a program that prevents the program from
running correctly. The term originated when a moth short-circuited
a connection in one of the first computers, preventing the computer
from working!
Byte. A basic unit of data storage and manipulation. A byte is
equivalent to eight bits and can contain a value ranging from 0 to 255.
Cathode Ray Tube (CRT). The television-like screen, also called
the monitor. It is one place to which the output of the computer can
be sent.
Central Processing Unit (CPU). The controlling circuit respon-
sible for operations in the computer. These operations generally
include system timing, logical processing, and logical operations. It
controls every operation of the computer system. On PCs, the central
processing unit is called a microprocessor; it is stored on a single
integrated circuit chip.
749
EXAMPLE
C+ + By
Code. A set of instructions written in a programming language.
See Source Code.
Comment. A message in a program, ignored by the computer, that
tells users what the program does.
Compile. Process of translating a program written in a program-
ming language such as C++ into machine code that your computer
understands.
Class. A C++ user-defined data type that consists of data members
and member functions. Its members are private by default.
Concatenation. The process of attaching one string to the end of
another or combining two or more strings into a longer string.
Conditional Loop. A series of C++ instructions that occurs a fixed
number of times.
Constant. Data defined with the const keyword that do not change
during a program run.
Constructor Function. The function executed when the program
declares an instance of a class.
CPU. Central Processing Unit.
CRT. Cathode Ray Tube.
Data. Information stored in the computer as numbers, letters, and
special symbols such as punctuation marks. This also refers to the
characters you input into your program so the program can produce
meaningful information.
Data Member. A data component of a class or structure.
Data Processing. What computers really do. They take data and
manipulate it into meaningful output. The meaningful output is
called information.
Data Validation. The process of testing the values entered in a
program. Checking whether a number is negative or positive or
simply ensuring that a number is in a certain range are two examples
of data validation.
Debug. Process of locating an error (bug) in a program and
removing it.
Glossary o
750
Declaration. A statement that declares the existence of a data
object or function. A declaration reserves memory.
Default. A predefined action or command that the computer
chooses unless you specify otherwise.
Default Argument List. A list of argument values, specified in a
functions prototypes, that determine initial values of the arguments
if no values are passed for those arguments.
Definition. A statement that defines the format of a data object or
function. A definition reserves no memory.
Demodulate. To convert an analog signal into a digital signal for
use by a computer. See also Modulate.
Dereference. The process of finding a value to which a pointer
variable is pointing.
Destructor. The function called when a class instance goes out of
scope.
Determinate Loop. A f or loop that executes a fixed number of
times.
Digital Computer. A term that comes from the fact that your
computer operates on binary (on and off) digital impulses of elec-
tricity.
Directory. A list of files stored on a disk. Directories within exist-
ing directories are called subdirectories.
Disk. A round, flat magnetic storage medium. Floppy disks are
made of flexible material and enclosed in 5 1/4-inch or 3 1/2-inch
protective cases. Hard disks consist of a stack of rigid disks housed
in a single unit. A disk is sometimes called external memory. Disk
storage is nonvolatile. When you turn off your computer, the disks
contents do not go away.
Disk Drive. A device that reads and writes data to a floppy or hard
disk.
Diskettes. Another name for the removable floppy disks.
Display. A screen or monitor.
751
EXAMPLE
C+ + By
Display Adapter. Located in the system unit, the display adapter
determines the amount of resolution and the possible number of
colors on-screen.
DOS. Disk Operating System.
Dot-Matrix Printer. One of the two most common PC printers.
The laser printer is the other. A dot-matrix printer is inexpensive and
fast; it uses a series of small dots to represent printed text and
graphics.
Element. An individual variable in an array.
Execute. To run a program.
Expanded Memory. A tricky way of expanding your computers
memory capacity beyond the 640K barrier using a technique called
bank switching. See also Extended Memory.
Extended Memory. RAM above 640K, usually installed directly
on the motherboard of your PC. You cannot access this extra RAM
without special programs. See also Expanded Memory.
External Modem. A modem that sits in a box outside your com-
puter. See also Internal Modem.
Field. A member in a data record.
File. A collection of data stored as a single unit on a floppy or hard
disk. Files always have a filename that identifies them.
File Extension. Used by PCs and consists of a period followed by
up to three characters. The file extension follows the filename.
Filename. A unique name that identifies a file. Filenames can be
up to eight characters long, and can have a period followed by an
extension (normally three characters long).
Fixed Disk. See Hard Disk.
Fixed-Length Records. A record where each field takes the same
amount of disk space, even if that fields data value does not fill the
field.
Floppy Disk. See Disk.
Glossary o
752
Format. Process of creating a map on the disk that tells the
operating system how the disk is structured. This process is how the
operating system keeps track of where files are stored.
Function. A self-contained coding segment designed to do a spe-
cific task. All C++ programs must have at least one function called
mai n( ) . Some functions are library routines that manipulate num-
bers, strings, and output.
Function Keys. The keys labeled F1 through F12 (some keyboards
only have up to F10).
Global Variables. A variable that can be seen from (and used by)
every statement in the program.
Hard Copy. The printout of a program (or its output). Also a safe
backup copy for a program in case the disk is erased.
Hard Disk. Sometimes called fixed disks. These hold much more
data and are many times faster than floppy disks. See Disk.
Hardware. The physical parts of the machine. Hardware has been
defined as anything you can kick.
Header Files. Files that contain prototypes of C++s built-in
functions.
Hexadecimal. A numbering system based on 16 elements. Digits
are numbered 0 through F, as follows: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B,
C, D, E, F.
Hierarchy of Operators. See Order of Operators.
Indeterminate Loop. A loop that continues an indeterminate
amount of times (unlike the f or loop, which continues a known
amount of times).
Infinite Loop. The never-ending repetition of a block of C++
statements.
Information. The meaningful product from a program. Data go
into a program to produce meaningful output (information).
Inline Function. A function that compiles as inline code each time
the function is called.
753
EXAMPLE
C+ + By
Input. The entry of data into a computer through a device such as
the keyboard.
Input-Process-Output. This model is the foundation of every-
thing that happens in your computer. Data are input, then processed
by your program in the computer, and finally information is output.
I/O. Acronym for Input/Output.
Integer Variable. Variables that can hold integers.
Internal Modem. A modem that resides inside the system unit.
See also External Modem.
Kilobyte (K). A unit of measurement that refers to 1,024 bytes.
Laser Printer. A type of printer that is faster, in general, than dot-
matrix printers. Laser printer output is much sharper than that of a
dot-matrix printer, because a laser beam actually burns toner ink
into the paper. Laser printers are more expensive than dot-matrix
printers.
Least Significant Bit. The rightmost bit of a byte. For example, a
binary 00000111 would have a 1 as the least significant bit.
Line Printer. Another name for your printer.
Link Editing. The last step the C++ compiler performs when
preparing your program for execution.
Literal. Data that remains the same during program execution.
Local Variable. A variable that can be seen from (and used by)
only the block in which it is defined.
Loop. The repeated execution of one or more statements.
Machine Language. The series of binary digits that a microproces-
sor executes to perform individual tasks. People seldom (if ever)
program in machine language. Instead, they program in assembly
language, and an assembler translates their instructions into ma-
chine language.
Main Module. The first function of a modular program called
mai n( ) that controls the execution of the other functions.
Glossary o
754
Maintainability. The computer industrys word for the ability to
change and update programs written in a simple style.
Manipulator. A value used by a program to inform the stream to
modify one of its modes.
Math Operator. A symbol used for addition, subtraction, multi-
plication, division, or other calculations.
Megabyte (M). In computer terminology, approximately a mil-
lion bytes (1,048,576 bytes).
Member. A piece of a structure variable that holds a specific type
of data, or a class variable that holds a specific type of data or a
function acting on that data.
Member Function. A function defined inside a class.
Memory. Storage area inside the computer, used to temporarily
store data. The computers memory is erased when the power is off.
Menu. A list of commands or instructions displayed on-screen.
These lists organize commands and make a program easier to use.
Menu-Driven. Describes a program that provides menus for choos-
ing commands.
Microchip. A small wafer of silicon that holds computer compo-
nents and occupies less space than a postage stamp.
Microcomputer. A small computer that can fit on a desktop, such
as a PC. The microchip is the heart of the microcomputer. Microcom-
puters are much less expensive than their larger counterparts.
Microprocessor. The chip that does the calculations for PCs. Some-
times it is called the Central Processing Unit (CPU).
Modem. A piece of hardware that modulates and demodulates
signals so your computer can communicate with other computers
over telephone lines. See also External Modems, Internal Modems.
Modular Programming. The process of writing your programs in
several modules rather than as one long program. By breaking a
program into several smaller program-line routines, you can isolate
problems better, write correct programs faster, and produce pro-
grams that are much easier to maintain.
755
EXAMPLE
C+ + By
Modulate. Before your computer can transmit data over a tele-
phone line, the information to be sent must be converted (modu-
lated) into analog signals. See also Demodulate.
Modulus. The integer remainder of division.
Monitor. The television-like screen that enables the computer to
display information. It is an output device.
Mouse. A hand-held device that you move across the desktop to
move an indicator, called a mouse pointer, across the screen. Used
instead of the keyboard to select and move items (such as text or
graphics), execute commands, and perform other tasks.
MS-DOS. An operating system for IBM and compatible PCs.
Multidimensional Arrays. Arrays with more than one dimen-
sion. As two-dimensional arrays, they are sometimes called tables or
matrices, which have rows and columns.
Nested Loop. A loop within a loop.
Null String. An empty string with an initial character of null zero
and with a length of 0.
Null Zero. The string-terminating character. All C++ string con-
stants and strings stored in character arrays end in null zero. The
ASCII value for the null zero is 0.
Numeric Functions. Library routines that work with numbers.
Object. C++ class members consisting of both data and member
functions.
Object Code. A halfway step between source code and execut-
able machine language. Object code consists mostly of machine
language but is not directly executable by the computer. It must first
be linked in order to resolve external references and address refer-
ences. See also Source Code, Machine Language.
Object-Oriented Programming. A programming approach that
treats data as objects capable of manipulating themselves.
Operator. An operator works on data and performs math calcula-
tions or changes data to other data types. Examples include the +, -, and
si zeof ( ) operators.
Glossary o
756
Order of Operators. Sometimes called the hierarchy of operators
or the precedence of operators. It determines exactly how C++ com-
putes formulas.
Output Device. Where the results of a program are output, such
as the screen, the printer, or a disk file.
Overloading. The process of writing more than one function with
the same name. The functions must differ in their argument lists so
C++ can identify which one to call.
Parallel Arrays. Two arrays working side by side. Each element in
each array corresponds to one in the other array.
Parallel Port. A connector used to plug a device such as a printer
into the computer. Transferring data through a parallel port is much
faster than transferring data through a serial port.
Parameter. A list of variables enclosed in parentheses that follow
the name of a function or procedure. Parameters indicate the num-
ber and type of arguments that are sent to the function or procedure.
Passing by Address. Also called passing by reference. When an
argument (a local variable) is passed by address, the variables
address in memory is sent to, and is assigned to, the receiving
functions parameter list. (If more than one variable is passed by
address, each of their addresses is sent to and assigned to the
receiving functions parameters.) A change made to the parameter
in the function also changes the value of the argument variable.
Passing by Copy. Another name for passing by value.
Passing by Reference. Another name for passing by address.
Passing by Value. By default, all C++ variable arguments are
passed by value. When the value contained in a variable is passed to
the parameter list of a receiving function, changes made to the
parameter in the routine do not change the value of the argument
variable. Also called passing by copy.
Path. The route the computer travels from the root directory to any
subdirectories when locating a file. The path also refers to the
subdirectories that MS-DOS examines when you type a command
that requires it to find and access a file.
757
EXAMPLE
C+ + By
Peripheral. A device attached to the computer, such as a modem,
disk drive, mouse, or printer.
Personal Computer. A microcomputer, also called a PC, which
stands for personal computer.
Pointer. A variable that holds the address of another variable.
Precedence of Operators. See Order of Operators.
Preprocessor Directive. A command, preceded by a #, that you
place in your source code that directs the compiler to modify the
source code in some fashion. The two most common preprocessor
directives are #def i ne and #i ncl ude.
Printer. A device that prints data from the computer to paper.
Private Class Member. A class member inaccessible except to the
classs member functions.
Program. A group of instructions that tells the computer what
to do.
Programming Language. A set of rules for writing instructions for
the computer. Popular programming languages include BASIC,
C, Visual Basic, C++, and Pascal.
Prototype. The definition of a function; includes its name, return
type, and parameter list.
Public Class Member. A class member accessible to any function.
Quicksort. A method of sorting data values into ascending or
descending order (faster than a Bubble Sort.) See also Bubble Sort,
Shell Sort.
RAM. Random-Access Memory.
Random-Access File. Records in a file that can be accessed in any
order you want.
Random-Access Memory. Memory that your computer uses to
temporarily store data and programs. RAM is measured in kilobytes
and megabytes. Generally, the more RAM a computer has, the more
powerful programs it can run.
Glossary o
758
Read-Only Memory. A permanent type of computer memory. It
contains the BIOS (Basic Input/Output System), a special chip used
to provide instructions to the computer when you turn the compu-
ter on.
Real Numbers. Numbers that have decimal points and a frac-
tional part to the right of the decimal.
Record. Individual rows in files.
Relational Operators. Operators that compare data; they tell how
two variables or constants relate to each other. They tell you whether
two variables are equal or not equal, or which one is less than or more
than the other.
ROM. Read-Only Memory.
Scientific Notation. A shortcut method of representing numbers
of extreme values.
Sectors. A pattern of pie-shaped wedges on a disk. Formatting
creates a pattern of tracks and sectors where your data and programs
are stored.
Sequence Point/Comma Operator. This operator ensures that
statements are performed in a left-to-right sequence.
Sequential File. A file that has to be accessed one record at a time
beginning with the first record.
Serial Port. A connector used to plug in serial devices, such as a
modem or a mouse.
Shell Sort. A method of sorting values into ascending or de-
scending order. Named after the inventor of this method. See also
Bubble Sort, Quicksort.
Single-Dimensional Arrays. Arrays that have only one subscript.
Single-dimensional arrays represent a list of values.
Software. The data and programs that interact with your hard-
ware. The C++ language is an example of software.
Sorting. A method of putting data in a specific order (such as
alphabetical or numerical order), even if that order is not the same
order in which the elements were entered.
759
EXAMPLE
C+ + By
Source Code. The C++ language instructions, written by pro-
grammers, that the C++ compiler translates into object code. See also
Object Code.
Spaghetti Code. Term used when there are too many got os in a
program. If a program branches all over the place, it is difficult to
follow and trying to follow the logic resembles a bowl of spaghetti.
Static Variables. Variables that do not lose their values when the
block in which they are defined ends. See also Automatic Variables.
Standard Input Device. The target of each cout and output func-
tion. Normally the screen unless rerouted to another device at the
operating systems prompt.
Standard Output Device. The target of each ci n and input func-
tion. Normally the keyboard unless rerouted to another device at the
operating systems prompt.
Stream. Literally, a stream of characters, one following another,
flowing among devices in your computer.
String. One or more characters terminated with a null zero.
String Constant. One or more groups of characters that end in a
null zero.
String Delimiter. See Null Zero.
String Literal. Another name for a String Constant.
Structure. A unit of related information containing one or more
members, such as an employee number, employee name, employee
address, employee pay rate, and so on.
Subscript. A number inside brackets that differentiates one ele-
ment of an array from another.
Syntax Error. The most common error a programmer makes.
Often a misspelled word.
System Unit. The large box component of the computer. The
system unit houses the PCs microchip (the CPU).
Timing Loop. A loop used to delay the computer for a specific
amount of time.
Glossary o
760
Tracks. A pattern of paths on a disk. Formatting creates a pattern
of tracks and sectors where your data and programs go.
Truncation. The fractional part of a number (the part of the
number to the right of the decimal point) is taken off the number. No
rounding is done.
Twos Complement. A method your computer uses to take the
negative of a number. This method, plus addition, allows the
computer to simulate subtraction.
Unary Operator. The addition or subtraction operator used before
a single variable or constant.
User-Friendliness. A program is user-friendly if it makes the user
comfortable and simulates an atmosphere that the user is already
familiar with.
Variable. Data that can change as the program runs.
Variable-Length Records. A record that takes up no wasted space
on the disk. As soon as a fields data value is saved to the file, the next
fields data value is stored after it. There is usually a special separat-
ing character between the fields so your programs know where the
fields begin and end.
Variable Scope. Sometimes called the visibility of variables, this
describes how variables are seen by your program. See also Global
Variables and Local Variables.
Volatile. Temporary state of memory. For example, when you
turn the computer off, all the RAM is erased.
Word. In PC usage, two consecutive bytes (16 bits) of data.
EXAMPLE
761
C+ + By
Index
761
* (dereferencing) pointer opera-
tor, 542
* (multiplication) math operator,
64, 164
*=(compound operator), 177
+(addition) math operator, 64,
164
++(increment) operator, 225
+=(compound operator), 177
- (hyphen), 336
(subtraction) math operator, 64,
164
- - (decrement) operator, 225
- =(compound operator), 177
. (dot) operator, 592, 608, 616
/ (division) math operator, 64,
164, 167-168
/ / (slashes), 46
/ =(compound operator), 177
: (colon), 321
; (semicolon), 56, 114, 120, 190,
339
Symbols
! (NOT) logical operator, 208, 452
! =(not equal to) relational
operator, 186
#(pound sign), 114
#def i ne directive, 94, 120-128
#i ncl ude directive, 61, 107,
115-120
%(modulus) math operator, 164,
167-168
%=(compound operator), 177
& (address of) pointer operator,
542
& (ampersand), 155, 391
&& (AND) logical operator, 208
( ) (parentheses), 46, 336, 365
(double quotation marks),
85, 117
(quotation marks), 89
, comma operator, 232-234, 758
* (asterisks), 345
Index o
762
<(input redirection symbol), 435
<(less than) relational operators,
186
< >(angled brackets), 117
<=(less than or equal to) rela-
tional operator, 186
=(assignment operator), 63,
174-178
=(equal sign), 80, 105, 400
==(equal to) relational operator,
186
>(greater than) relational opera-
tor, 186
>(output redirection symbol),
435
>=(greater than or equal to)
relational operator, 186
[ ] (brackets), 46, 100, 523
\ (backslash), 91
\ n (newline character), 91,
135-136, 433, 635
\ t (tab character), 138, 433
_ (underscore), 336
{ } (braces), 46, 56, 340
functions, 336
initializing arrays, 527
| | (OR) logical operator, 208
~Spher e( ) function, 663-670
2's complement, 692, 760
A
absolute values, 420-421, 461
access modes
random file, 648
read, 639
accessing
disks, 625
elements (arrays), 101
files, 627-628
modes, 630
random access, 627
sequential file access,
625-627
text mode, 630
members, classes, 675
RAM, 627
adapters, display, 24, 751
addition (+) math operator, 64,
164
address of (&) pointer operator,
542
addresses, 32, 559
& (address of) pointer opera-
tor, 542
arrays, passing, 386
integers, assigning floating-
point variables, 549
memory, 385, 681-682, 747
passing
nonarrays, 391-396
variables, 374, 385-394, 756
pointers, 542
addressing, 679
Algol programming language, 15
allocating memory, dynamic
allocation, 665
alphabetic testing functions,
450-451
Alt keys, 25
American National Standards
Insitute (ANSI), 13, 747
American Standard Code for
Information Interchange, see
ASCII
ampersand (&), 155, 391
analog signals, 29
AND (&&) logical operator, 208
angled brackets (< >), 117
ANSI (American National
Standards Institute), 747
appending
cout operator, 93
files, 628, 638-639
application-specific keys, 27
EXAMPLE
763
C+ + By
arguments, 747
alphabetical, testing for, 451
default
lists, 415-417, 750
multiple, 417-420
member functions, 670-674
mismatched, 407
numeric, testing for, 451
passing, 364-366
receiving, 550
see also variables
arithmetic
binary, 690-692
pointers, 568-574
arrays, 100, 474-479, 747
as si zeof argument, 231
assigning to arrays, 486
brackets ([ ] ), printing, 102
character pointers, 574
character, see character arrays
contents, changing, 563
data types, mixing, 609
declaring, 100, 475
strings, 478
subscripts, 482
defining, data type, 475
elements, 101, 751
accessing, 101
initializing all to zero, 481
inputting to, 611
subscripts, 101-102
filling
random values, 497
user input, 389
global, see global arrays
individual characters, 105
initializing, 104-105, 479-490
assignment operator, 480
braces ({ }), 527
brackets [ ] , 480
multidimensional, 529
mapping to memory, 524-526
members, 615-622
multidimensional, see multidi-
mensional arrays
names
as pointers, 558-559
changing, 560
notation, 608-610
parallel, 756
passing, 388
by address, 386
functions, 387
to functions, 484
(of) pointers, 551-553
pointers, 493
printing with cout operator,
102
ragged-edge, 574
referencing, 508-515, 558
reserving memory, 476
searching, 494-495
f or statement, 496
for values, 496-501
i f statement, 496
sizes, 128, 476-477, 480
sorting, 494-495, 501-508, 758
ascending sort, 506
bubble sort, 502-505, 748
character arrays, 508
descending sort, 494, 506
nested loops, 504
numeric arrays, 508
quicksort, 502, 757
shell sort, 502, 758
(of) strings, 574-578
strings
printing, 563
storing, 574
(of) structures, 589, 747
structures, declaring, 606-615
subscripts, 474
two-dimensional, 525
type, specifying, 390
values, assigning, 103
see also nonarrays
Index o
764
arrow keys, 27
ascending sort, 506
ASCII (American Std. Code for
Information Interchange), 747
characters, 683
returning, 409
files, 747
text files, 115, 630
values, printing, 154
ASCII Table, 719, 722-727
asci i ( ) function, 409
assigning
arrays to arrays, 486
floating-point variables, 549
literals
character, 89-93
integer, 83-84
string, 85
string values to character
arrays, 105
values
arrays, 103
elements, 479
members, 602
out-of-range subscripts, 479
strings, 107
to pointers, 545-546
to variables, 145
variables, 80-82
assignment operator (=), 63,
174-178, 480
assignment statements, 80, 105
pointers, initializing, 548
start expressions, 274
assignments
associating, 175-176
compound, 176-178
multiple, 175-176
statements, 174-178
associating assignments, 175-176
asterisks (*), 345
AT & T, 12
at of ( ) function, 460
at oi ( ) function, 460
at ol ( ) function, 460
aut o keyword, 369
AUTOEXEC.BAT file, 747
automatic variables, 369-374, 747
B
backslash (\ ), 91
backup files, 748
base-2 numbers, 686
base-10 numbers, 689
base-16 numbers, 695
BCPL programming language, 15
BEEP, 314
binary
arithmetic, 690-692
digits, 683, 748
file format, 631
modes, 631
operations, 165
states of electricity, 21
zeros, 88, 748
binary numbers, 17, 165, 679,
686-690, 748
converting
from hexadecimal numbers,
697
to 2's complement, 692
to hexadecimal, 697
negative, 692-694
binary state of electricity, 683
bit mask, 240, 748
bits, 682-685, 748
high-order, 686
least-significant, 686, 753
low-order, 686
most-significant, 686
order, 686
sign, 693
bitwise operators, 235-244, 748
truth tables, 235-236
EXAMPLE
765
C+ + By
blank
characters, 680
expressions, see null expres-
sion
lines, 136
blocks, 55
braces ({ }), 56
case, break statements, 312
statements, 246, 748
body (program)
functions, 336, 345
loops, indenting, 279
statements, 189, 342
boilerplates, 117
booting, 748
braces ({ }), 46, 56-57, 340
functions, 336
initializing arrays, 527
loops, 287
brackets ([ ] ), 46, 100
angled (< >), 117
arrays, initializing, 480
dimensions, 523
printing arrays, 102
branching, 321
br eak statement, 256-260, 298-303
case blocks, 312
nested loops, 299
unconditional, 299
breaks, conditional, 257-258
bubble sort, see sorting arrays
buffered input functions, 440-442
bugs, see debugging
built-in editors, 40
built-in functions, prototypes,
734-735
bytes, 20, 682-685, 748
K (kilobytes), 20, 753
M (megabytes), 24, 754
reserving, arrays, 476
C
C++
comparing to other languages,
16
origination, 15-16
calculations
data types, mixing, 178-182
strings, 460
structure members, 597
called functions, 364
recognizing, 368-369
return values, 398
variables, changing, 387
calling functions, 337-349
repeatedly, 417
carriage returns, 439
case blocks, br eak statements,
312
case expressions, 312
case statements, 313, 319
cathode ray tube (CRT), 24, 748
cei l ( x) function, 461
ceiling function, 461
central processing unit (CPU),
20-22, 748
cf r ont (UNIX) compiler, 43
CGA display adapter, 24
character arrays, 100-103
cont r ol _st r i ng, 149
erasing, passing to functions,
390
filenames, storing, 633
initializing, 480
pointing, to new strings, 563
reserving, 100, 480
sorting, 508
string values, assigning, 105
strings
comparing, 103-110
multiple, 512
printing, 135, 510
storing, 104
Index o
766
character formatting constants,
defining, 440
character functions, 450-455
conversion, 453-455
t ol ower ( c) , 454
t oupper ( c) , 454
i sal num( c) , 451
i sal pha( c) , 450
i sdi gi t ( c) , 451
i sl ower ( c) , 450
i supper ( c) , 450
i sxdi gi t ( c) , 451
passing to, 451
testing, 450-453
for digits, 451
i scnt r l ( c) , 453
i sgr aphi c( c) , 453
i spr i nt ( c) , 453
i spunct ( c) , 453
i sspace( c) , 453
character I/O functions, 432-446
character literals, 64, 89-93
character pointers, 563-568
arrays
defining, 574
storing, 574
filenames, 633
string constants, changing, 566
character strings, variables, 100
character variables, 75
character-based literals, 62
characters
\ t (tab), 138
ASCII, 683, 409
comparing, 199
conversion, 151-154
individual, arrays, 105
newl i ne ( \ n) , 135-136
string-terminating, 101,
457-458
ci n, 144-148, 248-249
input, keyboard, 144
values, variables, 145
classes, 661-670, 749
functions, defining, 754
member functions, 662-676
members
accessing, 675
data, 662
private, 674, 757
public, 757
visibility, 674-675
objects, 663
public, 662, 674
cl ose( ) function, 629
closing files, 629-634
code, 749
modules, see functions
object, 755
source, see source code
spaghetti, 759
unreachable, 305
colon (: ), 321
columns, printing, 139-140, 534
combining functions, cout and
of st r eam, 437
combining redirection symbols,
436
comma (, ) operator, 232-234, 758
comments, 46, 57-61, 749
comparing
characters, 199
data, relational operators, 186
internal data, bit-by-bit, 235
literals to variables, 192
loops, i f vs. whi l e, 255
numbers, 199
variables, 192
compatibility,
AT & T, 12
with other computers, 433
compile-time operator, 231
compiled languages, 37
compilers, 37, 42-44
C++, 11
cf r ont (UNIX), 43
EXAMPLE
767
C+ + By
compiling, 43, 113, 749
compound assignments, 176-178
compound operators, 177
compound relational operators,
see logical operators
compound relational tests, 207
computers
digital, 29, 750
microcomputers, 754
personal (PCs), 757
see also microcomputers
concatenation, 456, 749
conditional breaks, 257-258
conditional loops, 749
conditional operators, 222-225
CONFIG.SYS file, FI LES= state-
ment, 629
console, 434
const keyword, 94, 120, 749
constant variables, 94-95
constants, 94, 749, 759
defining
character formatting, 440
variables as, 120
numeric, printing, 151
pointers, 560-562
string
changing, 566
printing, 150
see also literals and pointer
constants
construct statements, 246
constructor functions, 663, 749
multiple, 673
overloading, 673
constructs, loops, 276
cont i nue statement, 303-307
control characters, I/O functions,
433
control operators, 139-144
cont r ol _st r i ng, 149, 155
controlling
format string, 149
function calls, 338
statements conditionally, 185
conversion characters, 151-154
floating-point, 151
functions, 453-455
for printing, 297
set wmanipulator, 140
converting
binary numbers
to 2's complement, 692
to hexadecimal, 697
data types automatically, 179
hexadecimal numbers to
binary numbers, 697
strings to numbers, 460-461
to floating-point number,
460
to integers, 460
to uppercase, 240
copy, passing by, 379, 547, 756
copying
literals, in strings, 107
members, structure variables,
598
cos( x) function, 464
count expressions
increments, 281
loops, 274, 278
counter variables, 262, 265, 360
nested loops, 288
counters, 260-268
cout , 65, 85
\ n, 91
appending, 93
combining with of st r eam, 437
format, 134
labeling output, 136
literals, printing, 83
printing
arrays, 102
strings, 134-144
Index o
768
CPU (central processing unit),
20-22, 748
creating files, 628, 648
CRT (cathode-ray tube), 24
Ctrl keys, 25
ctype.h header file, 450, 734
cube( ) function, 674
cursor, 24, 27
D
data
hiding, 675
passive, 663
data comparison, 186
data members, 662, 749
data processing, 29
data types, 75-79
arrays
defining, 475
mixing, 609
casting, 179-182
converting automatically, 179
i nt , 400
members, 584
mixing, 82
in calculations, 178-182
variables, 179
pointers, 542
values, truncating, 179
variables, 72-73
weak, 16
data validation, 195, 749
data-driven programs, 185
debugging, 47, 748-749
decision statements, 189
declaring, 750
arrays, 100, 475
of pointers, 551
strings, 478
of structures, 606-615
subscripts, 482
automatic local variables, 369
elements and initializing,
479-486
global variables, 358
pointers, 543-545
file, 632
global, 542
local, 542
while initializing, 545
statements, 101
structures, 591
types, parameters, 366
variables, 62, 73
signed prefix, 166
static, 370
decrement (- - ) operator, 225, 233
decrementing
expressions, 228
pointers, 568
variables, 225-230, 282
default argument list, 415-420,
750
default line, switch statement,
312
defaults, 750
defined literals, 121
arrays, sizes, 128
replacing, 126
variables, 122
defining
arrays
character pointers, 574
data types, 475
of structures, 589
constants, character format-
ting, 440
floating-point literals, 127
functions, 340, 365
in classes, 754
in functions, 341
literals, 365
structures, 587-591
globally, 595
nested, 602
EXAMPLE
769
C+ + By
variables, 365
after opening brace, 355
as constants, 120
outside functions, 355
structure, 595
definition line, 406, 750
Del key, 27
delay value, 296
delimiters, strings, 88, 759
demodulated signals, 29, 750
dereferencing (*) pointer opera-
tor, 542, 750
descending sort, 494, 506
see also sorting arrays
designating literals
floating-point, 79
long, 79
unsigned, 79
designing programs, 38-39
destructor function, 665, 750
determinate loops, 750
devices
default, overriding, 436
flushing, 458
get ( ) function, 438
I/O (standard), 434
input, standard, 759
output, 134, 756, 759
redirecting from MS-DOS,
435-436
standard, 434
digital computer, 29, 750
digital testing, functions, 451
digits
binary, 683
testing for, character func-
tions, 451
dimensions, designating with
braces ({ }), 523, 527
directives, 757
#def i ne, 94
#i ncl ude, 61
directories, 750
paths, 756
subdirectories, 750
disk drives, 23, 750
disk operating system (DOS), 751
diskettes, see floppy disks
disks, 22-24, 626-627, 750
files
accessing, 625-628
appending, 628
creating, 628
opening/closing, 629-634
fixed, see hard disks
floppy, see floppy disks
formatting, 23, 752
hard, see hard disks
measurements, 680-681
sectors, 758
size, 24
tracks, 23, 760
disk drives, 23
see also hard disks
display adapters, 24, 751
CGA, 24
EGA, 24
MCGA, 24
VGA, 24
see also monitors; screens
displaying error messages,
nested loops, 296
division (/ ) math operator, 64,
164, 167-168
do- whi l e loop, 252-255
DOS (disk operating system),
30-32, 751
dot (. ) operator, 592, 608, 616
dot-matrix printer, 25, 751, 753
double subscripts, 616
dynamic memory allocation, 665
Index o
770
E
EDIT editor, 41
editing, linking, 753
editors, 37-42
built-in, 40
EDIT, 41
EDLIN, 41
ISPF, 42
EGA display adapters, 24
electricity (states), 21, 683
elements (arrays), 101, 751
accessing, 101
assigning values, 479
initializing, 486-492
all to zero, 481
at declaration time,
479-486
inputting, 611
members, 584
referencing with subscripts,
476
reserving, 103
space between, 476
storing, 476
subscripts, 101-102, 474
elements (pointers),
dereferencing, 576
el se statement, 198-203
embedding functions, 668
endless loops, 323
environments
integrated, 40-41
variables, 256
equal sign (=), 80, 105, 400
equal to (==) relational operator,
186
equality testing, 187
erasing character arrays by
passing to functions, 390
error messages, 46-48
displaying, nested loops, 296
illegal initialization, 102
syntax, 46
escape key, 25
escape-sequence characters,
91-92
executable files, 42
executing, 751
functions repeatedly, 347
programs
falling through, 312
stopping, manually, 250
see also running programs
exi t ( ) function, 256-260
isolating, 256
stdlib.h header file, 256
exiting
conditional breaks, 257-258
loops, 256-260, 303
exp( x) function, 465
expanded memory, 21, 751
see also extended memory
expressions
case, 312
count, 274
increments, 281
loops, 278
incrementing/decrementing,
228
loops
start, 278
test, 275, 283
nonconditional, 190
null, 285
start, 274
swi t ch statement, 312
test, 274
parentheses, 246
extended memory, 21, 681, 751
see also expanded memory
extensions (filenames), 42, 751
external functions, 117
external memory, 22
external modem, 28, 751
EXAMPLE
771
C+ + By
F
f abs( x) function, 461
factorial, 290
f f l ush( ) function, 458
f get s( ) function, 457
fields, 751
file pointers, 631, 650
declaring globally, 632
positioning, 650-656
f i l e_pt r pointer, 629
filenames, 751
#i ncl ude directive, 115
character pointers, 633
conventions, 43
extensions, 42, 751
recommended, 43
storing character arrays, 633
files, 751
accessing, 627-628
modes, 630, 639, 648
random access, 627
sequential file access,
625-627
text mode, 630
appending, 628, 638-639
ASCII, 630, 747
AUTOEXEC.BAT, 747
backup, 748
CONFIG.SYS, FI LES=state-
ment, 629
creating, 648
directories, 750
disk, creating, 628
executable, 42
formats, binary, 631
header, see header files
include, order, 118
opening/closing, 629-634, 647
pointing, 629
random, see random files
random-access, 628, 757
reading, 639-642
reading to specific points,
649-656
records, 635, 758
fields, 646
fixed-length, 647
sequential, 627-629, 758
string.h, 107
writing to, 634-637
FI LES=statement, 629
f i l l _st r uct s( ) function, 597
filling arrays
random values, 497
user input, 389
fixed disks, see hard disks
fixed-length records, 647, 751
floating-point
conversion characters, 151
literals, 79
defining, 127
designating, 79
numbers, 63, 76
converting to, 460
printing, 140
value, 138
variables, 100, 142
assigning to integer
addresses, 549
printing, 152
f l oor ( x) mathematical function,
462
floppy disks, 22, 750-751
flushing devices, 458
f mod( x, y) function, 462
f or loops, 273-286
body, 279
expressions
count, 274
start, 274
test, 274
nested, 286-291
tables, multidimensional,
530-537
Index o
772
f or statement, 274, 290, 298-303,
496
format statements, assignment,
80
formats
#i ncl ude directive, 115
conditional operator, 222
cout , 134
files, binary, 631
programs, 53-54
multiple-function, 338
strings (controlling), 149
formatted output, printing,
436-437
formatting
disks, 23, 752
output, 437-446
formulas, subscripts, referencing
elements, 476
f put s( s, dev) function, 457
fractions, rounding, 140
function calls, 332, 337-339
controlling, 338
increment/decrement
operators, 233
invocation, 339
nested, 402
return values, 401
tracing, 340
function invocation, 339
function keys, 27, 752
function-calling statements, 337
functions, 331-332, 752
{ } (braces), 336
~Spher e( ) , 663-670
arrays
filling with user input, 389
passing, 387
asci i ( ) , 409
at of ( ) , 460
at oi ( ) , 460
at ol ( ) , 460
body, 336, 345
buffered/nonbuffered, 444
built-in, prototypes, 734-735
called, changing variables, 387
calling, 337-349, 364
recognizing, 368-369
repeatedly, 417
character, 450-455
conversion, 453-455
i sal num( c) , 451
i sal pha( c) , 450
i scnt r l ( c) , 453
i sdi gi t ( c) , 451
i sgr aph( c) , 453
i sl ower ( c) , 450
i spr i nt ( c) , 453
i spunct ( c) , 453
i sspace( c) , 453
i supper ( c) , 450
i sxdi gi t ( c) , 451
passing to, 451
prototypes, 450
testing, 450, 453
testing for digits, 451
t ol ower ( c) , 454
t oupper ( c) , 454
character arrays, erasing, 390
ci n, 248
cl ose( ) , 629
constructor, 663, 673, 749
cube( ) , 674
defining, 340, 365
in classes, 754
in functions, 341
definition line, 406
destructor, 665, 750
embedding, 668
exi t ( ) , 256-260
isolating, 256
stdlib.h header file, 256
external, 117
f f l ush( ) , 458
f i l l _st r uct s( ) , 597
EXAMPLE
773
C+ + By
get ( ) , 438-444
get ch( ) , 444-446
I/O, 656-658
character, 437-446
control characters, 433
f get s( s, l en, dev) , 457
f put s( s, dev) , 457
get s( ) , 457, 635
put s( ) , 457, 635
r ead( ar r ay, count ) , 656
r emove( f i l ename) , 656
wr i t e( ar r ay, count ) , 656
in-line, 668-670, 752
input
buffered, 440
building, 442
mirror-image, 637
keyboard values, 392
length, 335
logarithmic, 465
exp( x) , 465
l og( x) , 465
l og10( x) , 465
main, 56
mai n( ) , 56-57, 61, 332, 335
OOP, 665
prototyping, 409
mathematical, 461-464
cei l ( x) , 461
f abs( x) , 461
f l oor ( x) , 462
f mod( x, y) , 462
pow( ) , 463
pow( x, y) , 462
sqr t ( x) , 462
member, 754
arguments, 670-674
classes, 662-676
multiple execution, 347
naming, 335-337
_ (underscore), 336
name-mangling, 422
rules, 335
next _f un( ) , 338
nonbuffered, 444
numeric, 461-467, 755
of st r eam, 436-437
open( ) , 629, 648
overloading, 415, 420-425, 756
parentheses, 336, 365
passing arrays, 484
pr _msg( ) , 416
pr i nt _i t ( ) , 525
pr i nt f ( ) , 65, 126, 149-150,
191, 407
prototypes, 338, 397, 405-411
ctype.h header file, 734
math.h header file, 461, 735
self-prototyping, 406
stdio.h header file, 734
stdlib.h header file, 460, 735
string.h header file, 735
put ( ) , 438-444
put ch( ) , 444-446
r and( ) , 465-466, 497
receiving, 364, 382
redefining, 121-126
return statements, 337, 345
return values, 398-405
returning, 337-349
scanf ( ) , 126, 149, 154-157
passing variables, 546
prototyping, 407
seekg( ) , 649-656
separating, 345
set w( ) , 140
si zeof ( ) , 476-477
sort, saving, 508
Spher e( ) , 663-670
squar e( ) , 674
st r cat ( ) , 456
st r cpy( ) , 107, 408
string, 455-461
f get s( s, l en, dev) , 457
f put s( s, dev) , 457
Index o
774
get s( s) , 457
I/O, 456-459
put s( s) , 457
st r cat ( s1, s2) , 456
st r cmp( s1, s2) , 456
st r l en( s1) , 456
testing, 456
st r l en( ) , 251
sur f ace_ar ea( ) , 663-670
testing
alphabetic conditions,
450-451
digits, 451
numeric arguments, 451
t hi r d_f un( ) , 338
trigonometric
cos( x) , 464
si n( x) , 464
t an( x) , 464
values, returning, 374
variables, types, 152
vol ume( ) , 663-670
writing, 332-337
see also routines
G
get ( ) function, 438-444
get ch( ) function, 444-446
get s( ) function, 457, 635
global arrays, initializing, 479
global pointers, declaring, 542
global variables, 73, 354-369, 752
declaring, 358
passing, 364
returning, 398
got o statement, 321-326
graphics monitors, 24
greater than (>) relational ope-
rator, 186
greater than or equal to (>=)
relational operator, 186
H
hard copy, 752
hard disks, 22, 751-752
see also disk drives
hardware, 17-29, 752
disks, 22-24
indepedence, 17
memory, 20-22
modems, 28-29
monitors, 24
mouse, 28
printers, 25
system unit, 20-22
header files, 117-118, 752
ctype.h
function prototypes, 734
prototypes, 450
iomanip.h, 408
iostream.h, 117, 408
math.h
function prototypes, 735
prototypes, 461
stdio.h
function prototypes, 408,
734
pr i nt f ( ) function, 150
stdlib.h
exi t ( ) function, 256
function prototypes, 735
prototypes, 460
string.h, 118
function prototypes, 735
prototypes, 456
hexadecimals, 17, 83, 695-698, 752
converting
from binary, 697
to binary numbers, 697
hiding data, 675
hierarchy of operators, see order
of precedence
high-order bit, 686
hyphen (- ), 336
EXAMPLE
775
C+ + By
I
I/O (input/output), 753
character, 432-436
devices (standard), 434
functions, 656-658
character, 437-446
control characters, 433
f get s( s, l en, dev) , 457
f put s( s, dev) , 457
get s( ) , 635
get s( s) , 457
put s( ) , 457, 635
r ead( ar r ay, count ) , 656
r emove( f i l ename) , 656
strings, 456-459
wr i t e( ar r ay, count ) , 656
rerouting, 434
statements, 17
stream, 432-436
strings, 457
i f loop, 189-199, 255, 496
i f tests, relational, 209
illegal initialization, 102
in-line functions, 668-670
include files, order, 118
increment (++) operator, 225, 233
incrementing
expressions, 228
pointers, 568
variables, 225-230
increments as count expressions,
281
indeterminate loops, 752
infinite loops, 246, 752
initial values of static variables,
370
initializing
arrays, 104-105, 479-490
assignment operator, 480
braces ({ }), 527
brackets [ ] , 480
global, 479
multidimensional, 529
character arrays, reserved, 480
elements, 479-492
illegal, 102
members individually, 591
multidimensional arrays,
526-530
pointers, 545
assignment statements, 548
while declaring, 545
structures, 591
dot (. ) operator, 592
members, 591-600
variables
structures, 591
to zero, 176
inline functions, 752
input, 30, 753
arrays, filling, 389
buffered, 441-442
characters, echoing, 444
devices, standard, 759
functions
buffered, 440
building, 442
mirror-image, 637
keyboard, 435
statements, 17
st di n, 434-435
stream header, 117
terminating
f get s( ) , 457
get s( ) , 457
values, 248
input redirection symbol (<), 435
input-output-process model, 30
input/output, see I/O
Ins key, 27
i nt data type, 400
integer literals, 83-84
integer variables, 73, 152, 753
Index o
776
integers, 63
address, assigning floating-
point variables, 549
converting to, 460
integrated environments, 40, 41
internal modem, 28, 753
internal truths, 210
interpreted languages, 37
iomanip.h header file, 139, 408
iostream.h header file, 117, 408
i sal num( c) function, 451
i sal pha( c) function, 450
i scnt r l ( c) function, 453
i sdi gi t ( c) function, 451
i sgr aph( c) function, 453
i sl ower ( c) function, 450
ISPF editor, 42
i spr i nt ( c) function, 453
i spunct ( c) function, 453
i sspace( c) function, 453
i supper ( c) function, 450
i sxdi gi t ( c) function, 451
iterations, 282, 296
J K
justification, 140, 574-575
K (kilobytes), 680
keyboard, 25-28
Alt keys, 25
application-specific keys, 27
arrow keys, 27
Ctrl keys, 25
Del key, 27
escape key, 25
function keys, 27
input, 435
inputting, 144
Ins key, 27
numeric keypad, 27
PgDn, 27
PgUp key, 27
Shift keys, 25
values, 392
keys, function, 752
keywords, 733
aut o, 369
const , 94, 120, 749
voi d, 406
kilobytes (K), 20, 680, 753
L
labels
output, 86, 136
statement, 321-322
languages
Algol, 15
BCPL, 15
C, 13
compiled, 37
interpreted, 37
machine, 753
weakly typed, 16
laser printers, 25, 751, 753
least-significant bit, 686, 753
length
functions, 335
strings, 89, 251
less than (<) relational operators,
186
less than or equal to (<=) rela-
tional operator, 186
line printer, 753
link editing, 753
linking, 43-44
lists
arguments, default, 416-417,
750
prototypes, multiple default
arguments, 417
variables, 474
see also arrays
literals, 62, 82-93, 94, 103, 753, 759
character, 64, 89-93
character-based, 62
comparing to variables, 192
copying in strings, 107
EXAMPLE
777
C+ + By
defined, 121, 365
replacing, 126
variables, 122
designating
floating-point, 79
long, 79
unsigned, 79
floating-point, 79, 127
integer, 83-84
numeric
defining, 127
overriding default, 79
octal, 83
printing with cout operator, 83
relational operators, 186
string
assigning, 85
defining, 127
endings, 87-89
printing, 85
suffixes, 79
local pointers, 542
local variables, 354-369, 753
automatic, 369, 747
changing, 354
defining, 355
multiple functions, 363
names, overlapping, 360
passing, 363-364
receiving functions, 368
value, losing, 355
l og( x) function, 465
l og10( x) function, 465
logarithmic functions, 465
exp( x) , 465
l og( x) , 465
l og10( x) , 465
logic, 211-215, 222
logical operators, 207-215
! (NOT), 208
&& (AND), 208
| | (OR), 208
bitwise, 235-244
order of precedence, 216
truth tables, 208
loop variables, 282
loop-counting variables, 361
looping statements, 246
loops, 247-252, 753
conditional, 749
constructs, 276
conversion characters for
printing, 297
determinate, 750
do- whi l e, 252-255
endless, 323
exiting, 256-260, 303
expressions
count, 274, 278
start, 274, 278
test, 274-275, 283
f or , 273-286
body, indenting, 279
multidimensional tables,
530-537
nested, 286-291
i f (compared to whi l e loop),
255
indeterminate, 752
infinite, 246, 752
nested, 755
braces, 287
br eak statement, 299
counter variables, 288
multidimensional tables,
530
sorting arrays, 504
timing loops, 296
statements, 277
timing, 295-298, 759
iterations, 296
nested loops, 296
whi l e, 245, 255
low-order bit, 686
lowercase letters, 55, 122
Index o
778
M
M (megabytes), 681
machine language, 753
mailing list program, 737-746
main module, 753
mai n( ) function, 56-57, 61, 332,
335
OOP, 665
prototyping, 409
maintainability of programs, 174
manipulators, 754
mapping arrays to memory,
524-526
masking, 240
matching braces ({ }), 56
math hierarchy, see order of
precedence
math operators, 754
%(modulus or remainder),
164, 167-168
* (multiplication), 64, 164
+(addition), 64, 164
- (subtraction), 64, 164
/ (division), 64, 164, 167-168
order of precendence, 168-174
math.h header file, function
prototypes, 461, 735
mathematical calculations on
strings, 460
mathematical functions
cei l ( x) , 461
f abs( x) , 461
f l oor ( x) , 462
f mod( x, y) , 462
pow( ) , 463
pow( x, y) , 462
sqr t ( x) , 462
mathematical summation
symbol, 290
mathematics, factorial, 290
matrices, see multidimensional
arrays; tables
MCGA display adapter, 24
measurements
disks, 680-681
memory, 680-681
megabytes (M), 24, 754
member functions, 662, 754
arguments, 670-674
classes, 662-676
members, 584, 749, 754
arrays, 615-622
classes
accessing, 675
constructor functions, 663
data, 662
functions, 662
private, 674, 757
public, 757
visibility, 674-675
data types, 584
initializing individually, 591
structures
copying, 598
initializing, 591-600
values, assigning with dot
operator, 602
memory, 20-22, 680-682, 754
& (address of) pointer opera-
tor, 543
addresses, 32, 385, 681-682,
747
arrays, mapping, 524-526
bytes, 680, 748
dynamic allocation, 665
expanded, 21, 751
extended, 21, 681, 751
external, 22
K (kilobytes), 20, 680, 753
M (megabytes), 24, 681, 754
measurements, 680-681
padding, 476
reserving
arrays, 476
structure tags, 585
volatility, 22, 760
EXAMPLE
779
C+ + By
menu-driven programs, 754
menus, 754
messages, error, see error
messages
microchips, 18, 754
microcomputers, 17, 754
microprocessors, 754
minimum routine, 224
mirror-image input functions,
637
models, see prototypes
modems, 28-29, 754
external, 751
internal, 753
modes
binary, 631
file access, 630
text, 630
modifers, set pr eci si on, 408
modular programming, 332, 754
modulated signals, 29
modules of code, 331
modulus (%) math operator, 164,
167-168, 755
monitors, 24
graphics, 24
monochrome, 24
see also displays; screens
most-significant bit, 686
mouse, 28, 755
moving cursor with arrow keys,
27
MS-DOS, 30-32, 435-436, 755
multidimensional arrays,
520-522, 755
f or loops, 530-537
initializing, 526-530
reserving, 522-524
storing, row order, 526
subscripts, 520-522
see also tables; matrices
multiple-choice statement, 312
multiplication (*) math operator,
64, 164
N
name-mangling, 422
naming
arrays
as pointers, 558-559
changing, 560
disks drives, 23
files, 751
functions, 335-337
overloading, 415
rules, 335
pointers, 542, 543
structures, 585
variables, 70-71, 360
invalid names, 71
local, overlapping, 360
spaces, 71
negative numbers, 166
binary, 692-694
nested
function calls, 402
structures, 600-603
nested loops, 755
braces, 287
br eak statement, 299
counter variables, 288
error messages, displaying,
296
f or , 286-291
multidimensional tables, 530
sorting arrays, 504
timing loops, 296
newl i ne ( \ n) character, 135-136,
433, 635
next _f un( ) function, 338
nonarrays, passing by address,
391-396
nonbuffered functions, 444
nonconditional expressions, 190
nonzero values, 451
NOT (! ) logical operator, 208, 452
not equal to (! =) relational
operator, 186
Index o
780
notation
array, 608-610
mixing, 609
scientific, 758
see also pointer notation
null
character, 88
expression, 285
strings, 755
zero, 101, 755
numbers
2's complement, 692
absolute value, 461
binary, 17, 165, 748
see also binary numbers
comparing, 199
converting from strings,
460-461
floating-point, 63, 76, 140
hexadecimal, see hexadecimal
numbers
integers, 63
justification, 140
negative, 166, 692-694
printing, 139
random-number processing,
465-469
real, 76, 758
rounding, 461-462
signed, 693
square, 196
tables, printing, 138
unsigned, 693
numeric
arguments, testing functions,
451
arrays, sorting, 508
constants, printing, 151
functions, 461-467, 755
keypad, 27
literals
defining, 127
overriding default, 79
variables, printing, 151
O
object code, 755
object-oriented programming, see
OOP
objects, 663, 755
octal literals, 83
of st r eamfunction, 436-437
on-screen printing, 125
OOP (object-oriented program-
ming), 14, 661, 665, 755
open( ) function, 629, 648
opening files, 629-634, 647-649
operations
binary, 165
direction, 175-176
operators, 16-17, 408, 755
! (NOT), 452
. (dot), 608, 616
assignment (=), 174-178
arrays, initializing, 480
binary, 165
bitwise, 234-241, 748
logical, 235-244
ci n, 144-148
comma (, ), 232-234, 758
compile-time, 231
compound, 177
conditional, 222-225
control, 139-144
cout , 83, 93, 134-148
decrement (- - ), 225, 233
dot (. ), 592
increment (++), 225, 233
logical, 207-215
! (NOT), 208
&& (AND), 208
| | (OR), 208
truth tables, 208
math, 754
* (multiplication), 64
+(addition), 64
- (subtraction), 64
/ (division), 64
EXAMPLE
781
C+ + By
order of precedence, 216, 752
overloaded, 542
pointers
& (address of), 542
* (dereferencing), 542
postfix, 225-227
precedence, 16, 756
prefix, 225-227
primary, order of
precendence, 169
relational, 185-189, 209, 758
see also relational operators
si zeof , 230-232
ternary, 222
unary, 165-166, 760
OR (| | ) logical operator, 208
order of case statements, 319
order of bits, 686
order of precedence, 752, 756-757
logical operators, 216
math operators, 168-174
parentheses, 170-174
primary operators, 169
table, 729-732
origin values, 650
origins of C++, 15-16
output
controlling, operators, 139-144
devices, 134, 756
standard, 759
formatting
carriage returns, 439
printing, 436-437
labeling, 86, 136
redirecting, 134
rerouting to printer, 436
screen, 24
st dout , 435
st r eam, 434
output redirection symbol (>),
435
output statements, 17
overlapping names of local
variables, 360
overloading, 756
constructor functions, 673
functions, 415, 420-425
name-mangling, 422
operators, 542
overriding
keyboard default device, 436
passing by copy, 547
overwriting variables, 354, 363
P
padding memory, 476
parallel arrays, 756
parallel port, 756
parameters, 756
passing, 374-375
pointers, 546-551
receiving, 364
types, declaring, 366
see also variables
parentheses ( ) , 46
condi t i onal _expr essi on, 223
empty, 365
functions, 336
order of precedence, 170-174,
216
type casting, 180
passing
arguments, see passing vari-
ables
arrays, 388
by address, 386
functions, 387
to functions, 484
by copy, overriding, 547
local variables, 364
nonarrays by address, 391-396
one-way, 398
parameters, 374-375
values to character functions,
451
Index o
782
variables, 363-369
by address, 374, 385-394,
756
by copy, 379, 756
by reference, 374, 385, 756
by value, 379-384, 756
global, 364
structure, 595
to scanf ( ) function, 546
passive data, 663
paths, 756
PCs (personal computers), 18,
757
percent sign (%), 167
peripherals, 757
personal computers (PCs), 757
PgDn key, 27
PgUp key, 27
placeholders, 246
pointer arithmetic, 568-574
pointer constants, 560-562
pointer notation, 558, 561, 568,
609
pointer variables, 155
pointers, 493, 541, 757
addresses, 542
arrays, 552-553
declaring, 551
names, 558-559
assigning values, 545-546
changing, 560-562
character, see character
pointers
data types, 542
declaring, 543-545
decrementing, 568
elements, dereferencing, 576
file, 631, 650
declaring globally, 632
positioning, 650-656
f i l e_pt r , 629
global, declaring, 542
incrementing, 568
initializing, 545
assignment statements, 548
while declaring, 545
local, declaring, 542
naming, 542-543
operators
& (address of), 542
* (dereferencing), 542
parameters, 546-551
prefixing, 548
reference, as arrays, 561
to files, 629
ports
parallel, 756
serial, 758
positioning pointers (file),
650-656
positive relational tests, 252
postfix operator, 225-227
pound sign (#), 114
pow( ) function, 463
pow( x, y) function, 462
pr _msg( ) function, 416
precedence, see order of prece-
dence
precedence table, 729-732
prefix operators, 225-227
prefixes
pointers, 548
signed, declaring variables,
166
preprocessor directives, 113-115,
757
#def i ne, 120-128
#i ncl ude, 115-120
; (semi-colon), 114
see also individual listings
preprocessors, 43
primary operators, order of
precendence, 169
pr i nt _i t ( ) function, 525
printers, 25, 757
dot-matrix, 25, 751-753
laser, 25, 751-753
EXAMPLE
783
C+ + By
line, 753
rerouting, 436
writing to, 637-638
pr i nt f ( ) function, 65, 126,
149-150, 191
prototyping, 407
stdio.h header file, 150
strings, constants, 150
printing
arrays
brackets ([ ] ), 102
cout operator, 102
blank lines, 136
columns, 534
set wmanipulator, 139-140
constants, numeric, 151
conversion characters, 297
floating-point values, zeros,
153
literals
cout operator, 83
string, 85
numbers, 139-140
on-screen, 125
output, formatted, 436-437
rows, 534
strings, 102
cout operator, 134-144
from character arrays, 135
in arrays, 563
in character arrays, 510
pr i nt f ( ) function, 150
tables, numbers, 138
titles, 535
values, ASCII, 154
variables
floating-point, 152
integer, 152
numeric, 151
private class members, 757
program editors, see editors
program listings, 38
programming, object-oriented,
see OOP
programming languages, see
languages
programs, 30, 36-38, 757
comments, 749
data-driven, 185
designing, 38-39
formats, 53-54
mailing list, 737-746
maintainability, 174
menu-driven, 754
modular programming, 332
multiple-function formats, 338
readability, 54-55
routines, 332
sample, 44-46
skeleton, 333
string length, 250
structured programming, 332
typing, 37
prototypes, 338, 757
built-in functions, 397,
405-411, 734-735
character functions, 450
ctype.h header file, 734
character functions, 450
f i l l _st r uct s( ) function, 597
header files, 408
lists, multiple default argu-
ments, 417
mai n( ) function, 409
math.h header file, 461, 735
pr i nt f ( ) function, 407
scanf ( ) function, 407
self-prototyping functions, 406
string.h header file, 735
stdio.h header file, 408, 734
stdlib.h header file, 460, 735
at o( ) function, 460
string.h header file (string
functions), 456
public class members, 662, 674,
757
put ( ) function, 438-444
put ch( ) function, 444-446
put s( ) function, 457, 635
Index o
784
QR
quicksort, see sorting arrays
quotation marks ( ), 85, 89, 117
ragged-edge arrays, 574
RAM (random-access memory),
20-22, 747, 757
accessing, 627
r and( ) function, 465-466, 497
random files, 628, 757
accessing, 627, 648
creating, 648
opening, 647-649
records, 646
fields, 646
fixed-length, 647
random-number processing,
465-469
read access mode, 639
r ead( ar r ay, count ) function, 656
read-only memory (ROM), 758
reading
files, 639-642
to files, specific points, 649-656
real numbers, 76, 758
receiving arguments (& prefix),
550
receiving functions, 364
local variables, 368
variables, renaming passed,
382
records, 635, 646, 758
fields, 646, 751
fixed-length, 647, 751
variable-length, 760
redefining
functions, 121-126
statements, 121-126
redirection
<(input redirection symbol),
435
>(output redirection symbol),
435
combining symbols, 436
devices from MS-DOS,
435-436
output, 134
reference, passing variables, 374,
385, 756
reference pointers as arrays, 561
referencing
* (dereferencing) pointer
operator, 542
addresses (%c control code),
512
arrays, 508-515
subscripts, 558
elements, subscripts, 476-474
relational if tests, 209
relational logic, 187
relational operators, 185-189, 758
! =(not equal to), 186
<(less than), 186
<=(less than or equal to), 186
==(equal to), 186
>(greater than), 186
>=(greater than or equal to),
186
compound, 209
relational tests, 252
internal truths, 210
positive, 252
remainder (%) math operator, 164
r emove( f i l ename) function, 656
renaming variables, passed, 382
replacing defined literals, 126
reserving
arrays
character, 100, 480
multidimensional, 522-524
of pointers, 551
elements, 103
memory
arrays, 476
structure tags, 585
uppercase letters, 55
variables, 365
EXAMPLE
785
C+ + By
resolution (screens), 24
return statements, 337, 345
return values, 374, 402
calling functions, 398
function calls, 401
functions, 398-405
global variables, 398
type, 400
returning functions, 337-349
ROM (read-only memory), 758
rounding
fractions, 140
numbers, 461-462
routines, 332
minimum, 224
see also functions
row order, multidimensional
arrays, 526
rows, printing, 534
running programs, see executing
programs
S
sample programs, 44-46
saving sort functions, 508
scanf ( ) function, 126, 149,
154-157
& (ampersand), 155
passing variables, 546
pointer variables, 155
prototyping, 407
variable names
scientific notation, 758
scope, variable, 760
screens
cursor, 24
output, 24
resolution, 24
see also displays; monitor
scrolling text, 24
searching arrays, 494-495
f or statement, 496
for values, 496-501
i f statement, 496
sections, see blocks
sectors, 758
seekg( ) function, 649-656
self-prototyping function, 406
semicolon (; ), 56, 114, 120, 190,
339
separating functions, 345
sequence point, see comma
operator
sequential files, 625-629, 758
serial ports, 758
setprecision modifier, 408
set wmanipulator, 408
conversion characters, 140
printing columns, 139-140
string width, 140
set w( ) function, 140
shell sort, see sorting arrays
Shift keys, 25
sign bit, 693
signals
analog, 29
demodulated, 29, 750
modulated, 29
signed
numbers, 693
prefix, variables, declaring,
166
variables, numeric, 78
si n( x) function, 464
size
arrays, 476-477, 480
variables, 76-77
si zeof operator, 230-232
si zeof ( ) function, 476-477
skeleton programs, 333
slashes (/ / ), 46
software, 19, 29-34, 758
sort functions, saving, 508
sor t _ascend file, 508
sor t _descend file, 508
Index o
786
sorting arrays, 494-495, 501-508,
758
ascending sort, 506
bubble sort, 502-505, 748
character arrays, 508
descending sort, 494, 506
nested loops, 504
numeric arrays, 508
quicksort, 502, 757
shell sort, 502, 758
source code, 40, 759
modifying, 113-115
text, including, 117
space
between elements, 476
in variable names, 71
spaghetti code, 759
specifying types in arrays, 390
Spher e( ) function, 663-670
sqr t ( x) function, 462
square numbers, 196
square root, 462
squar e( ) function, 674
standard input device, 434, 759
see also st di n
standard output device, 759
see also st dout
standards, ANSI, 13
start expressions, loops, 274, 278
statements
assignment, 80, 105, 174-178
initializing pointers, 548
start expressions, 274
assignments, multiple, 175-176
blocks, 246-748
body, 189
br eak, 256-260, 298-303
case, 313, 319
const r uct , 246
cont i nue, 303-307
controlling, conditionally, 185
cout , 85, 102
decision, 189
declaration, 101
do- whi l e, 252-255
el se, 198-203
FI LES=, 629
f or , 274, 290, 298-303
function-calling, 337
got o, 321-326
I/O (input/output), 17
i f , 189-199
input, 17
labels, 321-322
looping, 246, 277
multiple-choice, 312
output, 17
redefining, 121-126
return functions, 337
semicolon (; ), 56
separating, 232
st r uct , 587-591
swi t ch, 312-321, 342
whi l e, 246-247
states of electricity, 21, 683
static variables, 369-374, 759
declaring, 370
initial values, 370
st di n, 434-435
stdio.h header file
function prototypes, 408, 734
pr i nt f ( ) function, 150
stdlib.h header file
exi t ( ) function, 256
function prototypes, 460, 735
st dout , 434-435
storage, disks, 750
storing
arrays
character pointers, 574
strings, 574
elements (arrays), 476
filenames, character arrays,
633
multidimensional arrays, 526
EXAMPLE
787
C+ + By
strings, 100, 104, 563
user input, strings, 565
variables, 385-386
st r cat ( ) function, 456
st r cmp( ) function, 456
st r cpy( ) function, 107, 408
stream I/O, 432-436
streams, 434, 759
string constants, 566
string delimiter, 88, 759
string functions, 455-461
f get s( s, l en, dev) , 457
f put s( s, dev) , 457
get s( s) , 457
I/O, 456-459
prototypes, string.h header
file, 456
put s( s) , 457
testing, 456
st r cat ( ) , 456
st r cmp( ) , 456
st r l en( ) , 456
string length programs, 250
string literals
assigning, 85
defining, 127
endings, 87-89
printing, 85
string variables, 100
string-terminating characters,
457-458, 755
string.h header file, 107, 118
function prototypes, 456, 735
strings, 759
arrays
declaring, 478
printing, 563
storing, 574
arrays of, 574-578
character variables, 100
character arrays
comparing, 103-110
multiple, 512
concatenating, 456
constants, 759
cont r ol _st r i ng, 149, 155
converting to numbers,
460-461
empty, 755
format, controlling, 149
I/O, 457
inputting, 442
length, 89, 251
literals, 107, 759
mathematical calculations, 460
null, 755
printing, 102
cout operator, 134-144
from character arrays, 135
in character arrays, 510
pr i nt f ( ) function, 150
reserving elements, 103
shortening, 107
storing, 100, 104, 563
terminating character, 101
user input, storing, 565
values
assigning, 107
assigning to character
arrays, 105
width, 140
st r l en( ) function, 251, 456
st r uct statement, 587-591
structured programming, 332
structures, 584-587, 759
arrays, declaring, 606-615
arrays of, 747
declaring, 591
defining, 587-591
arrays of, 589
globally, 595
initializing, 591-592
members
calculations, 597
initializing, 591-600
names, 585
Index o
788
nested, 600-603
tags, 585
variables
copying members, 598
defining, 595
initializing, 591
passing, 595
specifying, 588
subdirectories, 750
subfunctions, 398
subroutines, 398
subscripts, 101-102, 474, 759
arrays
declaring, 482
referencing, 558
double, 616
formulas, referencing
elements, 476
multidimensional arrays, 522
multiple (multidimensional
arrays), 520
out-of-range (nonreserved),
assigning values, 479
referencing, 474
subtraction (- ) math operator, 64,
164
suffixes, literals, 79
summation symbol, 290
sur f ace_ar ea( ) function,
663-670
swapping variables, 502, 550
switch statements, 312-321
body, 342
default line, 312
expressions, 312
syntax errors, 46, 759
system unit, 20-22
T
tab (\ t ) character, 138, 433
tables
arrays of structure variables,
747
hierarchy, 511
justification, 574, 575
multidimensional, 530-537
numbers, printing, 138
see also arrays; matrices;
multidimensional arrays
t an( x) function, 464
terminating
string-terminating characters,
457-458
strings, 101
ternary operators, 222
test expressions
expressions, 283
loops, 274-275
parentheses, 246
testing
alphabetic conditions,
functions, 450-451
character testing functions,
450, 453
compound relational tests, 207
digital, functions, 451
equality, 187
i f , relational, 209
strings, functions, 456
relational, 252
internal truths, 210
positive, 252
values, 749
text
boilerplates, 117
scrolling, 24
source code, including, 117
text mode, 630
t hi r d_f un( ) function, 338
timing loops, 295-298, 759
iterations, 296
nested loop, 296
titles, printing, 535
t ol ower ( c) function, 454
totals, 260-270
t oupper ( c) function, 454
tracing function calls, 340
tracks (disks), 23, 760
EXAMPLE
789
C+ + By
transistors (electricity), 21
trigonometric functions
cos( x) , 464
si n( x) , 464
t an( x) , 464
truncation, 179, 760
truth tables, 208, 235-236
truths, internal, 210
two-dimensional arrays, 525
see also multidimensional
arrays
two's complement, 692
type casting (data types), 179-182
types
arrays, specifying, 390
parameters, declaring, 366
return values, 400
variables, 584
see also structures
see also data types
typing programs, 37
U
unary operators, 165-166, 760
unconditional break statements,
299
underscore (_ ), 336
UNIX, cf r ont compiler, 43
unreachable code, 305
unsigned literals, designating, 79
unsigned numbers, 693
unsigned variables, 84
uppercase letters, 55, 240
V
validating data, 195
values
arrays, searching for, 495,
496-501
ASCII, printing, 154
assigning
arrays, 103
elements, 479
out-of-range subscripts, 479
to pointers, 545-546
to variables, 145
data types, truncating, 179
delay, 296
floating-point, 138
initial, static variables, 370
keyboard, 392
members, assigning with dot
operator, 602
nonzero, 451
origin, 650
local variables, 355
passing variables by, 379-384,
756
passing to character functions,
451
returning from functions, 374
strings, assigning, 105-107
testing, 749
totaling, 265
variables
assigning, 80-82
assignment operator (=), 63
ci n function, 145
entering directly, 154
updating, 176
see also return values
variable scope, 353-362, 760
variable-length records, 760
variables, 62-63, 70-82, 760
addresses, 385-386
arrays, 747, 751
automatic, 369-374, 747
changing, called functions, 387
character, 75
character strings, 100
comparing to literals, 192
constant, 94-95
counter, 262, 265, 288, 360
data types, 179
declaring, 62, 73, 166
decrementing, 225-230
defined literals, 122
Index o
790
defining, 365
after opening brace, 355
as constants, 120
outside functions, 355
environment, 256
equality, determining, 186
floating-point, 100, 142, 152
global, see global variables
incrementing, 225-230
initializing to zero, 176
integer, 73, 152, 753
local, see local variables
loop, decrementing, 282
loop-counting, 361
lowercase letters, 122
naming, 70-71, 360
& (ampersand), 155
invalid names, 71
spaces, 71
numeric, signed, 78
overwriting, 354, 363
parameters, 756
passing, 363-369
by address, 374, 385-394,
756
by copy, 379, 756
by reference, 374, 385, 756
by value, 379-384, 756
renaming, 382
to scanf ( ) function, 546
pointer, 155, 757
scanf ( ) function, 155
printing, numeric, 151
ranges, 76-77
relational operators, 186
reserving, 365
size, 76-77
static, 369-374, 759
storing, 385-386
string, 100
see also string variables
structure
copying members, 598
defining, 595
initializing, 591
passing, 595
specifying, 588
swapping, 502, 550
types, 72-79, 584
functions, 152
long, 77
see also structures
unsigned, 84
values
assigning, 80-82, 145
assignment operator (=), 63
ci n function, 145
entering directly, 154
updating, 176
VGA display adapters, 24
voi d keyword, 406
volatile (memory), 22, 760
vol ume( ) function, 663-670
W
weakly typed (language), 16
see also data types
whi l e loops, 245-247, 255
white space, 55
width, strings, 140
width specifiers, 153
words, 760
wr i t e( ar r ay, count ) function,
656
writing
functions, 332-337
to files, 635-637
to printers, 637-638
XYZ
zeros, 87-89, 101
binary, 88, 748
floating-point values, 138, 153
null, 103, 755
subscripts, 102
variables, initializing, 176
Order Your Disk Program Today!
You can save yourself hours of tedious, error-prone typing by
ordering the companion disk to C++ By Example. The disk contains
the source code for all the complete programs and many of the
shorter samples in the book. Appendix Fs complete mailing-list
application is also included on the disk, as well as the answers to
many of the review exercises.
You will get code that shows you how to use most the features of
C++. Samples include code for keyboard control, screen control, file
I/O, control statements, structures, pointers, and more.
Disks are available in 3 1/2-inch format (high density). The cost is
$10 per disk. (When ordering outside the US, please add $5 for
shipping and handling.)
Just make a copy of this page, fill in the blanks, and mail it with your
check or money order to:
C++ Disk
Greg Perry
P.O. Box 35752
Tulsa, OK 74135-0752
Please print the following information:
Payment method: Check_____ Money Order_____
Number of Disks:____________@ $10.00 =___________
Name:__________________________________________________________
Street Address:____________________________________________
City:_______________________________________State:_______________
ZIP:_______________
(On foreign orders, please use a separate page to give your mailing
address in the format required by your post office.)
Checks and money orders should be made payable to:
Greg Perry
(This offer is made by Greg Perry, not by Que Corporation.)
Computer Books from Que Mean PC Performance!
Look Your Best with WordPerfect 5.1 .............................................. $24.95
Look Your Best with WordPerfect forWindows ............................... $24.95
Microsoft Word Quick Reference ...................................................... $ 9.95
Using Ami Pro .................................................................................... $24.95
Using LetterPerfect ............................................................................ $22.95
Using Microsoft Word 5.5: IBM Version, 2nd Edition ..................... $24.95
Using MultiMate ................................................................................ $24.95
Using PC-Write .................................................................................. $22.95
Using Professional Write ................................................................... $22.95
Using Professional Write Plus for Windows ..................................... $24.95
Using Word for Windows 2, Special Edition ..................................... $27.95
Using WordPerfect 5 .......................................................................... $27.95
Using WordPerfect 5.1, Special Edition ............................................ $27.95
Using WordPerfect for Windows, Special Edition ............................ $29.95
Using WordStar 7 ............................................................................... $19.95
Using WordStar, 3rd Edition .............................................................. $27.95
WordPerfect 5.1 Power Macros ......................................................... $39.95
WordPerfect 5.1 QueCards ................................................................ $19.95
WordPerfect 5.1 Quick Reference ..................................................... $ 9.95
WordPerfect 5.1 QuickStart ............................................................... $19.95
WordPerfect 5.1 Tips, Tricks, and Traps ........................................... $24.95
WordPerfect for Windows Power Pack ............................................. $39.95
WordPerfect for Windows Quick Reference ..................................... $ 9.95
WordPerfect for Windows Quick Start .............................................. $19.95
WordPerfect Power Pack ................................................................... $39.95
WordPerfect Quick Reference ........................................................... $ 9.95
Hardware/Systems
Batch File and Macros Quick Reference ........................................... $ 9.95
Computerizing Your Small Business ................................................. $19.95
DR DOS 6 Quick Reference .............................................................. $ 9.95
Easy DOS ........................................................................................... $19.95
Easy Windows .................................................................................... $19.95
Fastback Quick Reference .................................................................. $ 8.95
Hard Disk Quick Reference ............................................................... $ 8.95
Hard Disk Quick Reference, 1992 Edition ........................................ $ 9.95
Introduction to Hard Disk Management ............................................ $24.95
Introduction to Networking ................................................................ $24.95
Introduction to PC Communications .................................................. $24.95
Introduction to Personal Computers, 2nd Edition .............................. $19.95
Introduction to UNIX ......................................................................... $24.95
Laplink Quick Reference ................................................................... $ 9.95
MS-DOS 5 Que Cards ........................................................................ $19.95
MS-DOS 5 Quick Reference .............................................................. $ 9.95
MS-DOS 5 QuickStart ....................................................................... $19.95
MS-DOS Quick Reference ................................................................. $ 8.95
MS-DOS QuickStart, 2nd Edition ...................................................... $19.95
Networking Personal Computers, 3rd Edition ................................... $24.95
Que's Computer Buyer's Guide, 1992 Edition ................................... $14.95
Que's Guide to CompuServe .............................................................. $12.95
Que's Guide to DataRecovery ............................................................ $29.95
Que's Guide to XTree ......................................................................... $12.95
Que's MS-DOS User's Guide, Special Edition ................................... $29.95
Que's PS/1 Book ................................................................................. $22.95
TurboCharging MS-DOS ................................................................... $24.95
Upgrading and Repairing PCs ............................................................ $29.95
Upgrading and Repairing PCs, 2nd Edition ....................................... $29.95
Upgrading to MS-DOS 5 ................................................................... $14.95
Using GeoWorks Pro ......................................................................... $24.95
Using Microsoft Windows 3, 2nd Edition ......................................... $24.95
Using MS-DOS 5 ............................................................................... $24.95
Using Novell NetWare, 2nd Edition .................................................. $29.95
Using OS/2 2.0 ................................................................................... $24.95
Using PC DOS, 3rd Edition ............................................................... $27.95
Using Prodigy ..................................................................................... $19.95
Using UNIX ....................................................................................... $29.95
Using Windows 3.1 ............................................................................ $26.95
Using Your Hard Disk ....................................................................... $29.95
Windows 3 Quick Reference ............................................................. $ 8.95
Windows 3 QuickStart ....................................................................... $19.95
Windows 3.1 Quick Reference .......................................................... $ 9.95
Windows 3.1 QuickStart .................................................................... $19.95
Desktop Publishing/Graphics
CorelDRAW! Quick Reference ......................................................... $ 8.95
Harvard Graphics 3 Quick Reference ................................................ $ 9.95
Harvard Graphics Quick Reference ................................................... $ 9.95
Ques Using Ventura Publisher .......................................................... $29.95
Using DrawPerfect ............................................................................. $24.95
Using Freelance Plus .......................................................................... $24.95
Using Harvard Graphics 3 .................................................................. $29.95
Using Harvard Graphics for Windows ............................................... $24.95
Using Harvard Graphics, 2nd Edition ................................................ $24.95
Using Microsoft Publisher ................................................................. $22.95
Using PageMaker 4 for Windows ...................................................... $29.95
Using PFS: First Publisher, 2nd Edition ............................................ $24.95
Using PowerPoint ............................................................................... $24.95
Using Publish It! ................................................................................ $24.95
Macintosh/Apple II
Easy Macintosh .................................................................................. $19.95
HyperCard 2 QuickStart ..................................................................... $19.95
PageMaker 4 for the Mac Quick Reference ....................................... $ 9.95
The Big Mac Book, 2nd Edition ........................................................ $29.95
The Little Mac Book .......................................................................... $12.95
QuarkXPress 3.1 Quick Reference .................................................... $ 9.95
Que's Big Mac Book, 3rd Edition ...................................................... $29.95
Que's Little Mac Book, 2nd Edition ................................................... $12.95
Que's Mac Classic Book ..................................................................... $24.95
Ques Macintosh Multimedia Handbook ........................................... $24.95
System 7 Quick Reference ................................................................. $ 9.95
Using 1-2-3 for the Mac ..................................................................... $24.95
Using AppleWorks, 3rd Edition ......................................................... $24.95
Using Excel 3 for the Macintosh ........................................................ $24.95
Using FileMaker Pro .......................................................................... $24.95
Using MacDraw Pro ........................................................................... $24.95
Using MacroMind Director ................................................................ $29.95
Using MacWrite Pro .......................................................................... $24.95
Using Microsoft Word 5 for the Mac ................................................. $27.95
Using Microsoft Works: Macintosh Version,
2nd Edition ....................................................................................... $24.95
Using Microsoft Works for the Mac .................................................. $24.95
Using PageMaker 4 for the Macintosh ............................................... $24.95
Using Quicken 3 for the Mac ............................................................. $19.95
Using the Macintosh with System 7 ................................................... $24.95
Using Word for the Mac, Special Edition .......................................... $24.95
Using WordPerfect 2 for the Mac ...................................................... $24.95
Word for the Mac Quick Reference ................................................... $ 9.95
Programming/Technical
Borland C++ 3 By Example ............................................................... $21.95
Borland C++ Programmer's Reference .............................................. $29.95
C By Example .................................................................................... $21.95
C Programmers Toolkit, 2nd Edition ................................................ $39.95
Clipper Programmer's Reference ....................................................... $29.95
DOS Programmers Reference, 3rd Edition ....................................... $29.95
FoxPro Programmer's Reference ........................................................ $29.95
Network Programming in C ............................................................... $49.95
Paradox Programmer's Reference ...................................................... $29.95
Programming in Windows 3.1 ........................................................... $39.95
QBasic By Example ........................................................................... $21.95
Turbo Pascal 6 By Example ............................................................... $21.95
Turbo Pascal 6 Programmer's Reference ........................................... $29.95
UNIX Programmers Reference ......................................................... $29.95
UNIX Shell Commands Quick Reference ......................................... $ 8.95
Using Assembly Language, 2nd Edition ............................................ $29.95
Using Assembly Language, 3rd Edition ............................................ $29.95
Using BASIC ..................................................................................... $24.95
Using Borland C++ ............................................................................ $29.95
Using Borland C++ 3, 2nd Edition .................................................... $29.95
Using C............................................................................................... $29.95
Using Microsoft C .............................................................................. $29.95
Using QBasic ..................................................................................... $24.95
Using QuickBASIC 4 ......................................................................... $24.95
Using QuickC for Windows ............................................................... $29.95
Using Turbo Pascal 6, 2nd Edition .................................................... $29.95
Using Turbo Pascal for Windows ...................................................... $29.95
Using Visual Basic ............................................................................. $29.95
Visual Basic by Example ................................................................... $21.95
Visual Basic Programmer's Reference ............................................... $29.95
Windows 3.1 Programmer's Reference .............................................. $39.95
For More Information,
Call Toll Free!
1-800-428-5331
All prices and titles subject to change without notice.
Non-U.S. prices may be higher. Printed in the U.S.A.
Spreadsheets
1-2-3 Beyond the Basics .................................................................... $24.95
1-2-3 for DOS Release 2.3 Quick Reference ..................................... $ 9.95
1-2-3 for DOS Release 2.3 QuickStart ............................................... $19.95
1-2-3 for DOS Release 3.1+ Quick Reference ................................... $ 9.95
1-2-3 for DOS Release 3.1+ QuickStart ............................................ $19.95
1-2-3 for Windows Quick Reference ................................................. $ 9.95
1-2-3 for Windows QuickStart ........................................................... $19.95
1-2-3 Personal Money Manager ......................................................... $29.95
1-2-3 Power Macros ........................................................................... $39.95
1-2-3 Release 2.2 QueCards ............................................................... $19.95
Easy 1-2-3 .......................................................................................... $19.95
Easy Excel .......................................................................................... $19.95
Easy Quattro Pro ................................................................................ $19.95
Excel 3 for Windows QuickStart ....................................................... $19.95
Excel for Windows Quick Reference ................................................. $ 9.95
Look Your Best with 1-2-3 ................................................................ $24.95
Quatrro Pro 3 QuickStart ................................................................... $19.95
Quattro Pro Quick Reference ............................................................. $ 9.95
Using 1-2-3 for DOS Release 2.3, Special Edition ............................ $29.95
Using 1-2-3 for Windows ................................................................... $29.95
Using 1-2-3 for DOS Release 3.1+, Special Edition .......................... $29.95
Using Excel 4 for Windows, Special Edition ..................................... $29.95
Using Quattro Pro 4, Special Edition ................................................. $27.95
Using Quattro Pro for Windows ........................................................ $24.95
Using SuperCalc5, 2nd Edition .......................................................... $29.95
Databases
dBASE III Plus Handbook, 2nd Edition ............................................ $24.95
dBASE IV 1.1 Qiuck Reference ........................................................ $ 9.95
dBASE IV 1.1 QuickStart .................................................................. $19.95
Introduction to Databases ................................................................... $19.95
Paradox 3.5 Quick Reference ............................................................. $ 9.95
Paradox Quick Reference, 2nd Edition .............................................. $ 9.95
Using AlphaFOUR ............................................................................. $24.95
Using Clipper, 3rd Edition ................................................................. $29.95
Using DataEase .................................................................................. $24.95
Using dBASE IV ................................................................................ $29.95
Using FoxPro 2 .................................................................................. $29.95
Using ORACLE ................................................................................. $29.95
Using Paradox 3.5, Special Edition .................................................... $29.95
Using Paradox for Windows .............................................................. $26.95
Using Paradox, Special Edition .......................................................... $29.95
Using PC-File ..................................................................................... $24.95
Using R:BASE ................................................................................... $29.95
Business Applications
CheckFree Quick Reference .............................................................. $ 9.95
Easy Quicken ..................................................................................... $19.95
Microsoft Works Quick Reference .................................................... $ 9.95
Norton Utilities 6 Quick Reference .................................................... $ 9.95
PC Tools 7 Quick Reference .............................................................. $ 9.95
Q&A 4 Database Techniques ............................................................. $29.95
Q&A 4 Quick Reference .................................................................... $ 9.95
Q&A 4 QuickStart .............................................................................. $19.95
Q&A 4 Que Cards .............................................................................. $19.95
Ques Computer Users Dictionary, 2nd Edition ............................... $10.95
Ques Using Enable ............................................................................ $29.95
Quicken 5 Quick Reference ............................................................... $ 9.95
SmartWare Tips, Tricks, and Traps, 2nd Edition ............................... $26.95
Using DacEasy, 2nd Edition .............................................................. $24.95
Using Microsoft Money ..................................................................... $19.95
Using Microsoft Works: IBM Version .............................................. $22.95
Using Microsoft Works for Windows, Special Edition ..................... $24.95
Using MoneyCounts ........................................................................... $19.95
Using Pacioli 2000 ............................................................................. $19.95
Using Norton Utilities 6 ..................................................................... $24.95
Using PC Tools Deluxe 7 ................................................................... $24.95
Using PFS: First Choice ..................................................................... $22.95
Using PFS: WindowWorks ................................................................ $24.95
Using Q&A 4 ..................................................................................... $27.95
Using Quicken 5 ................................................................................. $19.95
Using Quicken for Windows .............................................................. $19.95
Using Smart ........................................................................................ $29.95
Using TimeLine ................................................................................. $24.95
Using TurboTax: 1992 Edition .......................................................... $19.95
CAD
AutoCAD Quick Reference, 2nd Edition ........................................... $ 8.95
Using AutoCAD, 3rd Edition ............................................................. $29.95
Word Processing
Easy WordPerfect ............................................................................... $19.95
Easy WordPerfect for Windows ......................................................... $19.95
More By Example Books From Que
To Order, Call: (800) 428-5331
OR (317) 573-2500
C By Example
Greg Perry
This is the best way to learn C outside
the classroom! Short chapters help
beginners learn the language one
small step at a time.
Version 1.0
$21.95 USA
0-88022-813-X, 650 pp., 7
3
/8 9
1
/4
Learn programming
By Example with Que!
QBasic By Example
Version 1.0
$21.95 USA
0-88022-811-3, 650 pp., 7
3
/8 x 9
1
/4
Turbo C++ By Example
Version 3
$21.95 USA
0-88022-812-1, 650 pp., 7
3
/8 x 9
1
/4
Turbo Pascal by Example
Version 6
$21.95 USA
0-88022-908-X, 650 pp., 7
3
/8 x 9
1
/4
Visual Basic By Example
Version 1
$21.95 USA
0-88022-904-7, 650 pp., 7
3
/8 x 9
1
/4