adding inversionCount.cpp,prims.cpp,boltsAndNuts.java algorithm

CPP/inversionCount.cpp

@@ -0,0 +1,30 @@
+#include<iostream>
+using namespace std;
+int getInversionCount(int arr[],int n){
+  int inversionCount = 0;
+  for(int i=0;i<n-1;i++){
+      for(int j=i+1;j<n;j++){
+        if(arr[i]>arr[i+1])
+          inversionCount++;
+      }      
+  }
+  return inversionCount;
+}
+
+// int main(){
+//   int n;
+//   cin >> n;
+//   int arr[n];
+//   cout << "Enter the elements for the array";
+//   for(int i=0;i<n;i++){
+//     cin >> arr[i];
+//   }
+//   cout << "Number of inversion count is";
+//   getInversionCount(arr,n);
+int main(){
+  int arr[] = { 1, 20, 6, 4, 5 };
+  int n = sizeof(arr) / sizeof(arr[0]);
+  cout << " Number of inversions are "
+       << getInversionCount(arr, n);
+  return 0;
+}

CPP/prims.cpp

@@ -0,0 +1,102 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+// Number of vertices in the graph
+#define V 5
+
+// A utility function to find the vertex with
+// minimum key value, from the set of vertices
+// not yet included in MST
+int minKey(int key[], bool mstSet[])
+{
+    // Initialize min value
+    int min = INT_MAX, min_index;
+
+    for (int v = 0; v < V; v++)
+        if (mstSet[v] == false && key[v] < min)
+            min = key[v], min_index = v;
+
+    return min_index;
+}
+
+// A utility function to print the
+// constructed MST stored in parent[]
+void printMST(int parent[], int graph[V][V])
+{
+    cout<<"Edge \tWeight\n";
+    for (int i = 1; i < V; i++)
+        cout<<parent[i]<<" - "<<i<<" \t"<<graph[i][parent[i]]<<" \n";
+}
+
+// Function to construct and print MST for
+// a graph represented using adjacency
+// matrix representation
+void primMST(int graph[V][V])
+{
+    // Array to store constructed MST
+    int parent[V];
+
+    // Key values used to pick minimum weight edge in cut
+    int key[V];
+
+    // To represent set of vertices not yet included in MST
+    bool mstSet[V];
+
+    // Initialize all keys as INFINITE
+    for (int i = 0; i < V; i++)
+        key[i] = INT_MAX, mstSet[i] = false;
+
+    // Always include first 1st vertex in MST.
+    // Make key 0 so that this vertex is picked as first vertex.
+    key[0] = 0;
+    parent[0] = -1; // First node is always root of MST
+
+    // The MST will have V vertices
+    for (int count = 0; count < V - 1; count++)
+    {
+        // Pick the minimum key vertex from the
+        // set of vertices not yet included in MST
+        int u = minKey(key, mstSet);
+
+        // Add the picked vertex to the MST Set
+        mstSet[u] = true;
+
+        // Update key value and parent index of
+        // the adjacent vertices of the picked vertex.
+        // Consider only those vertices which are not
+        // yet included in MST
+        for (int v = 0; v < V; v++)
+
+            // graph[u][v] is non zero only for adjacent vertices of m
+            // mstSet[v] is false for vertices not yet included in MST
+            // Update the key only if graph[u][v] is smaller than key[v]
+            if (graph[u][v] && mstSet[v] == false && graph[u][v] < key[v])
+                parent[v] = u, key[v] = graph[u][v];
+    }
+
+    // print the constructed MST
+    printMST(parent, graph);
+}
+
+// Driver code
+int main()
+{
+    /* Let us create the following graph
+        2 3
+    (0)--(1)--(2)
+    | / \ |
+    6| 8/ \5 |7
+    | / \ |
+    (3)-------(4)
+            9     */
+    int graph[V][V] = { { 0, 2, 0, 6, 0 },
+                        { 2, 0, 3, 8, 5 },
+                        { 0, 3, 0, 0, 7 },
+                        { 6, 8, 0, 0, 9 },
+                        { 0, 5, 7, 9, 0 } };
+
+    // Print the solution
+    primMST(graph);
+
+    return 0;
+}  

Java/boltAndNUt.java

@@ -0,0 +1,68 @@
+public class NutsAndBoltsMatch
+{
+    //Driver method
+    public static void main(String[] args)
+    {
+        // Nuts and bolts are represented as array of characters
+        char nuts[] = {'@', '#', '$', '%', '^', '&'};
+        char bolts[] = {'$', '%', '&', '^', '@', '#'};
+
+        // Method based on quick sort which matches nuts and bolts
+        matchPairs(nuts, bolts, 0, 5);
+
+        System.out.println("Matched nuts and bolts are : ");
+        printArray(nuts);
+        printArray(bolts);
+    }
+
+    // Method to print the array
+    private static void printArray(char[] arr) {
+        for (char ch : arr){
+            System.out.print(ch + " ");
+        }
+        System.out.print("n");
+    }
+
+    private static void matchPairs(char[] nuts, char[] bolts, int low, 
+                                                              int high)
+    {
+        if (low < high)
+        {
+            int pivot = partition(nuts, low, high, bolts[high]);
+
+
+            partition(bolts, low, high, nuts[pivot]);
+
+
+            matchPairs(nuts, bolts, low, pivot-1);
+            matchPairs(nuts, bolts, pivot+1, high);
+        }
+    }
+
+
+    private static int partition(char[] arr, int low, int high, char pivot)
+    {
+        int i = low;
+        char temp1, temp2;
+        for (int j = low; j < high; j++)
+        {
+            if (arr[j] < pivot){
+                temp1 = arr[i];
+                arr[i] = arr[j];
+                arr[j] = temp1;
+                i++;
+            } else if(arr[j] == pivot){
+                temp1 = arr[j];
+                arr[j] = arr[high];
+                arr[high] = temp1;
+                j--;
+            }
+        }
+        temp2 = arr[i];
+        arr[i] = arr[high];
+        arr[high] = temp2;
+
+
+        return i;
+    }
+}