What is the main characteristic of the Bubble Sort algorithm?

A$)$ it always performs in $O(1)$ time

B$)$ it is an in$-$place sorting algorithm

C$)$ it can only sort elements in ascending order

D$)$ It has a time complexity of $0(logn)$

E$)$ it uses divide and conquer strategy