Click here to Skip to main content
Click here to Skip to main content
Add your own
alternative version

Can search_n be more efficient?

, 27 Mar 2007
This article is discussing the efficiency of the most popular search_n implementations. Furthermore, it is introducing a new search_n specialization for random access iterators, which outruns by far the most commonly used implementations.

Revisions


  

Compare Revision Minor Date Status Editor
publicly available No 27-Mar-07 13:21 Available Sean Ewington

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

About the Author

Jim Xochellis
Software Developer
Greece Greece
I live in Greece with my wife and our two daughters. I am a professional software developer since 1999, using mostly C/C++ in my work.
 
My main expertise are: C/C++, STL, software optimization, generic programming and debugging. I am also very experienced in client–server programming, communications, concurrent programming, software security and cryptography. Finally, in my early professional years, I have worked a lot on cross-platform programming (Mac+Win).
 
I am familiar with the MFC, wxWidgets and Cplat GUI frameworks and the Python, Java, Pascal, Fortran, Prolog and Rexx programming languages.

| Advertise | Privacy | Mobile
Web04 | 2.8.140709.1 | Last Updated 27 Mar 2007
Article Copyright 2004 by Jim Xochellis
Everything else Copyright © CodeProject, 1999-2014
Terms of Service
Layout: fixed | fluid