Editing 584: Unsatisfied

Jump to: navigation, search

Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.

The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision Your text
Line 10: Line 10:
 
[[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 {{w|no-win situation}}. No matter what he does of interesting stuff (sex or otherwise) with Ponytail he will be thinking forever of Megan, and vice versa. This even goes on after he dies, where he lies next to one of them and thinks he would rather have been buried next to the other girl.
 
[[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 {{w|no-win situation}}. No matter what he does of interesting stuff (sex or otherwise) with Ponytail he will be thinking forever of Megan, and vice versa. This even goes on after he dies, where he lies next to one of them and thinks he would rather have been buried next to the other girl.
  
βˆ’
The title text is referring to a concept in computer science. All {{w|Comparison sort|comparison based sorting algorithms}} are incapable of sorting an arbitrary set of n values faster than an order of n*log(n). On the other hand, non-comparison sorting algorithms (e.g. {{w|bucket sort}}) with external knowledge of the distribution of the values can sort them with order n. If [[Cueball]] was capable of establishing an external scale he could use a non-comparison sort, but as he does not know what the best thing for him is he is stuck with comparisons and thus he can't achieve better performance.
+
The title text is referring to a concept in computer science. All {{w|Comparison sort|comparison based sorting algorithms}} are incapable of sorting an arbitrary set of n values faster than an order of n*log(n). On the other hand non-comparison sorting algorithms (e.g. {{w|bucket sort}}) with external knowledge of the distribution of the values can sort them with order n. If [[Cueball]] was capable of establishing an external scale he could use a non-comparison sort, but as he does not know what the best thing for him is he is stuck with comparisons and thus he can't achieve better performance.
  
 
This comic is possibly a sequel to [[310: Commitment]].
 
This comic is possibly a sequel to [[310: Commitment]].

Please note that all contributions to explain xkcd may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see explain xkcd:Copyrights for details). Do not submit copyrighted work without permission!

To protect the wiki against automated edit spam, we kindly ask you to solve the following CAPTCHA:

Cancel | Editing help (opens in new window)