Naïve algorithm

A naïve algorithm (or naive method) is typically a very simple solution to a problem, which represents the intuitive approach taken by one unfamiliar with the problem domain. It is meant to describe a suboptimal algorithm compared to a "clever" (but less simple) algorithm. Naïve algorithms usually consume larger amounts of resources (time, space, memory accesses, ...), but are simple to devise and implement.

An example of a naïve algorithm is bubble sort, which is only a few lines long and easy to understand, but has a O(n²) time complexity. A more "clever" algorithm is mergesort, which, although being more complicated than bubble sort, has a O(n lb(n)) complexity. For instance, sorting a list of 100 items with bubble sort may require up to 10,000 iterations, while sorting the same list with mergesort requires at most 700 iterations, making mergesort a much faster algorithm than bubble sort.

Naïve algorithms are mostly used for prototyping purposes; they are often not acceptable in production-level software products.

Another sense of the term implies an algorithm which may have certain bugs, or fail to account for corner cases; for instance, the naïve implementations of various operations on linked lists and binary trees either leak memory or corrupt data based on incorrect pointer arithmetic.