Subj : stack question...?
To   : borland.public.cpp.borlandcpp
From : mujeebrm
Date : Thu Sep 15 2005 10:54 pm

/* prac2.c, n=size of stack, pc=push counter */

int *stk=0, n=0, pc=0;
/* how can make my this simple
stack implementation
global variables free or more efficient */

initstk()
{
  int x=0;

  printf("stack size ? ");
  scanf("%d", &n);

  if(n==0)
  {
   puts("stack size 0 entered!");
   exit(1);
  }

  stk = malloc(n * sizeof(int) );

  if(!stk)
  {
   puts("out a memory!");
   exit(1);
  }

  for(x=0; x<n; x++)
   *(stk + x) = 0;
}

freestk()
{
  free(stk);
}

push(int x)
{
  *(stk+pc) = x;
  pc++;
}

pop()
{
  *(stk+pc) = 0;
  pc--;
}

show()
{
  int x;
  for(x=0; x<pc; x++)
   printf(" %d ", *(stk+x) );

  printf("\n");
}

size()
{

  printf("stack size : %d\nelements in stack :%d",  sizeof(pc)*pc, pc  );

}


main()
{
  int x=0;

  clrscr();

  initstk(n);

  for(x=0; x<n; x++)
   push(x);

  show();

  size();

  pop();
  pop();
  pop();

  show();

  size();


  getch();

  freestk();
}


thanx a lot,

mujeebrm

.