Review:

Bubble Sort

overall review score: 2.5
score is between 0 and 5
Bubble sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order.

Key Features

  • Simple implementation
  • Easy to understand
  • In-place sorting

Pros

  • Easy to implement for small lists
  • Requires minimal additional memory

Cons

  • Inefficient for large lists
  • Has a time complexity of O(n^2)

External Links

Related Items

Last updated: Wed, Apr 1, 2026, 02:19:24 AM UTC