3 ms·

Don’t forget about us O(1) solo entrepreneurs!

• smahs 1y ago
  Still O(n).
• wavemode 1y ago
  N is customers not employees
  • mitthrowaway2 1y ago
    In the article it's apparently "time since launch". Kind of like how an O(n^2) sorting algorithm sorts n^2 elements in time n. Right?
    • wavemode 1y ago
      No, it's the opposite. An O(n^2) algorithm sorts n items in n^2 time. So O(n^2) is worse than O(n). (should really be θ rather than O but you get my point)