self doubt

Question

what are comparison based algo properties ?

there was a question dont remember much which they take random program and then there are options like 1) comparison based 2) stable  3) both 4 ) none of above

that program is inplace for sure .... but altast in answer is d saying that all comparison based properties are not satisfied....

( i know without question little difficult but i dont remember where i saw that question )

Comments

Like the properties of comparison based algorithms, like stability, in-place.

---

can u give some defintion for comparison based algo ?

there was a question dont remember much which they take random program and then there are options like 1) comparison based 2) stable  3) both 4 ) none of above

that program is inplace for sure .... but altast in answer is d saying that all comparison based properties are not satisfied....

( i know without question little difficult but i dont remember where i saw that question )

---

A comparison sort is a type of sorting algorithm that only reads the list elements through a single abstract comparison operation (often a "less than or equal to" operator or a three-way comparison) that determines which of two elements should occur first in the final sorted list. The only requirement is that the operator obey two of the properties of a total order:

1. if a ≤ b and b ≤ c then a ≤ c (transitivity)
2. for all a and b, either a ≤ b or b ≤ a (totalness or trichotomy).

These are the properties i guess.

Ref : here

 

---

bubble sort, selection sort, insertion sort are comparison based algo because they sort elements by comparing elements (an element with every other element.)

like in bubble sort we compare elements and after 1st pass we find the largest element and put it in the last place.

in 2nd pass we find the 2nd largest element and put it in the 2nd last place. and so on.