Add Quick-Find.

Author: manosriram

Disjoint-Sets/_quickFind.hpp

@@ -0,0 +1,32 @@
+// Quick-Find: O(1) for Find and O(n) for Union.
+
+class DisjointSet {
+public:
+ int *_set, n;
+
+ DisjointSet(int n) {
+ _set = new int[n];
+ this->n = n;
+ }
+
+ void makeSet(int m) {
+ _set[m] = m;
+ return;
+ }
+ 
+ int find(int m) {
+ return _set[m];
+ }
+
+ void Union(int a, int b) {
+ int in = _set[a];
+ int IN = _set[b];
+
+ for (int t=0;t<this->n;++t) {
+ if (this->_set[t] == in)
+ this->_set[t] = IN;
+ }
+ return;
+ }
+};
+

Disjoint-Sets/DisjointSet.hpp Disjoint-Sets/_quickUnion.hppDisjoint-Sets/DisjointSet.hpp renamed to Disjoint-Sets/_quickUnion.hpp

@@ -0,0 +1,17 @@
+#include <iostream>
+using namespace std;
+#include "_quickFind.hpp"
+
+int main() {
+ unique_ptr<DisjointSet> ds = make_unique<DisjointSet>(6);
+
+ ds->makeSet(1);
+ ds->makeSet(2);
+ ds->makeSet(3);
+ ds->makeSet(4);
+ 
+ cout << ds->find(3) << " ";
+ ds->Union(3, 4);
+ ds->Union(3, 1);
+ cout << ds->find(4) << " ";
+}