Write an algorithm for a function with two n elements, consisting of integers and taking an ordered sequence from small to large as input and returning another sequence consisting of numbers present in both arrays. Even in the worst case of your algorithm, the time complexity must be o(n), that is, linear.

So

The algorithm is the findsame_things (A{0..n-1], B [0..n-1]) // Input: a sequence of ordered integers with two n elements // Output: the third sequence of integers present in both sequences

Can you write the pseudo code?