请写出对有序表进行折半查找的非递归算法.docxVIP

1. 请写出对有序表进行折半查找的非递归算法。 2. 试将上述算法改写成递归算法 #include stdio.h #include stdlib.h #define OK 1 #define ERROR 0 #define OVERFLOW -1 typedef int Status; typedef int ElemType; typedef struct{ ElemType int }SSTable; //有序表的定义 *elem; length; Status Binary_search(SSTable st, int key) { //非递归的折半查找 int low, mid, high; low = 0; high = st.length-1; while (low=high) { mid = (low+high)/2; if (key==st.elem[mid]) return mid; else if (keyst.elem[mid]) high = mid -1; else low = mid + 1; } return ERROR; {// 递归的Status Binary_search_recur(SSTable st, int low, int high, int key) {// 递归的 int mid= (low+high)/2; if (low