The binary search algorithm is an important algorithm in computer science. It solves the problem of searching large data sets efficiently. Luckily, the algorithm is quite simple to implement. This article shows two implementations of the algorithm in PHP and discusses the efficiency of them.
The singleton pattern is one of the most popular and well known patterns in software development. It is extremely simple and yet solves a fundamental and common problem. However, as this article discusses, everything has a cost.
A linear search is the simplest search algorithm in computer programming. In this article we discuss the various implementation of this search algorithm and we also discuss the main disadvantage of this search strategy.