Its worst case time complexity is O(ncv) where n is the number of terms to be compared, c is the maximum number of non-zero coordinates of any vector, and v is the number of vectors that have a nonzero i th coordinate where i is the coordinate which is non-zero for the most vectors.
the algorithm is efficient only when the density of the coordinates is low.