What is the computational complexity of this query? Can it be sorted in a single pass?

It is difficult to determine the exact computational complexity without a specific request, but usually the complexity of sorting is O(n log n), where n is the number of elements.

Regarding sorting in a single pass: classical sorting algorithms, such as quicksort or merge sort, require multiple passes.

However, if the task is to find the maximum, minimum, or partially sort data (for example, to get the k largest elements), then algorithms with linear complexity can be used, such as the median selection algorithm or a heap.

Achieving a fully sorted result in a single pass is usually impossible, as comparison and permutation of elements are required.

If the question refers to sorting considering the specifics of the data (for example, counting sort for a limited range of values), then linear complexity O(n) can be achieved, but this is not universal.