Chapter 3 - Section 3.1 - Algorithms - Exercises - Page 202: 7

devising Algorithm that takes as input a list of n integers and finds the location of the last even integer in the list or returns 0 if there are no even integers in the list.

procedure: --- - last even location(a1,a2, . . . ,an: integers) -k := 0 -for i := 1 to n -if ai is even then k := i -return k {k = 0 if there are no evens}