Timeline for Algorithm for efficient scale down of 2d boolean array
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 2, 2016 at 13:47 | comment | added | Eiko | Indeed one could go the other way round, and there may be many optimisations available. It really depends a lot on the underlying data - how large, how stored, and of course how the data is populated (spare, i.e. few 1s ore many?). | |
| Nov 2, 2016 at 13:17 | comment | added | davidsheldon |
I think that having nested for-loops could be more efficient, as you could short-circuit the calculation of an outer cell as soon as you found a single 1 in the content.
|
|
| Nov 2, 2016 at 11:51 | history | answered | Eiko | CC BY-SA 3.0 |