BubbleSort needs optimization for best-case scenario

[wassim31]

in bubblesort.c , the program needs improvement , for best case scenario where the array is sorted , we don't need to process each element again.
So from O(n²) we gonna have O(n) time complexity.
Also , it needs a lot of code design improvement.

[Gaurav12477]

can I do this ?