InterviewSolution
Saved Bookmarks
| 1. |
Time complexity of bubble sort in worst case is …….. (a) θ(n) (b) θ(n log n) (c) θ(n2)(d) θ(n(log n)2) |
|
Answer» Time complexity of bubble sort in worst case is θ(n2) |
|