Problem 1401. Implement a bubble sort technique and output the number of swaps required

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:

Solution Stats

69.83% Correct | 30.17% Incorrect
Last Solution submitted on Jul 04, 2020

Problem Comments

Solution Comments