Timeline for Finding the largest of a series of numbers being XORed
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 24, 2014 at 23:48 | history | edited | Jason Goemaat | CC BY-SA 3.0 |
added another example
|
| Jul 24, 2014 at 23:30 | comment | added | Jason Goemaat |
Zeroing them out, then for each x value read on the second line, I add the index to nodes[x], allocating memory and copying the old indexes array and adding the index to the end, then increment indexCount.
|
|
| Jul 24, 2014 at 23:24 | comment | added | Ryan McClure | Great answer! Just one question: how are you loading up the array of structs originally? | |
| Jul 24, 2014 at 22:09 | vote | accept | Ryan McClure | ||
| Jul 24, 2014 at 21:35 | history | answered | Jason Goemaat | CC BY-SA 3.0 |