adding LIS algorithm

Author: varunsingh005

longestIncreasingSubsequence.cpp

@@ -0,0 +1,25 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+int lis(int arr[], int n)
+{
+	int lis[n];
+	lis[0] = 1;
+	for(int i=0; i<n; ++i)
+	{
+		lis[i] = 1;
+		for(int j=0; j<i; ++j)
+			if(arr[i] > arr[j] && lis[j] + 1 > lis[i])
+				lis[i] = lis[j] + 1;
+	}
+	return lis[n-1];
+}
+
+int main()  
+{  
+    int arr[] = { 10, 22, 9, 33, 21, 50, 41, 60 };  
+    int n = sizeof(arr)/sizeof(arr[0]);  
+    printf("Length of lis is %d\n", lis( arr, n ) );  
+    return 0;  
+}