Modified file name

Searching Algorithms/Count_Inversions/CountInversion.c

@@ -0,0 +1,28 @@
+// C program to Count Inversions in an array 
+// using nested loop
+
+#include <stdio.h>
+
+// Function to count inversions in the array
+int inversionCount(int arr[], int n) {
+    int invCount = 0;
+
+    for (int i = 0; i < n - 1; i++) {
+        for (int j = i + 1; j < n; j++) {
+
+            // If the current element is greater than the next,
+            // increment the count
+            if (arr[i] > arr[j])
+                invCount++;
+        }
+    }
+    return invCount;
+}
+
+int main() {
+    int arr[] = {4, 3, 2, 1};
+    int n = sizeof(arr) / sizeof(arr[0]); 
+
+    printf("%d\n", inversionCount(arr, n));
+    return 0;
+}

Searching Algorithms/Count Inversions/Readme.md → Searching Algorithms/Count_Inversions/Readme.md

@@ -35,4 +35,5 @@ Explanation: There is no pair of indexes i, j exists in the given array such tha
 Time Complexity: O(N*logN), where N = size of the given array.
 Reason: We are not changing the merge sort algorithm except by adding a variable to it. So, the time complexity is as same as the merge sort.
 
+
 Space Complexity: O(N), as in the merge sort We use a temporary array to store elements in sorted order.