Timeline for Min & Max heap implementation
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 30, 2018 at 13:14 | comment | added | BennoDual | @pgs: Can you show the swap() Method of GetAllPermutations()? | |
| May 23, 2017 at 12:40 | history | edited | CommunityBot |
replaced http://stackoverflow.com/ with https://stackoverflow.com/
|
|
| May 2, 2017 at 16:17 | history | edited | pgs | CC BY-SA 3.0 |
.
|
| May 2, 2017 at 15:48 | comment | added | pgs | @PeterTaylor: Actually, I have never thought about this flaw. Thank you! | |
| May 2, 2017 at 15:46 | history | edited | pgs | CC BY-SA 3.0 |
.
|
| May 2, 2017 at 15:35 | comment | added | Peter Taylor |
There is one subtlety to negating numbers to reverse the comparison, and that is int.MinValue. Because 0 is neither negative nor positive and there are an even number of int values, the number of negative numbers cannot equal the number of positive numbers, and the result is that x == -x for 0 and MinValue. But I agree completely with the spirit of the point you're making.
|
|
| May 2, 2017 at 15:12 | history | edited | pgs | CC BY-SA 3.0 |
GSL GNU
|
| May 2, 2017 at 15:06 | history | answered | pgs | CC BY-SA 3.0 |