alt Hacker NewsNot my specification (drive by third party)
but I do take the view that ( 1, 2, 3, 4, 5, 5, 6 ) is a list of seven values (perhaps the number of dollars in the pockets of seven distinct unique people) and when sorted the output should also have seven items that correspond to the seven input items.
> Also ...
Yeah, that needs tightening up by pastel8739
Replies
inigyou • today at 2:07 AM
The specification said
Every item in I is present exactly once in S
➕ show 1 reply
You need a way to differentiate the two 5s, that isn't present. If you had a list like:
And did a: Then the duplicate 2s would be fine, because they're no longer duplicates, only duplicate keys. But it would still fail if (2,baz) showed up twice in the source and destination even though we've asked for SORT, not UNIQSORT.