Problem

2 /7


Bubble sort: number of exchanges

Problem

Determine how many exchanges the ascending bubble sort algorithm will do for the given array.
 
Input
The first line is a number N (\(1 <= N <= 1000\)) – the number of elements in the array. On the second line – the array itself. It is guaranteed that all array elements are different and do not exceed 109.
 
Output
Print a single number – number of bubble sort exchanges.
 
Examples
# Input Output
1
5
1 2 3 4 5 
 0
2
5
5 4 3 2 1
 10

time 1000 ms
memory 256 Mb
Rules for program design and list of errors in automatic problem checking

Teacher commentary

Your Program

Attach a file with the source code of the program:

or select a programming language and type your program

Auto

       

Program check result To check the solution of the problem, you need to register or log in!