Does this algorithm complexity is good?

31 Views Asked by At

I have an algorithm of complexity O(|e1|*|e2|) where |e1| and |e2| is the number of edges in graph G1 and G2. So does this complexity is good? In another words, what does this complexity means? Sorry but im nubby in complexity