here is a code about a circularlinklist,which its nodes contain a number between 1 to 2048(first node contains

Question

1 and the lastnode contains 2048) and pointer P that refers to the last node...what does this code do?
while(p->next!=p){
p->next=p->next=->next;
p=p->next;
}
cout<< p->info;

Answer 1

if it was h->next wher h is a pointer to the node,instead of p(which is a pointer already pointin to the last node),n if we omit the 2nd line,then the code checks for the end of the linked list.Otherwise the code is wrong.it shld rather be...

while(h->next!=p){
h=h->next;
}
cout<< h->info;

but doin all this jus to print the info of the last node does not make any sense coz it cld be directy printed using p->info since p is alraedy pointin to the last node.


this makes only sense if u want to read the info of every node till u reach the end.(assumin h strts frm the strt node)


ps-if the above code is perfect then i think the code jus gets trapped into an infinite loop.ignoring the 2nd(p->next=p->next=->next;)of course...

Answer 2

it is just a piece of Scheme code, that gives the program instructions to do a command for more info if needed.