Timeline for Are there adaptive algorithms/data structures for sparse and non sparse vectors?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 5, 2022 at 15:25 | comment | added | Colim | Best answer to this point. I thought, instead of length, storing a "pattern" unsigned integer, where each bit represents the presence or absence of a zero, like [index, 0b00001,value] means there is only 1 value, and [index, 0b1111, value, value, value, value] is a dense array. But [Idx, 0b100,v] would mean the same as [Idx, 0b010,v] and that wastes encoding. | |
| Aug 5, 2022 at 14:49 | comment | added | user16034 | Ok, I got it... | |
| Aug 5, 2022 at 14:45 | comment | added | Andrey Godyaev | There are N/2 sequencies each consuming 3 slots. | |
| Aug 5, 2022 at 14:44 | comment | added | user16034 | How do you conclude 1.5N slots ? I believe in 3N instead. | |
| S Aug 5, 2022 at 14:42 | review | First answers | |||
| Aug 5, 2022 at 18:36 | |||||
| S Aug 5, 2022 at 14:42 | history | answered | Andrey Godyaev | CC BY-SA 4.0 |