2024-2-5-复习作业

1>

要求：

源代码：

#include 
#include 
#include 
typedef int datatype; 
typedef struct Node
{
    datatype data;
    struct Node *next;
}*node;
int prime(int m)
{
    for(int i=m;i>=2;i++)
    {
        int flag=0;
        for(int j=2;j<=sqrt(i);j++ )
        {
            if(i%j==0)
            {
                flag=-1;
                break;
            }
        }
        if(flag==0)
            return i;
    }
}
node create_node()
{
    node s=(node)malloc(sizeof(struct Node));
    if(s==NULL) return NULL;
    s->data=0;
    s->next=NULL;
    return s;
}
void hash_insert(int key,int p,node hash[])
{
    int index=key%p;
    //hash[index];//单链表的head
    node s=create_node();
    s->data=key;
    if(hash[index]==NULL)
        hash[index]=s;
    else
    {
        s->next=hash[index];
        hash[index]=s;
    }    
}
void output(node hash[],int m)
{
    for(int i=0;inext)
        // {  
        //     printf("%d: %-5d",i,j->data);
        // }
        printf("%d:",i);
        node p=hash[i];
        while(p!=NULL)
        {
            printf("%-5d",p->data);
            p=p->next;
        }
        puts("NULL");
    }
}
int search_hash(datatype key,int p,node hash[])
{
    int index=key%p;
    node head=hash[index];
    while(head!=NULL)
    {
        if(head->data==key) 
            return 0;        c
        head=head->next;    
    }
    return -1;
}

int main(int argc,const char *argv[])
{
    int arr[]={12,24,234,23,234,234,23};
    int arr_len=sizeof(arr)/sizeof(arr[0]);
    int m=arr_len*4/3;
    //初始化hash表
    node hash[m];
    for(int i=0;i

效果图:

2>

要求：

源代码:

#include c
#include 
int half_search(int key,int arr[],int low,int high)
{
    int mid;
        while(low<=high)
    {
        mid=(low+high)/2;
        if(arr[mid]key)
        {
            high=mid-1;
        }
    }
    return -1;
}
int main(int argc, char const *argv[])
{
    int mid,high,low;
    int arr[]={12,23,45,56,445,5676,6888};
    int len=sizeof(arr)/sizeof(arr[0]);
    printf("arr[] = ");
    for(int i=0;i

效果图: