Suppose there is a firm S of d-dimensional vectors, |S| = n. Suppose prefer that there are brace vectors in S that are same. If comparing any brace d-dimensional vectors takes O(d) interval, artfulness an fertile algorithm that finds the brace same vectors.
if(vector! in map) // here interval complexity O(d)
//endow same vector