Sort could very well do the same for Null references: they could end up side by side in the final sorted array
Yes, you could in theory make a sort routine that would sort an entire array of Null objects. But there would be little point as the array would already, by definition, be sorted. (say at the start or end.
So which is it, and what mathematical basis do you have for putting "Null" as the absolute highest value possible, or the absolute lowest value possible? It just *happens* that it's not done like that.
Yes, but it happens for a reason. That reason happens to be because Null is undefined, and thus ordering it in relation to defined objects is meaningless. Kind of like how you can't tell if sqrt(-1) (or i or j depeding on which notation you prefer) is higher than 0 or lower than 0. It simply isn't meaningful to compare imaginary, and non-imaginary numbers.