Cartesian Tree Sorting Algorithm in Java and python

[SimranLahrani842]

Cartesian Sort is an Adaptive Sorting as it sorts the data faster if data is partially sorted. In fact, there are very few sorting algorithms that make use of this fact. For example consider the array {5, 10, 40, 30, 28}. The input data is partially sorted too as only one swap between “40” and “28” results in a completely sorted order.

The program will be in Java and python along with output.

[SimranLahrani842]

Cartesian Sort is an Adaptive Sorting as it sorts the data faster if data is partially sorted. In fact, there are very few sorting algorithms that make use of this fact. For example consider the array {5, 10, 40, 30, 28}. The input data is partially sorted too as only one swap between “40” and “28” results in a completely sorted order.

The program will be in Java and python along with output.

Assign me this @Kumar-laxmi as it is not duplicate

[github-actions[bot]]

Stale issue message