下面是实现折半查找的递归算法,low和high分别指向数组元素的低下标和高下标,若查找成功返回1,查找失败或其它错误则返回0,请把算法补齐。(每空2分,共10分)
typedef struct{ Key Type key; InfoType otherinfo; }NodeType; typedef )NodeType SeqList [n+1] ; int f ($eqList R, int low, inthigh, KeyType K) { int mid; if (low (1) high) return 0; mid=(2) if (R [mid] .key==K) return(3) if (R [mid] .key<K) f mid=(2) if (R [mid] .key==K) return(3) if (R [mid] .key<K) f((4)) else f ( (5)__ ); }