劍指 offer 關於年齡的排序

void sortage(int ages[],int length){

    if (ages==NULL || length <0){
        return;
    }
    int oldest = 99; 
    int array[oldest+1];
    for (int i =0; i<oldest;i++){
        array[i] = 0;
    }
    for (int j = 0; j<length; j++){
        int temp_age = ages[j];
        if(temp_age<0 ||temp_age>99){
            cout<<"wrong ages"<<endl;
        }
        array[temp_age] ++;

    }

    int index;
    for (int i = 0; i<oldest; i++){
        for (int j = 0; j<numbers; j++){
             ages[index] = i;
             index ++;

        }
    }
 



}