hi,im new around.. im a freshman studying cs..(c language).. im sitting on a program for over 6 hours and im sure theres a pretty simple/sleek/fast soultion. i have 2 sorted link lists which i need to combine into 1 sorted linked list(without generating a new linked list)in other words i need to merge them. what I mean is lets say ive got an input that looks like this: first linked list - 1,3,5(1->3->5) second linked list-2,4,6(2->4->6) i need to change the pointers so that after my input goes through the function i will get an output of (1->2->3->4->5->6).(-> is a pointer for those who didnt get it). i need to change the "next" pointer of each node. ive got the program running on some of my inputs but its pretty sloppy and doesn't work for most inputs. ive searched the web and found some codes that are similiar but not exactly what i need to do.. i really need help(hope there are pros out here).. thanks alot..looking forward for helping here too.