Bissoy.com
Doctors Medicines MCQs Q&A

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

Consider the following statements in respect of relations and functions: 1. All relations are functions but all functions are not relations. 2. A relation from A to B is a subset of Cartesian product A × B. 3. A relation in A is a subset of Cartesian product A × A. Which of the above statements are correct?
Which of the below statements are true? i. Cartesian tree is not a height balanced tree ii. Cartesian tree of a sequence of unique numbers can be unique generated
What happens if we apply the below operations on an input sequence? i. construct a cartesian tree for input sequence ii. put the root element of above tree in a priority queue iii. if( priority queue is not empty) then iv. search and delete minimum value in priority queue v. add that to output vi. add cartesian tree children of above node to priority queue
Describe the equation of the circular orbit in cartesian coordinates. Given, a point is P(6,054.78,6492.95) along the orbit in cartesian coordinates. Assume the centre of larger body to be the origin O(0,0).
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
The "Rule of law" is the speciality of which of the following-