两个列表元素总和比较的最小复杂度

I have a question in algorithm design about arrays, which should be implement in C language. Suppose that we have an array which has n elements. For simplicity n is power of '2' like I have a question in algorithm design about arr