link list reversl program

vijeesh_ep · 02-26-2005, 03:39 AM

hai
I am trying to develop a sigle link list reversl program in c .I want to do it like this

1)the function takes the address of the head node as the argument
2)it can use only one temp variable.
3)it must not use recursion
4)it must return the new address of the head node;

is there any chance of doing this?.plz guide me

acid_kewpie · 02-26-2005, 06:13 AM

and the chance of this even slightly not being homework from school / college is....?

please do not ask for solutions for work set as part of an educational program. if you have been paying attention and read the sources you should have been, you should have no problem in completing work set for you.

skoona · 02-26-2005, 08:06 PM

Quote:

Originally posted by vijeesh_ep
hai
I am trying to develop a sigle link list reversl program in c .I want to do it like this

1)the function takes the address of the head node as the argument
2)it can use only one temp variable.
3)it must not use recursion
4)it must return the new address of the head node;

is there any chance of doing this?.plz guide me

GLIB already does this. If you already have 'devhelp' on your system look at the glib reference manual for glib data types. "$yum install devhelp" will install this documentation tool for you. Or you can follow this link to learn more about glib's linked list support.

http://developer.gimp.org/api/2.0/gl...ata-types.html

They really have already figured it out.

95se · 02-27-2005, 12:17 AM

Think about it, a list like this:
a -> b -> c -> d
reversed is just
d -> c -> b -> a
i.e. every element just points to the element that was previously before it. This problem becomes very trivial if as you go through your list you just remember the previous element.