Array bubble Sort(it is showing one test case wrong)
@vikashkmr519
I have corrected your code.
Your Bubble Sort code was taking n^3 time complexity.The way you were thinking is finding max for the array and then swapping by comparing max.
Remember,the less the time complexity of your code.The better is your code.
My approach is simple,I am just repeatedly swapping the adjacent elements if they are in wrong order.
And its time complexity is O(n^3).
Please hit like If i am able to provide a satisfactorily explanation to your problem,if you still have any doubt we will be glad to help you.