Tracing While Loops 7 January 2019 OSU CSE 1 Consider... int i = - - PowerPoint PPT Presentation

▶
tracing while loops
SMART_READER_LITE
LIVE PREVIEW

Tracing While Loops 7 January 2019 OSU CSE 1 Consider... int i = - - PowerPoint PPT Presentation

Jan 10, 2024 162 likes •370 views

Tracing While Loops 7 January 2019 OSU CSE 1 Consider... int i = 4, j = 1, n = 0; while (i > j) { if (n % 2 == 0) { i--; } else { j++; } n++; } 7 January 2019 OSU CSE 2 Trace It int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while

slide-1
SLIDE 1

Tracing While Loops

7 January 2019 OSU CSE 1

slide-2
SLIDE 2

Consider...

int i = 4, j = 1, n = 0; while (i > j) { if (n % 2 == 0) { i--; } else { j++; } n++; }

7 January 2019 OSU CSE 2

slide-3
SLIDE 3

Trace It

7 January 2019 OSU CSE 3

int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while (i > j) { if (n % 2 == 0) { i--; } else { j++; } n++; }

slide-4
SLIDE 4

Trace It

7 January 2019 OSU CSE 4

int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while (i > j) { i = 4 j = 1 n = 0 if (n % 2 == 0) { i--; } else { j++; } n++; }

slide-5
SLIDE 5

Trace It

7 January 2019 OSU CSE 5

int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while (i > j) { i = 4 j = 1 n = 0 if (n % 2 == 0) { i = 4 j = 1 n = 0 i--; } else { j++; } n++; }

slide-6
SLIDE 6

Trace It

7 January 2019 OSU CSE 6

int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while (i > j) { i = 4 j = 1 n = 0 if (n % 2 == 0) { i = 4 j = 1 n = 0 i--; i = 3 j = 1 n = 0 } else { j++; } n++; }

slide-7
SLIDE 7

Trace It

7 January 2019 OSU CSE 7

int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while (i > j) { i = 4 j = 1 n = 0 if (n % 2 == 0) { i = 4 j = 1 n = 0 i--; i = 3 j = 1 n = 0 } else { i = — j = — n = — j++; i = — j = — n = — } i = 3 j = 1 n = 0 n++; }

slide-8
SLIDE 8

Trace It

7 January 2019 OSU CSE 8

int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while (i > j) { i = 4 j = 1 n = 0 if (n % 2 == 0) { i = 4 j = 1 n = 0 i--; i = 3 j = 1 n = 0 } else { i = — j = — n = — j++; i = — j = — n = — } i = 3 j = 1 n = 0 n++; i = 3 j = 1 n = 1 }

slide-9
SLIDE 9

Trace It

7 January 2019 OSU CSE 9

int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while (i > j) { i = 4 3 j = 1 1 n = 0 1 if (n % 2 == 0) { i = 4 j = 1 n = 0 i--; i = 3 j = 1 n = 0 } else { i = — j = — n = — j++; i = — j = — n = — } i = 3 j = 1 n = 0 n++; i = 3 j = 1 n = 1 }

slide-10
SLIDE 10

Trace It

7 January 2019 OSU CSE 10

int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while (i > j) { i = 4 3 j = 1 1 n = 0 1 if (n % 2 == 0) { i = 4 — j = 1 — n = 0 — i--; i = 3 — j = 1 — n = 0 — } else { i = — 3 j = — 1 n = — 1 j++; i = — j = — n = — } i = 3 j = 1 n = 0 n++; i = 3 j = 1 n = 1 }

slide-11
SLIDE 11

Trace It

7 January 2019 OSU CSE 11

int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while (i > j) { i = 4 3 j = 1 1 n = 0 1 if (n % 2 == 0) { i = 4 — j = 1 — n = 0 — i--; i = 3 — j = 1 — n = 0 — } else { i = — 3 j = — 1 n = — 1 j++; i = — 3 j = — 2 n = — 1 } i = 3 j = 1 n = 0 n++; i = 3 j = 1 n = 1 }

slide-12
SLIDE 12

Trace It

7 January 2019 OSU CSE 12

int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while (i > j) { i = 4 3 j = 1 1 n = 0 1 if (n % 2 == 0) { i = 4 — j = 1 — n = 0 — i--; i = 3 — j = 1 — n = 0 — } else { i = — 3 j = — 1 n = — 1 j++; i = — 3 j = — 2 n = — 1 } i = 3 3 j = 1 2 n = 0 1 n++; i = 3 j = 1 n = 1 }

slide-13
SLIDE 13

Trace It

7 January 2019 OSU CSE 13

int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while (i > j) { i = 4 3 j = 1 1 n = 0 1 if (n % 2 == 0) { i = 4 — j = 1 — n = 0 — i--; i = 3 — j = 1 — n = 0 — } else { i = — 3 j = — 1 n = — 1 j++; i = — 3 j = — 2 n = — 1 } i = 3 3 j = 1 2 n = 0 1 n++; i = 3 3 j = 1 2 n = 1 2 }

slide-14
SLIDE 14

Trace It

7 January 2019 OSU CSE 14

int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while (i > j) { i = 4 3 3 j = 1 1 2 n = 0 1 2 if (n % 2 == 0) { i = 4 — j = 1 — n = 0 — i--; i = 3 — j = 1 — n = 0 — } else { i = — 3 j = — 1 n = — 1 j++; i = — 3 j = — 2 n = — 1 } i = 3 3 j = 1 2 n = 0 1 n++; i = 3 3 j = 1 2 n = 1 2 }

slide-15
SLIDE 15

Trace It

7 January 2019 OSU CSE 15

int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while (i > j) { i = 4 3 3 j = 1 1 2 n = 0 1 2 if (n % 2 == 0) { i = 4 — 3 j = 1 — 2 n = 0 — 2 i--; i = 3 — j = 1 — n = 0 — } else { i = — 3 j = — 1 n = — 1 j++; i = — 3 j = — 2 n = — 1 } i = 3 3 j = 1 2 n = 0 1 n++; i = 3 3 j = 1 2 n = 1 2 }

slide-16
SLIDE 16

Trace It

7 January 2019 OSU CSE 16

int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while (i > j) { i = 4 3 3 j = 1 1 2 n = 0 1 2 if (n % 2 == 0) { i = 4 — 3 j = 1 — 2 n = 0 — 2 i--; i = 3 — 2 j = 1 — 2 n = 0 — 2 } else { i = — 3 j = — 1 n = — 1 j++; i = — 3 j = — 2 n = — 1 } i = 3 3 j = 1 2 n = 0 1 n++; i = 3 3 j = 1 2 n = 1 2 }

slide-17
SLIDE 17

Trace It

7 January 2019 OSU CSE 17

int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while (i > j) { i = 4 3 3 j = 1 1 2 n = 0 1 2 if (n % 2 == 0) { i = 4 — 3 j = 1 — 2 n = 0 — 2 i--; i = 3 — 2 j = 1 — 2 n = 0 — 2 } else { i = — 3 — j = — 1 — n = — 1 — j++; i = — 3 — j = — 2 — n = — 1 — } i = 3 3 2 j = 1 2 2 n = 0 1 2 n++; i = 3 3 j = 1 2 n = 1 2 }

slide-18
SLIDE 18

Trace It

7 January 2019 OSU CSE 18

int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while (i > j) { i = 4 3 3 j = 1 1 2 n = 0 1 2 if (n % 2 == 0) { i = 4 — 3 j = 1 — 2 n = 0 — 2 i--; i = 3 — 2 j = 1 — 2 n = 0 — 2 } else { i = — 3 — j = — 1 — n = — 1 — j++; i = — 3 — j = — 2 — n = — 1 — } i = 3 3 2 j = 1 2 2 n = 0 1 2 n++; i = 3 3 2 j = 1 2 2 n = 1 2 3 }

slide-19
SLIDE 19

Trace It

7 January 2019 OSU CSE 19

int i = 4, j = 1, n = 0; i = 4 j = 1 n = 0 while (i > j) { i = 4 3 3 j = 1 1 2 n = 0 1 2 if (n % 2 == 0) { i = 4 — 3 j = 1 — 2 n = 0 — 2 i--; i = 3 — 2 j = 1 — 2 n = 0 — 2 } else { i = — 3 — j = — 1 — n = — 1 — j++; i = — 3 — j = — 2 — n = — 1 — } i = 3 3 2 j = 1 2 2 n = 0 1 2 n++; i = 3 3 2 j = 1 2 2 n = 1 2 3 } i = 2 j = 2 n = 3

slide-20
SLIDE 20

What Does It Do?

  • Describe in one short sentence what the

snippet of code we just traced does.

  • Don’t repeat the code in English…

7 January 2019 OSU CSE 20