Timeline for How to calculate max and min for each unique entry
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 12, 2019 at 20:13 | comment | added | Ed Morton | Always try to write software using positive rather than negative logic since positives are always easier to understand than negatives and cannot lead to obscure double negatives. min[$1]=(($1 in min) && (min[$1]<$2) ? min[$1] : $2) avoids the negative !. Similarly for max of course. | |
| Oct 11, 2019 at 22:26 | vote | accept | fgdark | ||
| Oct 11, 2019 at 18:10 | history | answered | Freddy | CC BY-SA 4.0 |