Searching a circular linked list: Give a procedure in C, say ‘searchcircular (list,x) where the search stops when every element in the list has already been visited and the next node pointer points again to the first node that was earlier visited.

Where is your program? We are not going to write it for you. But as a hint: Save a copy of the initial node pointer so that as the program iterates through the nodes it knows where it started.

Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.