CareerCup

shouldn't use recursion, because the stack would use too much memory.
I would do it with three pointers. Pseudo follows (assuming list ends when next points to null).

declare pointers curr, prev, next

set prev = null;
set curr = list_head;
do loop
  set next = curr->next
  set curr->next = prev
  set prev = curr
while curr != null

you forgot to add curr=next in the loop.

Hi
structure of the linklist

struct lnlst{
int info;
struct lnlst *next;
};



function to reverse using iteration:

struct lnlst* reverse(struct lnlst *ls)
{
struct lnlst *temp,*prev,*current;

prev=0;
temp=0;
current=ls;
while(current)
{
temp=current->next;
current->next=prev;
prev=current;
current=temp;
}
return(prev);
}

void reverse(struct nodes *head)
{
	struct nodes *prev, *now, *future;
	prev = head;
	now = prev->next;
	while(now)
	{
		future = now->next;
		now->next = prev;
		prev = now;
		now = future;
	}
	head->next = NULL;
	head = prev;
	display_list(head);
}

u could use recursion if u want to...
it's less efficient in memory...

node* reverse(node* list) {
node* pointer = list;
if(list->p_next!=NULL) {
pointer = reverse(list->p_next);
(list->p_next)->p_next = list;
list->p_next = NULL;
}

return pointer;
}