Day 2: Red-Nosed Reports

Megathread guidelines

  • Keep top level comments as only solutions, if you want to say something other than a solution put it in a new post. (replies to comments can be whatever)
  • You can send code in code blocks by using three backticks, the code, and then three backticks or use something such as https://blocks.programming.dev/ if you prefer sending it through a URL

FAQ

you are viewing a single comment's thread
view the rest of the comments
[+] 1 point 2 years ago* (last edited 1 year ago) (4 children)
  • [+] 2 points 2 years ago* (last edited 1 year ago) (3 children)
  • [+] 1 point 2 years ago* (last edited 1 year ago) (2 children)
  • [โ€“] 2 points 2 years ago

    It really depends on what your parameter n is. If the only relevant size is the number of records (let's say that is n), then this solution takes time in O(n), because it loops over records only once at a time. This ignores the length of records by considering it constant.

    If we also consider the maximum length of records (let's call it m), then your solution, and most others I've seen in this thread, has a time complexity in O(n * m^2) for part 2.

  • source
  • parent