Bubble Sort Rounds I

Bubble sort is a sorting algorithm that consists of a number of rounds. On each round the algorithm scans the array from left to right and swaps any adjacent elements that are in the wrong order. Given an array of n integers, calculate the number of bubble sort rounds needed to sort the array. Input The first line has an integer n: the array size. The next line has n integers x_1,x_2,\dots,x_n