Title text: Forever comparing, never evaluating on any external scale. If you were a sort function, you'd never break the nlogn barrier.
In this comic Cueball is trying to decide if he wants to stay with Ponytail who he is currently dating or leave her and have a relationship with Megan. The comic suggests that no matter which one he chooses he will never truly achieve happiness because of his longing for the option he chose not to take. In a sense this is a no-win situation.
The title text is referring to a concept in computer science, all comparison based sorting algorithms are incapable of sorting an arbitrary set of n values faster then an order of n*log(n)*k where k is an arbitrary constant and n is the number of values to compare.
If Cueball was capable of establishing an external scale he could use use bucket sort or different order n sorting algorithm, but as he does not know what the best thing for him is he can't establish limits and thus he can't achieve this.
- [A blonde, Ponytail, and a man, Cueball, are holding hands, looking at another woman with black hair, Megan.]
- [Two arrows direct the comic into a pair of different paths.]
- (Left path) [Cueball is holding hands with Ponytail, but he is thinking about Megan.]
- (Right path) [Cueball approaches Megan. He is thinking about Ponytail.]]
- (Left path) [Cueball is performing oral sex on Ponytail, and still thinking about Megan.]]
- (Right path) [Cueball and Megan have sex on the arm of a chair. The man is thinking about Ponytail.]]
- (Left path) [Cueball and Ponytail are drawing something together, and the man is thinking about Megan.]]
- (Right path) [Cueball and Megan are hiking together. The man is thinking about Ponytail.]]
- (Left path) [Cueball and Ponytail are holding hands, and the man is thinking of Megan.]]
- (Right path) [Cueball and Megan are holding hands, and the man is thinking of Ponytail.]]
- [The path unites again.]
- [Two gravestones are next to each other. One of them is thinking about a third gravestone.]: