Since WFQ implementation is similar to fair queuing, it has the same O(log(n)) complexity, where n is the number of flows.
Since WFQ implementation mirrors fair queuing, it exhibits the same logarithmic complexity, with respect to the number of flows (n).