Any algorithm that sorts by exchanging adjacent elements require O(N2) – McqOptions

MCQOPTIONS

1.	Any algorithm that sorts by exchanging adjacent elements require O(N2) on average.
A.	True
B.	False
Answer» B.

Discussion

No Comment Found

Related MCQs

For the following question, how will the array elements look like after second pass?
What will be the number of passes to sort the elements using insertion sort?
Any algorithm that sorts by exchanging adjacent elements require O(N2) on average.

Related Topics

1

2

Recent Visits