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 ...

JSON dataset generator based on Context Free Grammar rules and Cartesian products aiming at quickly creating synthetic datasets to be used with Machine Learning systems.