Question

what is bubble sort? best case and worst case complexity

Answer 1

• The main advantage of Bubble Sort is the simplicity of the algorithm. The space complexity for Bubble Sort is O(1), because only a single additional memory space is required i.e. for temp variable. Also, the best case time complexity will be O(n), it is when the list is already sorted.

HOPE SO IT HELPS YOU

Answer 2

Answer:

¥ØỮŘ ΔŇŞŴ€Ř IN THE ATTACHMENT

н๏pε ¡т нεℓpε∂ ყ๏น

PLZ Mark as brainliest answer ☺☹