A bubble sort technique compares adjacent items and swaps them if they are in the wrong order. This is done recursively until all elements are in ascending order. Find the total number of swaps required to sort an input vector using a simple bubble sort technique. For more information see the wikipedia page: http://en.wikipedia.org/wiki/Bubble_sort

Solve

Solution Stats

722 Solutions

389 Solvers

Last Solution submitted on Mar 24, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers389

akihisa yorozu Jonathan Gutknecht Lorenzo Hanyang

Suggested Problems

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!