Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Requirement for new codes. #6

Open
dragonslayerx opened this issue Jun 8, 2017 · 2 comments
Open

Requirement for new codes. #6

dragonslayerx opened this issue Jun 8, 2017 · 2 comments

Comments

@dragonslayerx
Copy link
Owner

dragonslayerx commented Jun 8, 2017

This library is not exhaustive as it still needs several key algorithms and data structures which are widely used in Competitive Programming. The lack is partially due to my lack of knowledge about them or
my laziness to implement and test them.

I'm listing some of the key algorithms here which this library needs.

  1. A simple concise implementation of Centroid Decomposition, Bridge trees.
  2. Knuth Morris Pratt (KMP), Manacher, Aho corasick : One can find an obselete code of kmp in obselete folder, I have used it several time but code is not concise.
  3. A library for Computational Geometry including some key algorithms like finding convex hull of a set of points.

Any new cool completive programming template is also welcome ! Please report bugs in case u get one during using any of the template.

I would like to invite competitive programming enthusiasts to contribute to this library and let the knowledge grow. :)

@Malvikabhalla99
Copy link
Contributor

i would like to take up this issue

@amberprice-stack
Copy link

Can i add more sorting algorithms?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

3 participants