Algorithm Linear Search applied to Linked List

Algorithm:

SEARCHLl1 (ROOT, IN)
[ROOT is starting address of Linked List and 
 IN is Information to be searching in Linked List]
PTR<--ROOT
Repeat While PTR< >NULL AND IN< >PTR-->INFO
  PTR<--PTR-->LINK
[End of while]
If PTR-->INFO=IN Then:
   Write: ‘Search Successful’
Else:
   Write: ‘Search Successful’
[End of If]

Second form: 

SEARCHLL2 (ROOT, IN)
PTR<--ROOT
Repeat While PTR< >NULL AND IN< >PTR-->INFO
  PTR<--PTR-->LINK
[End of while]
If PTR-->INFO=IN Then:
  Return 1
Else:
  Return 0
[End of If]
Exit.

Comments

Popular posts from this blog

difference between structure and union in C Language

Difference between Linear search and Binary Search in c language

Difference between static and dynamic websites