NODEPTR krev(NODEPTR head,int k)
{
NODEPTR current=head;
NODEPTR prev=NULL;
NODEPTR next;
int cnt=0;
while(current!=NULL&&cnt<k)
{
next=current->next;
current->next=prev;
prev=current;
current=next;
cnt++;
}if(head!=NULL) head->next=krev(current,k); return prev; } here k=2 -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
