I have a class named Contestant which holds all the info on a person playing a game. Then I have a game class for all the different games a contestant could be playing. My linked list in the game class is defined by the contestant class. I need to swap two players positions recursively in my linked list. I am given the member prototype as:
SwapContestantsR(string first_name_one, string last_name_one, string first_name_two, string last_name_two, ListNode* &node, ListNode** contestant_one, ListNode** contestant_two)
I understand I have two base cases. One, if I find both contestants, then swap. Two, if node=NULL then I have reached the end of my linked list and no contestant by either name exists. Otherwise I recurse by moving to the next node. I complete lost with the implementation and any help would be great.