Ἰούλιος | 2009 | ++codemasters

Archive for Ἰούλιος 2009

Stack Implementation (C++ Language)

Το πρόγραμμα αυτό υλοποιεί την δομή της στοίβας (LIFO= Last In First Out) με δυναμικό τρόπο. Μπορεί να λειτουργήσει και ως παράδειγμα χρησιμοποιήσης δεικτών τόσο στην C όσο και στην C++ ενώ μπορεί να κατανοήσει κανείς το πότε έχουμε κλήση κατ’ αναφορά (Call by Reference) και πότε κλήση κατα τιμή (Call by Value).

Author: filotass || E-mail: filotass@gmail.com

<pre style=’color:#000000;background:#ffffff;’>#include <stdio.h> //Library for I/O
#include <malloc.h> //Library for dynamic memory structures

//Operations that can be executed on the Heap structure
void setStackProperties(int* &stack, int& max_size, int& n);
void showStack(int* stack, int n, int max_size);
void push (int* &stack, int& n, int max_size);
void pop(int* &stack, int& n);

//Main program
int main(void)
{
int* stack; //stack (dynamic) structure
int max_size; //max capacity of items on stack
int n; //current number of items on stack
int selection; //variable that stores the user’s selection

setStackProperties(stack,max_size,n);
printf(”1.Insert Item\n2.Export Item\n3.Show stack\n4.Reset stack\n5.Exit\n”);
do{
printf(”>:”);
scanf(”%d”,&selection);

if (selection==1) {
push(stack,n, max_size);
}else if(selection==2){
pop(stack,n);
}else if(selection==3){
showStack(stack,n,max_size);
}else if(selection==4){
free(stack);
setStackProperties(stack,max_size,n);
}
}
while (selection!=5);
return 0;
}

//Implementation of the operations that can be executed on a stack
//Hint: Wherever you see the “&” operator it is a Call by Reference
//otherwise it is a Call by Value and the variable is being duplicated

void setStackProperties(int* &stack, int& max_size, int& n)
{
n=0;
printf(”Give size of stack (max):”);
do{
scanf(”%d”,&max_size);
if (max_size <= 0)
printf(”Give a positive integer:”);
}while (max_size<=0);
stack = (int*) calloc (max_size, sizeof(int));
if (stack==NULL) exit (1);
}

void showStack(int* stack, int n,int max_size)
{
int i;

for(i=0;i<n;i++)
printf(”%d ”, stack[i]);
for(i=n;i<max_size;i++)
printf(”_ ”);
printf(”\n”);
}

void push (int* &stack, int& n, int max_size)
{
int item;

if (n < max_size){
printf(”Give Item: ”);
scanf(”%d”,&item);
stack[n]=item;
n+=1;
}else{
printf(”The stack is Full!\n”);
}
}

void pop(int* &stack, int& n)
{
int item;

if (n>0){
n-=1;
item = stack[n];
printf(”Exported Item: %d\n”,item);
}else{
printf(”Empty stack\n”);
}
}
</pre>

#include <stdio.h> //Library for I/O
#include <malloc.h> //Library for dynamic memory structures

//Operations that can be executed on the Stack structure
void setStackProperties(int* &stack, int& max_size, int& n);
void showStack(int* stack, int n, int max_size);
void push (int* &stack, int& n, int max_size);
void pop(int* &stack, int& n);

//Main program
int main(void)
{
    int* stack; //stack (dynamic) structure
    int max_size; //max capacity of items on stack
    int n;    //current number of items on stack
    int selection;    //variable that stores the user's selection

    setStackProperties(stack,max_size,n);
    printf("1.Insert Item\n2.Export Item\n3.Show stack\n4.Reset stack\n5.Exit\n");
    do{
        printf(">:");
        scanf("%d",&selection);

        if (selection==1) {
            push(stack,n, max_size);
        }else if(selection==2){
            pop(stack,n);
        }else if(selection==3){
            showStack(stack,n,max_size);
        }else if(selection==4){
            free(stack);
            setStackProperties(stack,max_size,n);
        }
    }
    while (selection!=5);
    return 0;
}

//Implementation of the operations that can be executed on a stack
//Hint: Wherever you see the "&" operator it is a Call by Reference
//otherwise it is a Call by Value and the variable is being duplicated

void setStackProperties(int* &stack, int& max_size, int& n)
{
    n=0;
    printf("Give size of stack (max):");
    do{
        scanf("%d",&max_size);
        if (max_size <= 0)
            printf("Give a positive integer:");
    }while (max_size<=0);
    stack = (int*) calloc (max_size, sizeof(int));
    if (stack==NULL) exit (1);
}

void showStack(int* stack, int n,int max_size)
{
    int i;

    for(i=0;i<n;i++)
        printf("%d ", stack[i]);
    for(i=n;i<max_size;i++)
        printf("_ ");
    printf("\n");
}

void push (int* &stack, int& n, int max_size)
{
    int item;

    if (n < max_size){
        printf("Give Item: ");
        scanf("%d",&item);
        stack[n]=item;
        n+=1;
    }else{
        printf("The stack is Full!\n");
    }
 }

void pop(int* &stack, int& n)
{
    int item;

    if (n>0){
        n-=1;
        item = stack[n];
        printf("Exported Item: %d\n",item);
    }else{
        printf("Empty stack\n");
    }
}

Written by c0demasters

Ἰούλιος 28, 2009 at 4:54 μ.μ.

Ἀναρτήθηκε ὡς Ἄνευ κατηγορίας

Δ	Τ	Τ	Π	Π	Σ	Κ
		1	2	3	4	5
6	7	8	9	10	11	12
13	14	15	16	17	18	19
20	21	22	23	24	25	26
27	28	29	30	31

++codemasters

Archive for Ἰούλιος 2009

Stack Implementation (C++ Language)

Πρόσφατες αναρτήσεις

Blogroll

Ημερολόγιο

Αρχείο (Log)

Ἐνημέρωση μέσῳ ἠλ. ταχυδρομείου