sentences:  This algorithm, sometimes referred to as the naive approach, has a running time of "O"("dN"), where "N" is the cardinality of "S" and "d" is the dimensionality of "M".There are no search data structures to maintain, so linear search has no space complexity beyond the storage of the database.Naive search can, on average, outperform space partitioning approaches on higher dimensional spaces.