a look back at arithmetic operators the increment and
play

A Look Back at Arithmetic Operators: the Increment and Decrement - PDF document

1/21/2016 A Look Back at Arithmetic Operators: the Increment and Decrement Spring Semester 2016 Programming and Data Structure 27 Increment (++) and Decrement (--) Both of these are unary operators; they operate on a single operand.


  1. 1/21/2016 A Look Back at Arithmetic Operators: the Increment and Decrement Spring Semester 2016 Programming and Data Structure 27 Increment (++) and Decrement (--) • Both of these are unary operators; they operate on a single operand. • The increment operator causes its operand to be increased by 1. – Example: a++, ++count • The decrement operator causes its operand to be decreased by 1. – Example: i--, --distance Spring Semester 2016 Programming and Data Structure 28 1

  2. 1/21/2016 • Operator written before the operand (++i, --i)) – Called pre-increment operator. Called pre increment operator. – Operator will be altered in value before it is utilized for its intended purpose in the program. • Operator written after the operand (i++, i--) – Called post-increment operator. – Operator will be altered in value after it is utilized for its intended purpose in the program. Spring Semester 2016 Programming and Data Structure 29 Examples Initial values :: a = 10; b = 20; x = 50 + ++a; x = 50 + ++a; a = 11 a = 11, x = 61 x = 61 x = 50 + a++; x = 60, a = 11 x = a++ + --b; b = 19, x = 29, a = 11 x = a++ – ++a; ; Undefined value (implementation ( p dependent) Called side effects:: while calculating some values, something else get changed. Spring Semester 2016 Programming and Data Structure 30 2

  3. 1/21/2016 Control Structures that Allow Repetition Spring Semester 2016 Programming and Data Structure 31 Types of Repeated Execution Types of Repeated Execution • Loop: Group of instructions that are executed repeatedly while some condition remains true. remains tr e How loops are controlled? Sentinel Sentinel Counter Counter Controlled Controlled Controlled Controlled Condition Condition Controlled Controlled 3

  4. 1/21/2016 • Counter-controlled repetition – Definite repetition – know how many times loop will execute. execute. – Control variable used to count repetitions. • Condition-controlled repetition – Loop executes as long as some specified condition is true. • Sentinel-controlled repetition p – Indefinite repetition. – Used when number of repetitions not known. – Sentinel value indicates “ end of data ”. Spring Semester 2016 Programming and Data Structure 33 Counter-controlled Repetition • Counter-controlled repetition requires – name of a control variable (or loop counter). name of a control variable (or loop counter). – initial value of the control variable. – condition that tests for the final value of the control variable (i.e., whether looping should continue). – increment (or decrement) by which the control ( ) y variable is modified each time through the loop. Spring Semester 2016 Programming and Data Structure 34 4

  5. 1/21/2016 Counter Controlled Loop Counter Controlled Loop Read 5 integers and display the value of their counter ← 1, sum ← 0 summation. ti false counter < 6 true int counter=1, sum=0; input n while (counter <6 ) { scanf (“%d”, &n); sum sum ← sum + n sum n sum = sum + n; + counter++; } counter++ printf (“\nSum is: %d”, output sum sum); int counter, sum=0; for (counter=1;counter<6; counter++) { scanf (“%d”, &n); sum = sum + n; } printf (“\nSum is: %d”, sum); Spring Semester 2016 Programming and Data Structure 36 5

  6. 1/21/2016 while Statement • The “while” statement is used to carry out looping operations, in which a group of statements is executed repeatedly, as long as statements is e ec ted repeatedl as long as some condition remains satisfied. while (condition) while (condition) { statement_to_repeat; statement_1; ... statement_N; } Spring Semester 2016 Programming and Data Structure 37 false C Single-entry / single-exit true structure statement(s) statement(s) Spring Semester 2016 Programming and Data Structure 38 6

  7. 1/21/2016 while :: Examples int digit = 0; int weight=100; while ( (digit <= 9) g ) while ( weight > 65 ) ( g ) printf (“%d \n”, digit++); { printf ("Go, exercise, "); printf ("then come back. \n"); printf ("Enter your weight:"); scanf ("%d", &weight); } Spring Semester 2016 Programming and Data Structure 39 Example: Sum of N Natural Numbers int main () { int N, count, sum; START scanf (“%d”, &N) ; sum = 0; READ N count = 1; 1 while (count <= N) { sum = sum + count; SUM = 0 COUNT = 1 count = count + 1; } printf (“Sum=%d\n”, sum); SUM = SUM + COUNT return 0; } COUNT = COUNT + 1 NO YES IS OUTPUT SUM COUNT > N? STOP 7

  8. 1/21/2016 Example: Maximum of inputs printf (“Enter positive numbers, end with -1.0\n”); max = 0.0; scanf(“%f”, &next); f(“%f” & t) while (next != -1.0) { if (next > max) max = next; scanf(“%f”, &next); } printf (“The maximum number is %f\n”, max) ; i f ( h i b i %f\ ) Example of Sentinel-controlled loop Inputs: 10 5 100 25 68 -1 do-while Statement • Similar to “while”, with the difference that the check for continuation is made at the end of each pass. d f h – In “while”, the check is made at the beginning . • Loop body is executed at least once . do do { statement_to_repeat; statement-1; while ( condition ); statement-2; statement-n; } while ( condition ); Spring Semester 2016 Programming and Data Structure 42 8

  9. 1/21/2016 statement(s) Single-entry / single-exit false structure C true Spring Semester 2016 Programming and Data Structure 43 do-while :: Examples int digit = 0; do printf (“%d \n”, digit++); while (digit <= 9); int weight; do { printf ("Go, exercise, "); printf ( Go, exercise, ); printf ("then come back. \n"); printf ("Enter your weight: "); scanf ("%d", &weight); } while (weight > 65 ) ; Spring Semester 2016 Programming and Data Structure 44 9

  10. 1/21/2016 for Statement • The “for” statement is the most commonly used looping structure in C. • General syntax : for (expression1; expression2; expression3) statement-to-repeat; for (expression1; expression2; expression3) { { statement_1; : statement_N; } Spring Semester 2016 Programming and Data Structure 45 • How it works? – “expression1” is used to initialize some variable (called index ) that controls the looping action. – “expression2” represents a condition that must be true for the loop to continue. – “expression3” is used to alter the value of the index initially assigned by “expression1”. int digit; int digit; for (digit=0; digit<=9;digit++) for (digit=9;digit>=0;digit--) printf (“%d \n”, digit); printf (“%d \n”, digit); Spring Semester 2016 Programming and Data Structure 46 10

  11. 1/21/2016 expression1 false expression2 Single-entry / single-exit true structure statement(s) t t t( ) expression3 Spring Semester 2016 Programming and Data Structure 47 for :: Examples int fact = 1, i, N; int sum = 0, N, count; scanf (“%d”, &N); ( , ); scanf (“%d”, &N); ( , ); for (i=1; i<=N; i++) for (i=1; i<=N, i++) fact = fact * i; sum = sum + i * i; printf (“%d \n”, fact); printf (“%d \n”, sum); Compute factorial Sum of squares of N natural numbers Spring Semester 2016 Programming and Data Structure 48 11

  12. 1/21/2016 2-D Figure Print * * * * * #define ROWS 3 #define COLS 5 #define COLS 5 * * * * * .... * * * * * for (row=1; row<=ROWS; row++) { for (col=1; col<=COLS; col++) { printf(“*”); } printf(“\n”); } Another 2-D Figure Print * #define ROWS 5 * * * * .... int row, col; * * * for (row=1; row<=ROWS; row++) { * * * * for (col=1; col<=row; col++) { * * * * * printf(“* ”); } printf(“\n”); } 12

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend