In the Bubble sort the adjacent elements are compared.If they are not in order they are swapped.Now based on how the user wants it can either be in ascending order or descending order.
- The time complexity of the bubble sort is o(n2).
Subscribe to:
Post Comments (Atom)
Posts
No comments:
Post a Comment