반절 찾기 와 순서 찾기

절반 으로 찾기 (2 점):

#include 
#include 
#define MAX_NUM 100
typedef struct
{
    int key;
} ElemType;
typedef struct
{
    ElemType elem[MAX_NUM];
    int length;
} SSTable;
int s(SSTable st,int key)
{
    int i;
    int ans=0;
    int l=1,r=st.length,mid=0;
    while (l<=r)
    {
        mid=(l+r)/2;
        ans++;
        if (key>st.elem[mid].key)
            l=mid+1;
        else if (key1;
        else
        {
            printf("    ：%d
",ans);
            return mid;
        }
    }
    printf("    ：%d
",ans);
    return 0;
}
int main()
{
    int n,i,t;
    SSTable st;
    scanf("%d",&n);
    st.length=n;
    for (i=1; i<=n; i++)
        scanf("%d",&st.elem[i].key);
    scanf("%d",&t);
    t=s(st,t);
    if (t==0)
        printf("         
");
    else printf("       ：%d
",t);
    return 0;
}

순서 찾기:

#include 
#include 
#define MAX_NUM 100
typedef struct
{
    int key;
} ElemType;
typedef struct
{
    ElemType elem[MAX_NUM];
    int length;
} SSTable;
int s(SSTable st,int key)
{
    int i;
    int ans=0;
    st.elem[0].key=key;
    for (i=st.length; i>=1; i--)
    {
        ans++;
         if (st.elem[i].key==key)
         {
             printf("    ：%d
",ans);
             return i;
         }
    }
    printf("    ：%d
",st.length);
    return 0;
}
int main()
{
    int n,i,t;
    SSTable st;
    scanf("%d",&n);     //       
    st.length=n;
    for (i=1; i<=n; i++)
        scanf("%d",&st.elem[i].key);
    scanf("%d",&t);
    t=s(st,t);
    if (t==0)
        printf("         
");
    else printf("       ：%d
",t);
    return 0;
}