3 ms·
> Code that ordered the dictionary keys before iterating are now slightly innefficient due to extra work of sorting a sorted list. I think TimSort is extremely
by mark-r 7y ago
> Code that ordered the dictionary keys before iterating are now slightly innefficient due to extra work of sorting a sorted list.
I think TimSort is extremely efficient for presorted lists, so even that isn't a major impediment.