this post was submitted on 03 Feb 2024
92 points (97.9% liked)

Comics

462 readers
1 users here now

A community for sharing comics related to programming

Icon base by Delapouite under CC BY 3.0 with modifications to add a gradient

founded 11 months ago
MODERATORS
 

Hover Text:

What's the complexity class of the best linear programming cutting-plane techniques? I couldn't find it anywhere. Man, the Garfield guy doesn't have these problems...

Transcript

[in a yellow box:]
[There is a linked black web, with a path in red; it appears to be a map of the United States.]
Brute-force solution:O(n!)
[The web continues in this one. A man with a brown hat and a case is drawing it.]
Dynamic programming algorithms: O(n^22^n)
[Another man, with a brown hat too, is at a computer, looking back over the chair.]
Selling on eBay: O(1)
eBay salesman: Still working on your route?
Drawing salesman: Shut the hell up.

you are viewing a single comment's thread
view the rest of the comments
[–] [email protected] 5 points 10 months ago

You can say O(n^n) instead of O(n!) Its true and more dramatic!