3 ms·
This is pretty efficient. She lazily sorts them on first access. They are stored in a thunk and then lazily evaluates them. After that repeated access is effici
by dkubb 6y ago
This is pretty efficient. She lazily sorts them on first access. They are stored in a thunk and then lazily evaluates them. After that repeated access is efficient.