1. Algorithm and Programming Branching Algorithm & C Program Control Dr. Ir. Riri Fitri Sari MM MSc International Class Electrical Engineering Dept University of Indonesia 23 February 2009

2. Branching No every lines are executed Only those that comply with the prerequisite (condition). The prerequisite consists of operans which is connected to the relational and logical operators

3. Branching Produce a boolean statement, with the value of true and false. Using the command: if_then_else

4. Branching START END condition Statement 1 Statement 2 –Example : 5 = 5  True 3 > 5  False 5 <> 3  True (A>5) AND (B>10)  True if both are true (A>5) OR (B>10)  True if both are true or one of the value is ture.

5. Branching Sample case: The average of positive numbers. Aim : –To calculate the average of some numbers entered through the keyboard (ended with entrance of the null value) –To show the frequency of positive number, total, and the average.

6. Branching Algorithm development Global Algorithm read (bil) while bil <> 0 do [added all the positive number and calculate the frequency of the positive number) read (bil) ewhile [write the frequency of the number, the total, and the average value]

7. Branching Algorithm development (cont’d) Flowchart with the branching command if-then-eif

8. Branching Number> 0 Total := Total + number n := n + 1 no yes

9. Branching Algorithm development (cont’d) Modify the global algorithm –variable n and total must be emptied

10. Branching If there is only the null number entered : Before write command check if n=0. If n=0 or no number entered except the end sign, do not perform the write command.

11. Branching Modification Algorithm : n := 0 total := 0 read (bil) while bil <> 0 do if bil > 0 then total := total + number n := n + 1 eif

12. Branching Modified algorithm: read (bil) ewhile if n <> 0 then write (n, total, total/n) eif

13. Branching Sample case “The largest number” endData := 0 read (bil) while bil <> endData do [check if the number is the largest number from all of the read number, write if so] read (bil) ewhile [write the largest number]

14. Branching –Algorithm Development : EndData := 0 read (bil) while bil <> EndData do if bil > maks then maks := bil eif read (bil) ewhile write (maks) –Is it true ?

15. Branching Discussion: –Variable maks should be given initial number to avoid mistakes. –Variabel maks should be filled in with the first number read from the keyboard.

16. Branching Algorithm becomes : EndData := 0 read (bil) maks := bil while bil <> EndData do if bil > maks then maks := bil eif read (bil) ewhile write (maks)

17. Branching How if the number entered is 0 ? What happened ? Correction ?

18. Branching Example “Odd and Even numbers” Aim: to make an algorithm which can state a number is odd or even.

19. Stages: –To define if a number is odd or even by dividing by 2 (mod). If the modulus is 0  Even number If not 0  Odd number

20. Branching Algorithm EndData : = 0 read(bil) while bil <> 0 do sisa :=bil mod 2 if sisa = 0 then write (‘even’) else write (‘odd’) eif read (bil) ewhile

21. Branching Example: “Square Root” Aim : to write a program to calculate the square root of the quadratic equation, in which the coefficient is entered from keyboard.

22. Branching Stages: –Select the wrong condition by checking the coefficient value. –To define the type of square root equation based on the equation.

23. Branching Algorithm: read(a) while a<>0 do read (b,c) d:=b^2-4*a*c continue

24. Branching if d<0 then {Calculate complex square root} p:= -b/(2*a) q: = abs (sqr(-d)/((2*a)) write (‘x1=‘, p, ‘+’, q, ‘i’) write (‘x2=‘, p, ‘-’, q, ‘i’) else continue

25. Branching {complex square root or not } if d=0 then {calculate twin square } x1:= -b/(2*a) x2 := x1

26. Branching else {Calculate not twin sqrt} x1:= (-b+sqr(d))/(2*a) x2 := (-b-sqr(d))/(2*a) eif write (‘x1=‘, x1) write (‘x2=‘,x2) eif read(a)

27. 27 C++ How to Program, Fifth Edition By H. M. Deitel - Deitel & Associates, Inc., P. J. Deitel - Deitel & Associates, Inc. Chapter 4 – C Program Control Outline 4.1Introduction 4.2The Essentials of Repetition 4.3Counter-Controlled Repetition 4.4The for Repetition Statement 4.5The for Statement: Notes and Observations 4.6Examples Using the for Statement 4.7The switch Multiple-Selection Statement 4.8The do…while Repetition Statement 4.9The break and continue Statements 4.10Logical Operators 4.11Confusing Equality (==) and Assignment (=) Operators 4.12Structured Programming Summary

28. 28 Objectives In this chapter, you will learn: –To be able to use the for and do … while repetition statements. –To understand multiple selection using the switch selection statement. –To be able to use the break and continue program control statements –To be able to use the logical operators.

29. 29 4.1 Introduction This chapter introduces –Additional repetition control structures for Do … while –switch multiple selection statement –break statement Used for exiting immediately and rapidly from certain control structures –continue statement Used for skipping the remainder of the body of a repetition structure and proceeding with the next iteration of the loop

30. 30 4.2The Essentials of Repetition Loop –Group of instructions computer executes repeatedly while some condition remains true Counter-controlled repetition –Definite repetition: know how many times loop will execute –Control variable used to count repetitions Sentinel-controlled repetition –Indefinite repetition –Used when number of repetitions not known –Sentinel value indicates "end of data"

31. 31 4.3Essentials of Counter- Controlled Repetition Counter-controlled repetition requires –The name of a control variable (or loop counter) –The initial value of the control variable –An increment (or decrement) by which the control variable is modified each time through the loop –A condition that tests for the final value of the control variable (i.e., whether looping should continue)

32. 32 4.3Essentials of Counter- Controlled Repetition Example: int counter = 1; // initialization while ( counter <= 10 ) { // repetition condition printf( "%d\n", counter ); ++counter; // increment } –The statement int counter = 1; Names counter Defines it to be an integer Reserves space for it in memory Sets it to an initial value of 1

33. Outline © Copyright 1992–2004 by Deitel & Associates, Inc. and Pearson Education Inc. All Rights Reserved. 33 fig04_01.c Program Output 1 2 3 4 5 6 7 8 9 10

34. 34 4.3Essentials of Counter- Controlled Repetition Condensed code –C Programmers would make the program more concise –Initialize counter to 0 while ( ++counter <= 10 ) printf( “%d\n, counter );

35. Outline © Copyright 1992–2004 by Deitel & Associates, Inc. and Pearson Education Inc. All Rights Reserved. 35 fig04_02.c

36. 36 4.4The for Repetition Statement

37. 37 4.4The for Repetition Statement Format when using for loops for ( initialization; loopContinuationTest; increment ) statement Example: for( int counter = 1; counter <= 10; counter++ ) printf( "%d\n", counter ); –Prints the integers from one to ten No semicolon ( ; ) after last expression

38. 38 4.4The for Repetition Statement For loops can usually be rewritten as while loops: initialization; while ( loopContinuationTest ) { statement; increment; } Initialization and increment –Can be comma-separated lists –Example: for (int i = 0, j = 0; j + i <= 10; j++, i++) printf( "%d\n", j + i );

39. 39 4.5The for Statement : Notes and Observations Arithmetic expressions –Initialization, loop-continuation, and increment can contain arithmetic expressions. If x equals 2 and y equals 10 for ( j = x; j <= 4 * x * y; j += y / x ) is equivalent to for ( j = 2; j <= 80; j += 5 ) Notes about the for statement: –"Increment" may be negative (decrement) –If the loop continuation condition is initially false The body of the for statement is not performed Control proceeds with the next statement after the for statement –Control variable Often printed or used inside for body, but not necessary

40. 40 4.5The for Statement : Notes and Observations counter = 1 counter <= 10 true false counter = 1 counter++ Establishinitial value of control variable Determine iffinal value of control variable has been reached Body of loop (this may be many statements) Increment the control variable printf( "%d", counter );

41. Outline © Copyright 1992–2004 by Deitel & Associates, Inc. and Pearson Education Inc. All Rights Reserved. 41 fig04_05.c Program Output Sum is 2550

42. Outline © Copyright 1992–2004 by Deitel & Associates, Inc. and Pearson Education Inc. All Rights Reserved. 42 fig04_06.c (Part 1 of 2)

43. Outline © Copyright 1992–2004 by Deitel & Associates, Inc. and Pearson Education Inc. All Rights Reserved. 43 fig04_06.c (Part 2 of 2) Program Output Year Amount on deposit 1 1050.00 2 1102.50 3 1157.63 4 1215.51 5 1276.28 6 1340.10 7 1407.10 8 1477.46 9 1551.33 10 1628.89

44. 44 4.7The switch Multiple- Selection Statement switch –Useful when a variable or expression is tested for all the values it can assume and different actions are taken Format –Series of case labels and an optional default case switch ( value ){ case '1': actions case '2': actions default: actions } –break; exits from statement

45. 45 4.7The switch Multiple- Selection Statement Flowchart of the switch statement true false...... case a case a action(s) break case b case b action(s) break false case z case z action(s) break true default action(s)

46. Outline © Copyright 1992–2004 by Deitel & Associates, Inc. and Pearson Education Inc. All Rights Reserved. 46 fig04_07.c (Part 1 of 3)

47. Outline © Copyright 1992–2004 by Deitel & Associates, Inc. and Pearson Education Inc. All Rights Reserved. 47 fig04_07.c (Part 2 of 3)

48. Outline © Copyright 1992–2004 by Deitel & Associates, Inc. and Pearson Education Inc. All Rights Reserved. 48 fig04_07.c (Part 3 of 3)

49. Outline © Copyright 1992–2004 by Deitel & Associates, Inc. and Pearson Education Inc. All Rights Reserved. 49 Program Output Enter the letter grades. Enter the EOF character to end input. a b c C A d f C E Incorrect letter grade entered. Enter a new grade. D A b ^Z Totals for each letter grade are: A: 3 B: 2 C: 3 D: 2 F: 1

50. 50 4.8The do … while Repetition Statement The do … while repetition statement –Similar to the while structure –Condition for repetition tested after the body of the loop is performed All actions are performed at least once –Format: do { statement ; } while ( condition );

51. 51 4.8The do … while Repetition Statement Example (letting counter = 1): do { printf( "%d ", counter ); } while (++counter <= 10); –Prints the integers from 1 to 10

52. 52 4.8The do … while Repetition Statement Flowchart of the do … while repetition statement true false action(s) condition

53. Outline © Copyright 1992–2004 by Deitel & Associates, Inc. and Pearson Education Inc. All Rights Reserved. 53 fig04_09.c Program Output 1 2 3 4 5 6 7 8 9 10

54. 54 4.9The break and continue Statements break –Causes immediate exit from a while, for, do … while or switch statement –Program execution continues with the first statement after the structure –Common uses of the break statement Escape early from a loop Skip the remainder of a switch statement

55. Outline © Copyright 1992–2004 by Deitel & Associates, Inc. and Pearson Education Inc. All Rights Reserved. 55 fig04_11.c Program Output 1 2 3 4 Broke out of loop at x == 5

56. 56 4.9The break and continue Statements continue –Skips the remaining statements in the body of a while, for or do … while statement Proceeds with the next iteration of the loop –while and do … while Loop-continuation test is evaluated immediately after the continue statement is executed –for Increment expression is executed, then the loop- continuation test is evaluated

57. Outline © Copyright 1992–2004 by Deitel & Associates, Inc. and Pearson Education Inc. All Rights Reserved. 57 fig04_12.c Program Output 1 2 3 4 6 7 8 9 10 Used continue to skip printing the value 5

58. 58 4.10Logical Operators && ( logical AND ) –Returns true if both conditions are true || ( logical OR ) –Returns true if either of its conditions are true ! ( logical NOT, logical negation ) –Reverses the truth/falsity of its condition –Unary operator, has one operand Useful as conditions in loops ExpressionResult true && falsefalse true || falsetrue !falsetrue

59. 59 4.10Logical Operators

60. 60 4.10Logical Operators

61. 61 4.11Confusing Equality ( == ) and Assignment ( = ) Operators Dangerous error –Does not ordinarily cause syntax errors –Any expression that produces a value can be used in control structures –Nonzero values are true, zero values are false –Example using == : if ( payCode == 4 ) printf( "You get a bonus!\n" ); Checks payCode, if it is 4 then a bonus is awarded

62. 62 4.11Confusing Equality ( == ) and Assignment ( = ) Operators –Example, replacing == with = : if ( payCode = 4 ) printf( "You get a bonus!\n" ); This sets payCode to 4 4 is nonzero, so expression is true, and bonus awarded no matter what the payCode was –Logic error, not a syntax error

63. 63 4.11Confusing Equality ( == ) and Assignment ( = ) Operators lvalues –Expressions that can appear on the left side of an equation –Their values can be changed, such as variable names x = 4; rvalues –Expressions that can only appear on the right side of an equation –Constants, such as numbers Cannot write 4 = x; Must write x = 4; –lvalues can be used as rvalues, but not vice versa y = x;

64. 64 4.12Structured- Programming Summary T F if statement (single selection) TF if … else statement (double selection) T F switch statement (multiple selection) break T F T F... Selection

65. 65 4.12Structured- Programming Summary Repetition T F do … while statement T F while statement T F for statement

66. 66 4.12Structured- Programming Summary Structured programming –Easier than unstructured programs to understand, test, debug and, modify programs Rules for structured programming –Rules developed by programming community –Only single-entry/single-exit control structures are used –Rules: 1.Begin with the “simplest flowchart” 2.Stacking rule: Any rectangle (action) can be replaced by two rectangles (actions) in sequence 3.Nesting rule: Any rectangle (action) can be replaced by any control structure (sequence, if, if … else, switch, while, do … while or for ) 4.Rules 2 and 3 can be applied in any order and multiple times

67. 67 4.12Structured- Programming Summary....... Rule 2 Rule 1 - Begin with the simplest flowchart Rule 2 - Any rectangle can be replaced by two rectangles in sequence

68. 68 4.12Structured- Programming Summary Rule 3 Rule 3 - Replace any rectangle with a control structure

69. 69 4.12Structured- Programming Summary

70. 70 4.12Structured- Programming Summary Figure 4.23 An unstructured flowchart.

71. 71 4.12Structured- Programming Summary All programs can be broken down into 3 controls –Sequence – handled automatically by compiler –Selection – if, if … else or switch –Repetition – while, do … while or for Can only be combined in two ways –Nesting (rule 3) –Stacking (rule 2) –Any selection can be rewritten as an if statement, and any repetition can be rewritten as a while statement