Login | Register   
RSS Feed
Download our iPhone app
Browse DevX
Sign up for e-mail newsletters from DevX

By submitting your information, you agree that devx.com may send you DevX offers via email, phone and text message, as well as email offers about other products and services that DevX believes may be of interest to you. DevX will process your information in accordance with the Quinstreet Privacy Policy.

Tip of the Day
Home » Tip Bank » C++
Language: C++
Expertise: Intermediate
Oct 8, 2001



Application Security Testing: An Integral Part of DevOps

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] ==

  if (i==nlength-1)
     return FALSE;
     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.
Asad Ather
Comment and Contribute






(Maximum characters: 1200). You have 1200 characters left.



Thanks for your registration, follow us on our social networks to keep up-to-date