Computer Science, asked by tejasri5597, 1 year ago

Best case efficiency of bubble sort in improvised version

Answers

Answered by muskanc918
4

Some iterations can be skipped if the list is sorted, hence efficiency improves to O(n). 10. The given array is arr = {1,2,4,3}.

Answered by paramjyotisingp2rky7
0

Best case efficiency of bubble sort in improved version is O(n).

Similar questions