Timeline for Checking all elements against each other for elements strictly worse
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 26, 2016 at 5:17 | history | edited | 200_success | CC BY-SA 3.0 |
deleted 43 characters in body; edited title
|
| Jan 24, 2016 at 11:14 | answer | added | Caridorc | timeline score: 2 | |
| Jan 23, 2016 at 22:14 | answer | added | vnp | timeline score: 2 | |
| Jan 23, 2016 at 14:58 | comment | added | Sjoerd Job Postmus |
Also, using your definition of test_func, checker, and all_copies, I get the empty list. Maybe add some more test-cases?
|
|
| Jan 23, 2016 at 14:55 | comment | added | Sjoerd Job Postmus |
What can we assume of the function checker? From the example we see it is not transitive, not reflexive, nothing. So I don't think anything better than O(n**2) is possible.
|
|
| Jan 23, 2016 at 14:29 | history | asked | paul23 | CC BY-SA 3.0 |