明解Ｃ言語 入門編 > 6. 関数 > 逐次探索 (番兵) Python # coding: Shift_JIS NINSU = 5 FAILED = -1 def search(ary, key, no): global FAILED ary.append(key) i = 0; while (True): if (ary[i] == key): break i += 1 if i == no: return FAILED return i…