2. Said of an algorithm that doesn't take advantage of some superior but advanced technique, e.g., the bubble sort. It may imply naivete on the part of the programmer, although there are situations where a naive algorithm is preferred, because it is more important to keep the code comprehensible than to go for maximum performance. “I know the linear search is naive, but in this case the list typically only has half a dozen items.” Compare brute force.