I read your comment ... you are calling me a liar, and I don't appreciate that. I'm providing scans of exactly the part where Knuth says the Bubble Sort only c

I read your comment ... you are calling me a liar, and I don't appreciate that. I'm providing scans of exactly the part where Knuth says the Bubble Sort only compares adjacent locations, just as I said. You said: > Bubble sort is the comparison of every pair. This is contradicted by the scans of TAoCP that I've provided. You said: > If you compare only adjacent pairs, you eliminate an enormous number of redundant comparisons. That's true, but you are eliminating redundant comparisons from something that is not a Bubble Sort. > This is bubble sort without the redundancy elimination. This is contradicted by the scanned excerpts from TAoCP. > It's just that the elimination is so common that many people don't know about it anymore, and think it's a defining part of the algorithm. The comparisons between locations that are not adjacent was never part of the Bubble Sort. You continue to claim otherwise, I have checked your references, as far as I can see they don't support your assertion. Please provide scans to support your claim. Otherwise I bid you good day, and good health.