Array basics

What is the time complexity of finding the maximum element in an unsorted array of n integers?

Why does the standard 'second largest' algorithm need to track BOTH the largest and the second largest in the same loop?

An array is sorted in non-decreasing order if for every adjacent pair a[i-1] and a[i], it holds that ...

In the in-place 'remove duplicates from a sorted array' algorithm, the two pointers are usually called 'read' and 'write'. After the loop finishes, the new length of the unique-values prefix is _____ + 1.

In the 'move zeros to end' algorithm, we use a _____ operation rather than a copy because we also need to push the existing zero somewhere to the right.