The big-o time analysis for the combined time of attaching all n numbers i O(n).
The big-O running time gives the relationship between the steps taken for the algorithm and its running time. it is denoted by O(.), where . refers to the some f(n). f(n) is determined by the way of the algorithm in each step.
Here, we attach 1, then 2,then 3 and so on up to n to make a sequence of numbers. So at a time, only 1 number is attached and therefore one step of the algorithm is working. So we can say that the big-O time analysis for the combined time of attaching all n numbers is O(n).
This means that at n = 1, only 1 step is taken by the algorithm .At n=2, two steps and continued like this up to n steps.
Learn more about big-O at https://brainly.com/question/15691129
#SPJ4
