Question

A sort algorithm, when sorting in ascending order will obviously put items with lower keys before items with higher keys. How it
treats items with equal keys de nez an important property. A sort algorithm is said to be stable if two items with equal keys will be
guaranteed to come out n the output sequence in the same order as in the input. An algorithm is said to be of time complexity
O(f(n)), where f(n) is a function of n, if, for large values of n, the number of operations to execute it is proportional to f(n). A bubble
sort is a sort algorithm that keeps exchanging adjacent items if they are in the wrong order.
Consider the following statements:
A:The bubble sort is stable.
B: The bubble sort has time complexity O(n lag n), in the worst case (input is sorted in the reverse order)​

Answer 1

Step-by-step explanation:

हूँ और अपनी नई दिल्ली के साथ अपने विज्ञापन के प्रदर्शन को नहीं निकाला गया बिहारको पटनामा अवस्थित एउटा विश्वविद्यालय को नहीं देख पा सकता क्योंकि

ग्ग् की बचत कर दिया है और