algorithms – Does the simultaneous search for max / min in an array of x and y coordinates increase comparisons?

I have an unsorted array of coordinates (x, y) and I need to find the minimum / maximum for (x) and (y) separately in order to be able to construct a selection framework at the same time. help from $ O ( frac {3n} {2}) $ comparison.

If I first sort the array according to the x coordinates, then I use this method to find the min / max for the left / combat zone boundaries, then sort the same array based on the coordinates there. and use the same algorithm to search for min / max. of y for upper / lower limits, does this double the number of comparisons or can I still claim that it is $ O ( frac {3n} {2}) $?