Title text: 'Forever comparing, never evaluating on any external scale. If you were a sort function, you'd never break the nlogn barrier.'
| This explanation may be incomplete or incorrect: |
Please include the reason why this explanation is incomplete, like this:
If you can address this issue, please edit the page! Thanks.
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.
- [Cueball, Ponytail, and Megan stand stand looking at each other.]
- [Cueball considers who he wants to be with.]
- [Cueball thinks of the different bedroom activities the two prefer.]
- [Cueball thinks of the different ways that the two women spend their free time.]
- [Cueball thinks of how happy he could be with the woman he did not choose.]
- [Cueball, even in death, thinks of being dead in a grave near the woman he did not choose.]
add a comment! ⋅ add a topic (use sparingly)! ⋅ refresh comments!