Cody

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

Created by Robert Weinberg in Community

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

Solution Stats

69.78% Correct | 30.22% Incorrect
Last solution submitted on Jun 20, 2019

Problem Comments