When poll is active respond at
PollEv.com​/pds
Send pds to 22333

If you are told that the FooDeeBar algorithm for directed graphs is linear, which of the following best gives the worst case time complexity?

145
5%
7
O( |V| )
3%
4
O ( |E| )
90%
131
O( |V|+|E| )
2%
3
O( |V|*|E| )
0%
0
O ( log( |E| ) * |V| )
0%
0
O( log ( |E|+|V| )
Powered by