Embed presentation
Download to read offline

The document presents properties of the bubble sort algorithm. It indicates that bubble sort is a comparison sort that operates in O(n^2) time and is an in-place algorithm, while it does not run in O(n) or O(log n) time. Additionally, it mentions the need for additional memory.
