Bubble Sort, Bubble Sort Algorithm, Data Structure Algorithm, Dsa Courses, Naem Azam.
is considered when the given array is reversely sorted i.e., all the elements in descending order. This is the case where all the swapping operations and all the comparison operations will be performed for all the elements of the array. Thus, time complexity, in this case, will be again O(n2).