Could you support your claim that running times are irrelevant? I understand you want to keep your blog post (or "blarticle") short. But maybe you could elaborate here? I am genuinely interested in your argument. I…
Not to discourage you from trying anything but it looks like you've ignored the complexity issues with this (I won't pick at the fact that you described an O(n^2) algorithm for sorting). I understand that you don't want…
This sounds like an interesting topic, but the article itself was more confusing than enlightening to me. It seems that the actual explanation (using Hamming distances) could be used instead of the bubble-wrap analogy…
Could you support your claim that running times are irrelevant? I understand you want to keep your blog post (or "blarticle") short. But maybe you could elaborate here? I am genuinely interested in your argument. I…
Not to discourage you from trying anything but it looks like you've ignored the complexity issues with this (I won't pick at the fact that you described an O(n^2) algorithm for sorting). I understand that you don't want…
This sounds like an interesting topic, but the article itself was more confusing than enlightening to me. It seems that the actual explanation (using Hamming distances) could be used instead of the bubble-wrap analogy…