JAVA
java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
/*
*DALIY CHALLENGE* : Given a positive int n. Generate a random int array of size n and count the inverses!
INFO:
an inverse is an integer pair (left,right) where the left value is larger than the right value.
TASK:
1) generate random int array
2) calculate inverses
EXAMPLE: (n = 6)
a random array could be: [1,3,4,2,0,9]
- 1,0 is an inverse
- 3,2 is an inverse
- 3,0 is an inverse
- 4,2 is an inverse
- 4,0 is an inverse
---> this array has 5 inverses!
try to do this as EFFICIENT as possible !
===========================================
code made by Wolfsan
please put some upvote if you like it!!!
============================================
Enter to Rename, Shift+Enter to Preview
OUTPUT
Run