Timeline for Speed Efficiency of Decompression Algorithm
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 23, 2020 at 21:57 | comment | added | Stephen | This version? I haven't actually tested so I make no guarantees but the version that I wrote up took the execution to ~1.5 seconds from ~10 minutes, an insane improvement. Which ultimately brought it into the same ballpark as the javascript implementation. | |
| Sep 23, 2020 at 21:45 | comment | added | superb rain | @Stephen How much faster is this? From ~10 minutes down to how long? | |
| Sep 23, 2020 at 20:20 | vote | accept | Stephen | ||
| Sep 23, 2020 at 20:20 | comment | added | Stephen |
Ha! I made this change and was about to update this when I saw your answer. I did essentially what you did because I realized that list slicing and then using += on two lists was the inefficiency due to memory copying and the potential for huge reallocations. My new solution gets rid of all the slicing as well as the assignment of new lists so that excessive copying and garbage collection need not happen by iterating through the existing data and output lists to make this possible. I'm marking your answer as the answer because it does essentially the same thing.
|
|
| Sep 23, 2020 at 19:52 | history | answered | RootTwo | CC BY-SA 4.0 |