Merge pull request #1916 from rayeenshoaib/patch-34

Bell numbers using DP

Author: shoaibrayeen

Dynamic Programming/Bell Numbers/SolutionByShoaib.cpp

@@ -0,0 +1,21 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int bellNumber(int n) { 
+ int bell[n+1][n+1]; 
+ bell[0][0] = 1; 
+ for (int i=1; i<=n; i++) {
+ bell[i][0] = bell[i-1][i-1]; 
+ for (int j=1; j<=i; j++) 
+ bell[i][j] = bell[i-1][j-1] + bell[i][j-1]; 
+ } 
+ return bell[n][0]; 
+} 
+int main () {
+ cout << "\nEnter Number\t:\t";
+ unsigned int number;
+ cin >> number;
+ cout <<"\nThe result is\t:\t" << bellNumber(number);
+ cout << endl;
+ return 0;
+}