And this works (at least I believe so).
Maybe it could be done more elegant.
It was not a trivial job for me and it took me some ( and lot of seg. faults) time to figure this out.
Recently I implemented iterative functions for tree traversal and it was hard job (for me) too.
What I concluded is that converting from recursive to iterative is a hard work.
What is your experience?
Is there any formal technique or general rules how to approach this problem?
Do you have any advices regarding this example or in general?

If you want the simpliest way to split a linked list in half without worry about runtime is to simply count how many nodes are in the list. This can be done with a simple for loop say.

Code:

for(i = 0; pTemp != NULL; i++)
{pTemp = pTemp->next;}

then divide that number by 2 and using another for loop proceed to the node in that position. save the node its next is pointing to and then set it to null and return the new lists beginning node. That is the simpliest way it can be done in my view.

If you want the simpliest way to split a linked list in half without worry about runtime is to simply count how many nodes are in the list. This can be done with a simple for loop say.

Code:

for(i = 0; pTemp != NULL; i++)
{pTemp = pTemp->next;}

then divide that number by 2 and using another for loop proceed to the node in that position. save the node its next is pointing to and then set it to null and return the new lists beginning node. That is the simpliest way it can be done in my view.

Yes, but in that case results would differ from recursive implementation.

As you can see I convert recursive implementation to iterative.
Whole idea is to achive same result with iteration instead recursion

Thank you master quzah, but I wanted to see how he could handle this. I post prototype hoping he'll ask to change it to

Code:

node* split(node** list);

or the way you suggested it.
So return is right (left) sublist, while list become left (right) sublist.
I hope he would do this to reward him with good start rep points, but anyway thanks.
How about my question about experience with converting recursion to iteration?