diff --git a/Algorithms/dynamic_programming/LongestIncreasingSub - nLogn.cpp b/Algorithms/dynamic_programming/LongestIncreasingSub - nLogn.cpp
new file mode 100644
index 0000000..6f1237d
--- /dev/null
+++ b/Algorithms/dynamic_programming/LongestIncreasingSub - nLogn.cpp	
@@ -0,0 +1,26 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+#define INF 1e9
+
+/* Finds longest increasing subsequence in O(N logN) time, using binary search */
+
+int main(){
+	int n;
+	cin >> n;
+	
+	vector<int> A(n);
+	vector<int> lis(n+1, INF);
+	
+	for(int i=0;i<n;i++) cin >> A[i];
+	
+	/* for non-decreasing subsequence, change lower_bound to upper_bound */
+	for(int i=0;i<n;i++) *lower_bound(lis.begin(), lis.end(), A[i]) = A[i];
+	
+	for(int i=0;i<=n;i++) 
+		if(lis[i] == INF) { 
+			cout << i ; 
+			break;
+		}
+	
+}
diff --git a/Data Structures/disjoint_sets/small_disjoint_set.cpp b/Data Structures/disjoint_sets/small_disjoint_set.cpp
new file mode 100644
index 0000000..c3c4108
--- /dev/null
+++ b/Data Structures/disjoint_sets/small_disjoint_set.cpp	
@@ -0,0 +1,33 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+// Fast implementation of disjoint sets
+
+int par[1000];
+
+int find(int i){
+	return par[i] = (par[i]==i)? i : find(par[i]);	
+}
+
+int unite(int i, int j){
+	if(find(i) < find(j))
+		swap(i, j);
+	par[i] = find(par[j]);
+}
+
+int main(){
+	int n = 10;
+	
+	for(int i=0;i<=n;i++) par[i] = i;
+	
+	unite(1, 2);
+	unite(2, 5);
+	unite(3, 4);
+	
+	if(find(1) == find(5))
+		cout << "1 and 5 are connected.\n";
+	
+	if(find(3) != find(1))
+		cout << "3 and 1 are disconnected.\n";
+	
+}