BUBBLE SORT Pass i = 1 Example numbers Start with: [6, 3, 8, 5, 2] Bubble sort (ascending) rule: For each pass i = 1 … n−1, compare neighboring pairs at positions j and j+1 (for j = 1 … n−i). Swap if left > right. j = 1: compare (6, 3) → swap →

Welcome to WordPress. This is your first post. Edit or delete it, then start writing!