zoukankan      html  css  js  c++  java
  • malloc & free

    动态分配内存

    #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()
    {
        int *array;
        int n_value;
        int i;
        printf("How many values are there?
    ");
    
        if(scanf("%d",&n_value)!=1 || n_value<0)
        {
            printf("Illegal numbers of values.
    ");
            exit(EXIT_FAILURE);
        }
    
        array = (int *)malloc(n_value*sizeof(int));
        if(NULL == array)
        {
            printf("Cant get memery for that many values.
    ");
            exit(EXIT_FAILURE);
        }
        
        for(i = 0;i<n_value;i++)
        {
            printf("?");
            if(scanf("%d",array+i)!=1)
            {
                printf("Error reading value #%d.
    ",i);
                exit(EXIT_FAILURE);
            }
        }
        qsort(array,n_value,sizeof(int),compare_integers);
    
        for(i = 0;i<n_value;i++)
        {
            printf("%d ",array[i]);
        }
    
        free(array);
        return EXIT_SUCCESS;
    }
  • 相关阅读:
    JavaScript面试库
    JS事件委托的原理和应用
    缓存ABC
    网络模型探究
    持续集成配置之Nuget
    angular应用容器化部署
    微服务随想
    .NET性能优化小技巧
    博客园博客小优化
    Emmet 简介
  • 原文地址:https://www.cnblogs.com/plxx/p/3386116.html
Copyright © 2011-2022 走看看