Question

State the complexity of bubble sort.

Answer 1

Bubble sort has a worst-case and average complexity of О(n2), where n is the number of items being sorted. Most practical sorting algorithms have substantially better worst-case or average complexity, often O
hope it will helpful if it plz mark me brainlist plz

Answer 2

Bubble sort , now and then alluded to as sinking sort, is a straightforward arranging calculation that over and over strides through the rundown, looks at neighboring sets and swaps them on the off chance that they are in the wrong request. The go through the rundown is rehashed until the point that the rundown is arranged. The calculation, which is a correlation sort, is named for the way littler or bigger components "rise" to the highest priority on the rundown. In spite of the fact that the calculation is basic, it is too moderate and unreasonable for most issues notwithstanding when contrasted with inclusion sort . Bubble sort can be pragmatic if the info is in for the most part arranged request with some out-of-arrange components almost in position.