Added A new problem of minimum coins in Greedy Algo

Author: shikharp16

Greedy/MinimumCoins/mincoins.cpp

@@ -0,0 +1,37 @@
+#include <bits/stdc++.h> 
+using namespace std; 
+  
+// All denominations of Indian Currency 
+int deno[] = {1, 2, 5, 10, 20, 50, 100, 500, 1000}; 
+int n = sizeof(deno)/sizeof(deno[0]); 
+  
+// Driver program 
+void findMin(int V) 
+{ 
+    // Initialize result 
+    vector<int> ans; 
+  
+    // Traverse through all denomination 
+    for (int i=n-1; i>=0; i--) 
+    { 
+        // Find denominations 
+        while (V >= deno[i]) 
+        { 
+           V -= deno[i]; 
+           ans.push_back(deno[i]); 
+        } 
+    } 
+  
+    // Print result 
+    for (int i = 0; i < ans.size(); i++) 
+           cout << ans[i] << "  "; 
+} 
+  
+// Driver program 
+int main() 
+{ 
+   int n;
+   cin>>n;
+   cout << "Following is minimal number of change for " << n << " is "; 
+   findMin(n); 
+   return 0;