Search:

dear, in both version of program, u are allocating different amount of memory to 'buf', in firts version static memory of 80 bytes is being allocated while in second one it's only 20...

yaah..!!!!........ memory has not been allocated

yep.............it looks reasonable.....................but implementation could be more simpler

have a try with the following sequence


unsigned char p=170;
p=~p;
p=p<<4;
p=p>>4;
printf("&#37;d \n",p);

Ohhh.........i got it buddy..u are right......................

Hi dear, in ur code i really don't understand how can u achieve ur desired parallelogram. Please see my code below to print a parellogram as u need. Hope, it will work out.....................

...

[QUOTE=shardin;673572]
struct student{
char ime[20];
int mbr;
struct student *next;
};


Ok i understand it..as earlier u have considered it a sorted list. Please see my function to insert ...

memory 4 the each node will be allocated separately and if u are freeing only root node,then only node is getting freed and memory 4 the others node is still allocated

Plz write down the elements of structure to understand it easily. I really don't understand...why are u comparing an int with a pointer?