What symptoms are you seeing when using the recursive merge? Do you get a stack overflow again, or does it crash, or not sort correctly, or does the list lose some nodes or.? Note that the stability test isn't important, as it will sort just fine either way. I couldn't see anything wrong with you recursive merge so I threw it into my own sorting program which contains a basic testbed and initially it just failed the stability test, but after reversing the comparison and swapping the if and else clauses it passed all tests.
LINKED LIST STACK OVERFLOW UPDATE
Make sure you update those other sites to say what has been solved. Incidentally, posting on many forums is often frowned upon because some people might go to the effort of solving your problem only to find that it has already been answered elsewhere. If you take a quick look at my website (link in signature), you might see why I knew enough to help. While(head_two->get_next() != NULL & head_one != NULL)
If the stack is full, then the stack is said to be in Overflow condition.
Basic operations are performed in the stack are: Push: It adds an item in the stack. It can be implemented either by using arrays or linked lists. While(head_one->get_next() != NULL & head_two != NULL) Stack is a linear data structure which follows LIFO(Last In First Out) or FILO(First In Last Out) order to perform its functions. Head_one->set_next(head_two->get_next()) If(*(head_two->get_next()->get_data()) get_data())) Weve cooked up some examples of how you could use the stack-overflow icon in your projects. Head_two->set_next(head_one->get_next()) An admin of the team can also perform this. Node* LinkedList::merge(Node* head_one, Node* head_two) The owner of a question or answer can delete their own post by using the Delete link at the bottom of their post. Return merge(merge_sort(head_one), merge_sort(head_two)) While ((head_two != NULL) & (head_two->get_next() != NULL))
0 kommentar(er)
