改进版：亚伯拉罕艾达方法
/* 01 */ /* code_003 */
/* 02 */ int index=0;
/* 03 */ char* vote((char*) candidate[])
/* 04 */ {/*0010*/
/* 05 */ (char*) well_known_candidate[2];
/* 06 */
/* 07 */ if (there_is_a_candidate_i_like == TRUE)
/* 08 */ return candidate[i_like];
/* 09 */ else
/* 10 */ {/*0020*/
/* 11 */ well_known_candidate[0] =
/* 12 */ the_1st_most_well_known(candidate);
/* 13 */ well_known_candidate[1] =
/* 14 */ the_2nd_most_well_known(candidate);
/* 15 */
/* 16 */ sort_by_name(well_known_candidate);
/* 17 */
/* 18 */ if (the_candidate_i_picked_in_last_election_became_a_president)
/* 19 */ {
/* 20 */ index = index;
/* 21 */ }
/* 22 */ else
/* 23 */ {
/* 24 */ index = (index + 1) & 1;
/* 25 */ }
/* 26 */ return well_known_candidate[index];
/* 27 */ }/*0020*/
/* 28 */ }/*0010*/
