implementation of algorithms and few problems

1. Disjoint Set(Union and Find)
2. Lowest Common Ancestor of a Binary Tree
3. Binary Search
   • lower bound search
4. Merge Sort List
5. Add two Binary Number stored in two n-element arrays A and B.
6. Abstract Factory Pattern.