最近學習資料結構，用C語言寫了棧的基本操作，卻發現在銷燬棧時，初始尺寸STACK_INIT_SIZE改成10，1000可以順利執行，改成100無法執行（編譯都沒問題），這讓我無法理解。下面是程式碼和執行的結果，希望有懂得朋友能幫助解釋下，是程式碼問題還是其他問題。

#include <stdio.h>
#include <stdlib.h>
#include <iostream>
using namespace std;

//STACK_INIT_SIZE改成10，1000可以順利執行，改成100無法執行!
#define STACK_INIT_SIZE 10 
#define STACK_INCREMENT 10
 

typedef int ElemType;
typedef int Status;

typedef struct{
    ElemType *base;
    ElemType *top;   //棧頂指向準備存放的位置
    int stackSize;   //當前可以使用的最大容量
}SqStack;

Status initStack(SqStack *s){
    s->base = (ElemType*)malloc(STACK_INIT_SIZE * sizeof(ElemType));
sizeof(SElemType)
    if(!(s->base)){
        return
 
 false;
    }
    s->top = s->base;
    s->stackSize = STACK_INIT_SIZE;
    return true;
}

Status push(SqStack *s,ElemType e){
    //如果棧滿(s->top - s->base = s->stackSize)，追加空間
    if(s->top - s->base >= s->stackSize){
        s->base = (ElemType*)realloc(s->base , (s->stackSize + STACK_INCREMENT) * sizeof
 
(ElemType));
        if(!(s->base)){
            return false;
        }
        s->top = s->base + s->stackSize ;              //設定棧頂
        s->stackSize = s->stackSize + STACK_INCREMENT; //設定棧的最大容量
    }
    //進棧時先存入資料於棧頂，棧頂指標再往後移
    *(s->top) = e;
    s->top ++;

    return true;
}

Status pop(SqStack *s , ElemType *e){
    //棧為空
    if(s->top == s->base){
        return false;
    }
    //出棧時棧頂指標先往前移，再取出棧頂資料
    (s->top)--;
    *e = *(s->top);
    return true;
}

int getCapacity(SqStack *s){
    return s->top - s->base;
}

Status clearStack(SqStack *s){
    s->top = s->base ;
    return true;
}

Status destroyStack(SqStack *s){
    s->top = s->base + s->stackSize;

    while(s->top != s->base){
        free(--s->top);           //執行到這程式停止！
        cout<<*(s->top)<<" ";
    }
    s->top = s->base = NULL;
    s->stackSize = 0;
    cout<<"\n";
    return true;
}

int main(int argc, char *argv[])
{
    SqStack s;
    initStack(&s);
    ElemType e = 1;
    ElemType elm;
    push(&s,e);
    e = 2;
    push(&s,e);
    e = 3;
    push(&s,e);
    e = 4;
    push(&s,e);
    e = 5;
    push(&s,e);
    e = 6;
    push(&s,e);
    pop(&s,&elm);
    cout<<elm<<" ";
    pop(&s,&elm);
    cout<<elm<<" ";
    pop(&s,&elm);
    cout<<elm<<" ";
    pop(&s,&elm);
    cout<<elm<<" ";
    pop(&s,&elm);
    cout<<elm<<"\n";
    cout<<"Capacity:"<<getCapacity(&s)<<"\n";
    clearStack(&s);
    cout<<"Capacity after clear the stack:"<<getCapacity(&s)<<"\n";
    destroyStack(&s);
    //cout<<getCapacity(&s)<<"\n";
    //cout<<clearStack(&s)<<"\n";
    return 0;
}

STACK_INIT_SIZE為10的執行結果，程式正常結束。

STACK_INIT_SIZE為100的執行結果，程式終止。

STACK_INIT_SIZE為1000的執行結果，程式正常結束。