Thread: recursion in C, need some help

I want to create a recursion function that will allow me to do this:

Say I have a string:

Name: John Micky

and another String

John : Sarah

another String

Micky : Hubert

As we can see above because John is associated with Sarah I want to get to the string Sarah from John

The same case for Micky, Micky has an association wih Hubert..

so this is how I want it to be:

I have an array that contains the value John and Micky

I also have another array that has the value John and Sarah

when I access to John I want to get to Sarah and after I found Sarah, i wan't to be able to backtrack and go to Micky and find the association with Micky..

how do I do this?

Sounds like a graph. The strings would be your nodes and the connections your edges.

Or if there's always one in-link and one out-link, a doubly-linked list.

hmm..actually I have stored this in a hash table.. Name is the key, the value of the key is John and Micky

John is the key Sarah is the value and also Micky is the key with Hubert as the value

so for the example above there are three keys

Maybe I'm misunderstanding, but John and Micky wasn't a relationship? Just a list to parse through. If all the relationships are one-way, then a hash-table should work.

no John and Micky are different individuals