Since WFQ implementation is similar to fair queuing, it has the same O(log(n)) complexity, where n is the number of flows.
WFQ and fair queuing share a similar O(log(n)) complexity, where n represents the number of flows.