Improve Linear Searching

Improve Linear Searching

In order to increase the efficiency of your linear searching, add the item you are searching at the end of the list (either an array or linked list) and write the following code for searching:

 BOOL Find(const int *pAListWithSearchedItemAtTheEnd, int nlength){ for (int i=0;; i++) {   if (pAListWithSearchedItemAtTheEnd[i] ==pAListWithSearchedItemAtTheEnd[nlength-1])     break; }  if (i==nlength-1)     return FALSE;  else     return TRUE;}

By adding the searched item at the end of the list, the loop boundary checking is avoided and hence one comparison statement per loop iteration is saved as the searched item will be found at the end, if not found anywhere else in the list.

See also  5 Tips for Working With an Onsite Interpreter

About Our Editorial Process

At DevX, we’re dedicated to tech entrepreneurship. Our team closely follows industry shifts, new products, AI breakthroughs, technology trends, and funding announcements. Articles undergo thorough editing to ensure accuracy and clarity, reflecting DevX’s style and supporting entrepreneurs in the tech sphere.

See our full editorial policy.

About Our Journalist