Implementation of Advanced Data Structures, Number Theory, and Advanced Search Algorithms

[Lighting-pixel]

1. Advanced Data Structures

• Disjoint Set Union (Union-Find): Efficient data structure to track the union of disjoint sets.
• Segment Trees: Used for efficient range queries.
• Fenwick Tree (Binary Indexed Tree): A more space-efficient data structure for cumulative frequency tables.

2. Number Theory Algorithms

• Greatest Common Divisor (GCD) and Least Common Multiple (LCM): Fundamental algorithms for divisibility.
• Sieve of Eratosthenes: Efficient algorithm to find all prime numbers up to a given limit.
• Modular Arithmetic: Core operations and algorithms for modularity, which are essential in cryptography and number theory.

3. Combinatorial Algorithms

• Combinatorial algorithms such as Permutations, Combinations, and Binomial Coefficients with implementations.

4. Advanced Search Algorithms

A new section dedicated to advanced search techniques:

• *A Search Algorithm**: A powerful pathfinding and graph traversal algorithm widely used in AI and game development.

These updates will ensure a more comprehensive collection of data structures and algorithms for all learners and developers.

[github-actions[bot]]

👋 Hello @Lighting-pixel, welcome!

Thank you for opening this issue. We appreciate your effort in helping to improve our Algo project. Our team will review it shortly. In the meantime, if you can provide any additional information or context, feel free to update this issue.

Please refer to our CONTRIBUTING.md for guidelines on contributing to this project.

Thank you for your contribution! 🚀😊

[Lighting-pixel]

please assign me this issue under hacktoberfest and gssoc extd. @ajay-dhangar

[Lighting-pixel]

@ajay-dhangar could you pls assign me this as level 2