From a25b0b09d21da27355180fbb8a0b73203cbe381c Mon Sep 17 00:00:00 2001
From: redfishleo <16261646+redfish-lee@users.noreply.github.com>
Date: Thu, 20 Sep 2018 20:40:34 +0800
Subject: [PATCH] problem2.4: update clear answer

inversion relation is (i, j), not (A[i], A[j])
---
 C02-Getting-Started/problem.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/C02-Getting-Started/problem.md b/C02-Getting-Started/problem.md
index bd072e96..5f85a760 100644
--- a/C02-Getting-Started/problem.md
+++ b/C02-Getting-Started/problem.md
@@ -99,7 +99,7 @@ elements in Θ(n lg n) worst-case time. (Hint: Modify merge sort.)
 
 ### `Answer`
 **a.**
-⟨2,1⟩, ⟨3,1⟩, ⟨8,6⟩, ⟨8,1⟩ 和 ⟨6,1⟩.
+⟨1,5⟩, ⟨2,5⟩, ⟨3,4⟩, ⟨3,5⟩ 和 ⟨4,5⟩.
 
 **b.** The array with decending order arrangement i.e. {n, n-1, n-2, ..., 3, 2, 1} has the most inversions.  
 Number of inversions = Number of ways to choose two distinct element from the above set = n(n-1)/2.