xcombelle
Joined 15 years ago
Karma
46
Submissions
75
Member since
Feb 16
Joined 15 years ago
I don't know if it fits your needs
1. indexed data structures with an O(n) worst-case operation
2. order-less data structures with an O(1) worst-case operation
3. sorted data structures with an O(log n) worst-case operation
That's it. Let me know what you think"
I disagree.
sorting is a O(n*log(n)) worst-case operation for example.
minimum = +Inf
for b in bar.naz():
if not some_filter(b):
continue
b = some_op(b)
minimum = min(minimum, b)
foo(minimum)
Yes, plain old procedural python. data flow from top to bottom.
it allows `print` debugging, very usefull to debug some_filter and some_op are broken.