you are viewing a single comment's thread
view the rest of the comments
[–] 18 points 1 year ago

Since Roman numerals have an upper bound, the time complexity is always O(1).

  • source