this is for bubble sort when array is sorted t.c is order of n

and when array is reverse order t.c is n2.

and when array is reverse order t.c is n2.

Dark Mode

318 views

0 votes

Best answer

https://youtu.be/z9EWVOyvcVM , see this video by Gatebook . It is beautifully explained how comparison based sorting algorithms have nlogn time complexity

0 votes

@_Madhuri

**@@ https://www.youtube.com/watch?v=WffUZk1pgXE **