Inversions between two lists - mmolinaro/AA17-1/05demo-count-invert.pdf · 1 3 7 10 14 18 19 2 11...
25
1 10 14 18 19 3 7 16 17 23 25 2 11 two sorted halves Total: i = 6 Inversions between two lists Given two sorted halves, count number of inversions where a i and a j are in different halves.
Transcript of Inversions between two lists - mmolinaro/AA17-1/05demo-count-invert.pdf · 1 3 7 10 14 18 19 2 11...
1
10 14 18 19 3 7 16 17 23 25 2 11 two sorted halves
Total:
i = 6
Inversions between two lists
Given two sorted halves, count number of inversions where ai and aj
are in different halves.
2
10 14 18 19 3 7 16 17 23 25 2 11
i = 6
two sorted halves
Total: 6
6
Inversions between two lists
Given two sorted halves, count number of inversions where ai and aj
are in different halves.
3
10 14 18 19 3 7 16 17 23 25 2 11 two sorted halves
i = 6
Total: 6
6
Inversions between two lists
Given two sorted halves, count number of inversions where ai and aj
are in different halves.
4
10 14 18 19 3 7 16 17 23 25 2 11 two sorted halves
i = 6
Total: 6
6
Inversions between two lists
Given two sorted halves, count number of inversions where ai and aj
are in different halves.
5
10 14 18 19 3 7 16 17 23 25 2 11 two sorted halves
i = 5
Total: 6
6
Inversions between two lists
Given two sorted halves, count number of inversions where ai and aj
are in different halves.
6
10 14 18 19 3 7 16 17 23 25 2 11 two sorted halves
i = 5
Total: 6
6
Inversions between two lists
Given two sorted halves, count number of inversions where ai and aj
are in different halves.
7
10 14 18 19 3 7 16 17 23 25 2 11 two sorted halves
i = 4
Total: 6
6
Inversions between two lists
Given two sorted halves, count number of inversions where ai and aj
are in different halves.
8
10 14 18 19 3 7 16 17 23 25 2 11 two sorted halves
i = 4
Total: 6
6
Inversions between two lists
Given two sorted halves, count number of inversions where ai and aj
are in different halves.
9
10 14 18 19 3 7 16 17 23 25 2 11 two sorted halves
i = 3
Total: 6
6
Inversions between two lists
Given two sorted halves, count number of inversions where ai and aj
are in different halves.
10
10 14 18 19 3 7 16 17 23 25 2 11 two sorted halves
i = 3
Total: 6 + 3
6 3
Inversions between two lists
Given two sorted halves, count number of inversions where ai and aj
are in different halves.
11
10 14 18 19 3 7 16 17 23 25 2 11 two sorted halves
i = 3
Total: 6 + 3
6 3
Inversions between two lists
Given two sorted halves, count number of inversions where ai and aj
are in different halves.
12
10 14 18 19 3 7 16 17 23 25 2 11 two sorted halves
i = 3
Total: 6 + 3
6 3
Inversions between two lists
Given two sorted halves, count number of inversions where ai and aj
are in different halves.
13
10 14 18 19 3 7 16 17 23 25 2 11 two sorted halves
i = 2
Total: 6 + 3
6 3
Inversions between two lists
Given two sorted halves, count number of inversions where ai and aj
are in different halves.
14
10 14 18 19 3 7 16 17 23 25 2 11 two sorted halves
i = 2
Total: 6 + 3 + 2
6 3 2
Inversions between two lists
Given two sorted halves, count number of inversions where ai and aj
are in different halves.
15
10 14 18 19 3 7 16 17 23 25 2 11 two sorted halves
i = 2
Total: 6 + 3 + 2
6 3 2
Inversions between two lists
Given two sorted halves, count number of inversions where ai and aj
are in different halves.
16
10 14 18 19 3 7 16 17 23 25 2 11 two sorted halves
i = 2
Total: 6 + 3 + 2 + 2
6 3 2 2
Inversions between two lists
Given two sorted halves, count number of inversions where ai and aj
are in different halves.
17
10 14 18 19 3 7 16 17 23 25 2 11 two sorted halves
i = 2
Total: 6 + 3 + 2 + 2
6 3 2 2
Inversions between two lists
Given two sorted halves, count number of inversions where ai and aj
are in different halves.
18
10 14 18 19 3 7 16 17 23 25 2 11 two sorted halves
i = 2
Total: 6 + 3 + 2 + 2
6 3 2 2
Inversions between two lists
Given two sorted halves, count number of inversions where ai and aj
are in different halves.
19
10 14 18 19 3 7 16 17 23 25 2 11 two sorted halves
i = 1
Total: 6 + 3 + 2 + 2
6 3 2 2
Inversions between two lists
Given two sorted halves, count number of inversions where ai and aj
are in different halves.
20
10 14 18 19 3 7 16 17 23 25 2 11 two sorted halves
i = 1
Total: 6 + 3 + 2 + 2
6 3 2 2
Inversions between two lists
Given two sorted halves, count number of inversions where ai and aj
are in different halves.
21
10 14 18 19 3 7 16 17 23 25 2 11 two sorted halves
i = 0
Total: 6 + 3 + 2 + 2
first half exhausted
6 3 2 2
Inversions between two lists
Given two sorted halves, count number of inversions where ai and aj
are in different halves.
22
10 14 18 19 3 7 16 17 23 25 2 11 two sorted halves
i = 0
Total: 6 + 3 + 2 + 2 + 0
6 3 2 2 0
Inversions between two lists
Given two sorted halves, count number of inversions where ai and aj
are in different halves.
23
10 14 18 19 3 7 16 17 23 25 2 11 two sorted halves
i = 0
Total: 6 + 3 + 2 + 2 + 0
6 3 2 2 0
Inversions between two lists
Given two sorted halves, count number of inversions where ai and aj
are in different halves.
24
10 14 18 19 3 7 16 17 23 25 2 11 two sorted halves
i = 0
Total: 6 + 3 + 2 + 2 + 0 + 0
6 3 2 2 0 0
Inversions between two lists
Given two sorted halves, count number of inversions where ai and aj
are in different halves.
25
10 14 18 19 3 7 16 17 23 25 2 11
Inversions between two lists
Given two sorted halves, count number of inversions where ai and aj
are in different halves.
two sorted halves
i = 0
Total: 6 + 3 + 2 + 2 + 0 + 0 = 13
6 3 2 2 0 0
![Split-Ordered Lists: Lock-Free Extensible Hash TablesSplit-Ordered Lists: Lock-Free Extensible Hash Tables 381 priority inversions [Greenwald 1999]. These drawbacks become more acute](https://static.fdocuments.us/doc/165x107/60bb07c088c5b860cd11d325/split-ordered-lists-lock-free-extensible-hash-split-ordered-lists-lock-free-extensible.jpg)
