What is the speciality of cartesian sorting?

What is the speciality of cartesian sorting? Correct Answer it sorts partially sorted set of data quickly

It can sort a set which requires only some sorting or displacements. for example consider 78, 79, 80, 82, 81, 83, In this only 81 and 82 must be swaped to make it a complete sorted set, in this case cartesian sort comes to the rescue.

Related Questions

Which of the following sorting algorithms is the fastest for sorting small arrays?
Statement 1: Shell sort is a stable sorting algorithm. Statement 2: Shell sort is an in-place sorting algorithm.
Introsort begins sorting the given array by using which of the following sorting algorithm?
Tim sort begins sorting the given array by using which of the following sorting algorithm?
The Map showing the speciality of the surface of any area is called as