BUBBLESORT  Bubble Sort
One of the simplest sorting algorithms, the Bubble Sort, can be expressed as (0based array):
procedure bubbleSort( A : list of sortable items )
n = length(A)
repeat
swapped = false
for i = 1 to n1 inclusive do
/* if this pair is out of order */
if A[i1] > A[i] then
/* swap them and remember something changed */
swap( A[i1], A[i] )
swapped = true
end if
end for
until not swapped
end procedure
Now, given an array of N integers, you have to find out how many swap opeartions occur if the Bubble Sort algorithm is used to sort the array.
Input
Input begins with a line containing an integer T(1<=T<=100), denoting the number of test cases. Then T test cases follow. Each test case begins with a line containing an integer N(1<=N<=10000), denoting the number of integers in the array, followed by a line containing N space separated 32bit integers.
Output
For each test case, output a single line in the format Case X: Y, where X denotes the test case number and Y denotes the number of swap operations needed modulo 10000007.
Example
Input: 1 4 3 2 1 4 Output: Case 1: 3
hide comments
shadan_amir1:
20190101 08:48:38
This is Bill,


pallav17:
20180623 18:04:08
.


saltyfish233:
20171108 06:09:55
I did not notice ‘ needed modulo 10000007’, so I got many WAs : ( 

sandeep_4141:
20170106 09:56:25
after getting 2 times tle ,get concept inversion count...finally do it...rock on!! 

vivace:
20161126 05:48:50
take care of spaces after "Case" and after ":" . Cost me 45 WAs.


karan_batra:
20160827 11:36:55
Last edit: 20170205 08:46:43 

Gaurav Dahima:
20160820 19:52:33
spoilers in comments :D 

ov3rk1ll:
20160618 07:14:46
same as invcount 

Admin Deepak Baghel:
20160615 20:35:26
just added single line in merge sort :) Last edit: 20160616 14:36:54 

azam_9:
20160525 08:33:17
absence of mod costed me 1 WA....O(nlog(n)) using modified merge sort:D 
Added by:  imranziad 
Date:  20151125 
Time limit:  0.5s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 GOSU JSMONKEY 
Resource:  AIUB CS Fest 2015 (H.M. Mehrab) 