Timeline for Java 2D array error
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 29, 2012 at 22:18 | vote | accept | Ryan Sayles | ||
| Oct 29, 2012 at 21:30 | vote | accept | Ryan Sayles | ||
| Oct 29, 2012 at 22:18 | |||||
| Oct 28, 2012 at 22:32 | answer | added | chm | timeline score: 0 | |
| Oct 28, 2012 at 22:31 | answer | added | Chris Gerken | timeline score: 1 | |
| Oct 28, 2012 at 22:24 | answer | added | Mikhail | timeline score: 0 | |
| Oct 28, 2012 at 22:20 | comment | added | Ryan Sayles | I edited my original question to clarify | |
| Oct 28, 2012 at 22:19 | history | edited | Ryan Sayles | CC BY-SA 3.0 |
added 136 characters in body
|
| Oct 28, 2012 at 22:18 | comment | added | Ryan Sayles | Well what I want to do is get the set [i][j] in E to the magnitude of those elements in my original array. So E[i][j] = difference in [i][j] , up, down, left, and right of those all added together. Sorry if that is difficult to follow | |
| Oct 28, 2012 at 22:14 | comment | added | chm | What do you want to happen when accessing elements off the edge? Should it wrap around to the other edge, or have a default, or what? | |
| Oct 28, 2012 at 22:12 | history | asked | Ryan Sayles | CC BY-SA 3.0 |