What is the time complexity of the code written?

To determine the time complexity, analyze the loops, recursive calls, and data structure operations in the code. For instance, if the code contains a single for-loop that iterates over n elements, the complexity is O(n). If there are nested loops, multiply the sizes: a double loop over n elements yields O(n²). Recursive functions often follow recurrence relations; for example, a divide‑and‑conquer algorithm that splits the input in half and processes each half recursively has T(n) = 2T(n/2) + O(1), which solves to O(n log n). Also consider the cost of operations on data structures: accessing an array element is O(1), but inserting into a balanced binary search tree is O(log n). Summarize the dominant term to give the overall time complexity.