dean is a user on You can follow them or interact with them if you have an account anywhere in the fediverse. If you don't, you can sign up here.

RT O(1): random access to an element in a collection, dependent on indexing

O(n): list iterations

O(n^2): nested loops on the same collection

O(log n): divide and conquer

O(n log n): iterations that use divide and conquer

O(n!): adding a nested loop for every input you have

· Mastodon Twitter Crossposter · 1 · 1