answersLogoWhite

0

To search for an element in a linked list, you iterate the list, looking for the element, and either return the element or an indication that it was not found. for (ptr = first; ptr != null; ptr = ptr.next) if (ptr.value == searchvalue) break; This will either leave ptr with the address of the found element, or null, if not found.

User Avatar

Wiki User

15y ago

What else can I help you with?

Related Questions

3 Write the algorithm of inserting an element at middle of a linked?

theory part to how u can insert element at middle of link list ?


Write a algorithm for doubly linked list in c?

sorry


How to write an actual algorithm for inserting an element in a linked list?

Insert newNode into a linked list after targetNode Node currentNode = root while currentNode != targetNode currentNode = currentNode.next newNode.next = currentNode.next currentNode.next = newNode


How do you write a Java program to implement weighted queue using circular doubly linked list?

Add weights to the elements of the queue and use an algorithm to sort the queue every time an element is added.


Write an algorithm for inserting an element in a circular linked list?

Given a currentNode pointer, perform the following steps: Create a newNode. Assign currentNode->next to newNode->next. Assign currentNode to newNode->prev. Assign newNode to currentNode->next.


Write an algorithm?

Algorithms are simply a set of steps to take in order to reach an answer. It is often linked with computer programming and can be written in plain english.


How do you write a algorithm of inserting an element at end of a linked list?

Algorithm to insert an element at the end of a linked listSpecial case: the list is empty.Create a new node for the element, assigning nullptr (0) to its next node.Assign the new node to the head of the list.Return a pointer to the new node and exit.All other cases: the list is not empty.Start at the head node (make it current).Repeat: while the current node has a next node, traverse to that node (make it current).Create a new node for the element, assigning nullptr (0) to its next node.Assign the new node as the current node's next node.Return a pointer to the new node and exit.


What is algorithm to write algorithm to the program to access a pointer variable in structure?

Here is the algorithm of the algorithm to write an algorithm to access a pointer in a variable. Algorithmically.name_of_the_structure dot name_of_the _field,eg:mystruct.pointerfield


Write an algorithm to find the root of quadratic equation?

Write an algorithm to find the root of quadratic equation


Write the Algorithm of inserting an element at middle of linked list?

I am telling you the algorithm of inserting an element at any location of simply link list:-insert_loc(start,item,loc)step1. [Check for overflow]if ptr=NULLthen print overflowexitelse[ptr=(node*) malloc (size of nodes)] {memory allocation}step2. set ptr->info=itemstep3. set i=1set temp=startstep4. Repeat step 5&6 until inextstep6. set i=i+1step7. set ptr->next=temp->nextstep8. set temp->next=ptrGood luckRjames007


A Write the algorithm to concatenate two given strings?

a write the algorithm to concatenate two given string


Write an algorithm and draw a corresponding flowchart to search a number in the given list of numbers and also display its position?

please give me an algorithm and a corresponding flow chart that displays list of numbers from 1 to 20.