0'dan 9'a kadar olan sayıları tersten yazan değişik bir algoritma#include
#include
class stack{
private:
int sayi;
int veri[100];
public:
**** init()
{
sayi=0;
}
**** pop(int item)
{
veri[sayi]=item;
++sayi;
}
int push()
{
--sayi;
return veri[sayi];
}
};
struct link_list{
int number;
struct link_list *data;
};
main()
{
int i,k[15],j;
class stack ters;
struct link_list *ar,*da;
da=NULL;
for(i=0;inumber=i;
ar->data=da;
da=ar;
}
ters.init();
while(ar)
{
ters.pop(ar->number);
ar=ar->data;
}
j=0;
while(j
#include
class stack{
private:
int sayi;
int veri[100];
public:
**** init()
{
sayi=0;
}
**** pop(int item)
{
veri[sayi]=item;
++sayi;
}
int push()
{
--sayi;
return veri[sayi];
}
};
struct link_list{
int number;
struct link_list *data;
};
main()
{
int i,k[15],j;
class stack ters;
struct link_list *ar,*da;
da=NULL;
for(i=0;inumber=i;
ar->data=da;
da=ar;
}
ters.init();
while(ar)
{
ters.pop(ar->number);
ar=ar->data;
}
j=0;
while(j