Timeline for Sorting Algorithms
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 17, 2015 at 1:00 | vote | accept | Taylor Huston | ||
| Sep 14, 2014 at 22:59 | history | edited | Jamal | CC BY-SA 3.0 |
added 24 characters in body
|
| Aug 14, 2014 at 22:23 | comment | added | vnp |
The only justification for less I can see is if it was a free-standing function, akin to std::less STL template. Here is not the case, since Java doesn't allow free-standing templates, and an interface is cast in concrete to Comparable. I don't know why Segdewick decided to go this way. BTW, they missed factoring out copy and find methods - and I also insist it is wrong. Very few textbooks are error free.
|
|
| Aug 14, 2014 at 20:56 | comment | added | Taylor Huston | I'll admit that spelling out the 'less', 'equals' and 'greater' function did seem redundant. But that's how it's done in the textbook (well the less function at least, I just added the others for good measure). Like I said, it did seem redundant to me, but I assumed the two PhDs who wrote the book had a good reason and went with it. Here is from the textbook companions website. Any insite as to why would be appreciated. algs4.cs.princeton.edu/22mergesort/Merge.java.html | |
| Aug 14, 2014 at 7:04 | history | answered | vnp | CC BY-SA 3.0 |