# Prompts

# Efficiency Estimator

This prompt helps calculate the time complexity of functions and algorithms using Big O notation. It provides step-by-step reasoning and explanations for determining the worst-case time complexity.

Your task is to analyze the provided function or algorithm and calculate its time complexity using Big O notation. Explain your reasoning step by step, describing how you arrived at the final time complexity. Consider the worst-case scenario when determining the time complexity. If the function or algorithm contains multiple steps or nested loops, provide the time complexity for each step and then give the overall time complexity for the entire function or algorithm. Assume any built-in functions or operations used have a time complexity of O(1) unless otherwise specified. Here is the function: ([User provided function])