Following Worst Case Bound Sorting Ordering Information Obtained Adjacent Comparisons O N Q37293678

which of the following is the worst case bound forsorting when when ordering information is obtained only by adjacentcomparisons?

a. o(NlogN)
b. o(N^2)
c. o(N)
d. none of the above


Answer


An suer

b. o(N^2)

Leave a Comment

This site uses Akismet to reduce spam. Learn how your comment data is processed.