Q278
Any algorithm that sorts by exchanging adjacent elements require O(N2) on average.
A.
True
AnswerB.
False
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board