Cartesian Tree Sort

Cartesian Tree Sort builds a Cartesian Tree from the input array, maintaining the heap property while preserving the in-order sequence, then performs an in-order traversal to produce a sorted array.