zoukankan      html  css  js  c++  java
  • 动态内存分配输入整数并对其排序输出

    #include<stdio.h>
    #include<stdlib.h>
    
    int 
    compare_integers(void const *a, void const *b)
    {
        register int const *pa = a;
        register int const *pb = b;
        
        return *pa > *pb ? 1 :(*pa < *pb ? -1 : 0);
    }
    
    int
    main(void)
    {
        int *array;
        int n_values;
        int i;
        
        printf("How many values are there?");
        if(scanf("%d", &n_values) != 1 || n_values <=0){
            printf("Illegal number of values.
    ");
            exit(EXIT_FAILURE);
        }
        
        array = malloc(n_values * sizeof(int));
        if(array == NULL){
            printf("Can't get memory for that many values.
    ");
            exit(EXIT_FAILURE);
        }    
        
        for(i=0; i<n_values; i++){
            printf("?");
            if(scanf("%d", array+i) != 1){
                printf("Error reading value #%d
    ", i);
                free(array);
                exit(EXIT_FAILURE);
            }
        }
        
        qsort(array, n_values, sizeof(int), compare_integers);
        
        
        for(i=0;i<n_values;i++){
            printf("%d
    ", array[i]);
        }
        
        return EXIT_SUCCESS;
    }
  • 相关阅读:
    .net 有游戏框架了?庆祝下
    python爬虫解决gbk乱码问题
    N46期第10周作业
    N46期第四周作业
    N46期第三周作业
    N46期第九周作业
    月考
    第二阶段
    N46期第八周作业
    第七周
  • 原文地址:https://www.cnblogs.com/yshyee/p/3970686.html
Copyright © 2011-2022 走看看