Linear Search applied to Linked List for Data Structure in 'C'

 Linear Search applied to Linked List

        In Linked List linear searching is nothing but finding a node with the given information for the presence. If it is present search is successful otherwise unsuccessful. Linked List supports only linear search. The main reason behind this is the inability of reaching any of the nodes directly except the first node. Only the address of the first node is always available in an external pointer. With the help of the first node only it is possible to reach the second node. Without the address of previous node one can not reach the next node. The next node’s address is always stored in previous node. Although the order of the information may in either ascending or descending but accessibility of the elements is not direct, so application of linear is only possible in case of linked list. Searching (of course linear) almost resembles traversing except that if search is successful traversing is terminated otherwise the linked list is traversed till the end.
        So, in order to do linear searching, get the information to be searching and set PTR with ROOT. Compare Information with INFO of PTR, if it is equal ‘search is successful’ and terminate traversing otherwise update PTR with LINK of PTR and repeat the process. Continue the operation till the end. The end is recognized by a NULL assigned to PTR.

Posted on by Jackrin Reacher | No comments


Post a Comment