The given question is “Give a formula for the (parallel) time te(n, p) required for the total exchange algorithm”.

I’m wondering should we take the append operation into account? If so, is it fine to say that the append operation takes cN time, where N is the size of the array, and c is a constant?

Thanks in advance.