1
Worst time complexity for an irreducible program
Time complexity, typically represented in Big O notation, represents how long a program will typically take to run given some input(s), ignoring constants.
Your task is to do one of the following things, with the worst time complexity possible:
So...