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
b. o(N^2)
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
b. o(N^2)