Searching and sorting routines are an essential part of anyprogrammer's toolkit. A number of sorting routines compete for theprogrammer's favor, distinguished from on another by speed, the formatof the data they expect, and complexity.
Most programmers choose a sequential or binary search algorithm. Thisarticle discusses an incremental search variant technique that issometimes very useful.
(Clickhere to read more)