数组的查询

  • 有序数组查询


    #include <stdio.h>
    int main(){
        int nums[10] = {1, 10, 6, 296, 177, 23, 0, 100, 34, 999};
        int i, num, thisindex = -1;
       
        printf("Input an integer: ");
        scanf("%d", &num);
        for(i=0; i<10; i++){
            if(nums[i] == num){
                thisindex = i;
                break;
            }
        }
        if(thisindex < 0){
            printf("%d isn't  in the array.\n", num);
        }else{
            printf("%d is  in the array, it's index is %d.\n", num, thisindex);
        }
        return 0;
    }

无序数组查询


    #include <stdio.h>
    int main(){
        int nums[10] = {0, 1, 6, 10, 23, 34, 100, 177, 296, 999};
        int i, num, thisindex = -1;
       
        printf("Input an integer: ");
        scanf("%d", &num);
        for(i=0; i<10; i++){
            if(nums[i] == num){
                thisindex = i;
                break;
            }else if(nums[i] > num){
                break;
            }
        }
        if(thisindex < 0){
            printf("%d isn't  in the array.\n", num);
        }else{
            printf("%d is  in the array, it's index is %d.\n", num, thisindex);
        }
       
        return 0;
    }

 

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值