Timeline for Implementing core data structures
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 16, 2020 at 18:45 | comment | added | Kevin O'Bryant | After stealing ideas from around this site (including Carl Woll's answer to this question), I've just put up a package for queues and stacks here: github.com/truculentmath/QueueStack | |
| May 14, 2019 at 23:45 | review | Close votes | |||
| May 20, 2019 at 13:39 | |||||
| May 14, 2019 at 21:43 | answer | added | Carl Woll | timeline score: 6 | |
| May 14, 2019 at 19:48 | comment | added | b3m2a1 | @JasonB. hadn't seen that one. Very useful. | |
| May 14, 2019 at 19:47 | comment | added | Jason B. | You've seen this? | |
| May 14, 2019 at 19:46 | comment | added | b3m2a1 | @Nasser I've seen it, but I think it needs a modern update. The info remains useful, but is certainly nothing near state of the art now. | |
| May 14, 2019 at 19:45 | comment | added | b3m2a1 | @JasonB. I know. That was one of my concerns in asking it, but I think there are enough unifying patterns to make it worth it. (in particular I'm currently working up a hash-map-based linked-list approach to it that I'm hopeful will give good performance) | |
| May 14, 2019 at 19:44 | comment | added | Jason B. | Awfully broad question you have there..... | |
| May 14, 2019 at 19:37 | comment | added | Nasser | Hi. You can look at library.wolfram.com/infocenter/Conferences/321 "Data Structures and Efficient Algorithms in Mathematica" By Daniel Lichtblau "Certain data structures and algorithms for their manipulation pervade computer science. It seems that many of these are not commonly encountered in Mathematica programming. In this talk we show how many data structures may be implemented and used effectively, giving simple Mathematica examples" . | |
| May 14, 2019 at 19:25 | history | asked | b3m2a1 | CC BY-SA 4.0 |