Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit bc13c33

Browse files
Added code
1 parent 253a2dd commit bc13c33

File tree

1 file changed

+47
-0
lines changed

1 file changed

+47
-0
lines changed

‎18. Divide & Conquer/test.py‎

Lines changed: 47 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,47 @@
1+
def inversion_count(arr,s,e):
2+
3+
if(s>=e):
4+
return 0
5+
6+
mid = (s+e)//2
7+
x = inversion_count(arr,s,mid)
8+
y = inversion_count(arr,mid+1,e)
9+
z = merge(arr,s,e)
10+
11+
return x+y+z
12+
13+
def merge(arr,s,e):
14+
15+
mid = (s+e)//2
16+
17+
i = s
18+
j = mid+1
19+
karr = []
20+
cnt = 0
21+
22+
while i<=mid and j<=e:
23+
24+
if arr[i]<=arr[j]:
25+
karr.append(arr[i])
26+
i+=1
27+
else:
28+
karr.append(arr[j])
29+
cnt+=(mid-i+1)
30+
j+=1
31+
32+
while i<=mid:
33+
karr.append(arr[i])
34+
i+=1
35+
36+
while j<=e:
37+
karr.append(arr[i])
38+
j+=1
39+
40+
for i in range(s,e+1):
41+
arr[i] = karr[i-s]
42+
43+
return cnt
44+
45+
46+
arr = [5,4,3,2,1]
47+
print(inversion_count(arr,0,len(arr)-1))

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /