Bug: duplicate counting (#10)

* Setup: Debug

* Bug fixed: only Rs equals to identical p counts

Author: stevengogogo

.vscode/settings.json

@@ -1,5 +1,6 @@
 {
     "files.associations": {
-        "utils.h": "c"
+        "utils.h": "c",
+        "random": "c"
     }
 }

src/intersect.c

@@ -151,7 +151,11 @@ int MERGE_COUNT_INVERSION(Paths pt, int l, int m, int r){
         }
 
         //Sum up
-        inv = inv + (count - (m + 1)) + Iden;
+        inv +=  (count - (m + 1));
+
+        if(pt.r[k].p == isSame.p)
+             inv += Iden;
+        
     }
 
 

src/main.c

@@ -16,21 +16,16 @@
 
 int main()
 {
-    /*
-    int n = 10;
-    int p[] = {-5, 15, 15, -8, -11, -5, -13, -14, 15, 10};
-    int q[] = {-7, -12, -4, -13, 5, 1, 14, -16, -16, -14};
-    int r[] = {2, -13, 1, 9, 9, 1, 1, 12, -15, 6};
 
+   
     //Initiate
-    Paths pt = init_path(n,p,q,r);
-    
-
-
-    MERGE_SORT_FIRSTofThree(pt.p, pt.l, pt.r, 0, pt.len-1);
+    /*
+    TriProb tp = ParseData("test/dataGen/2.txt");
+    int ans = get_intersects(tp.n, tp.ps, tp.qs, tp.rs);
+    printf("%d\n",ans);
     */
 
-   
+   // Interface
     generator.init();
     int t = generator.getT();
 
@@ -44,7 +39,7 @@ int main()
             printf("\n");
         }
     }
-    
+
 
     return 0;
 }