Andrii Siriak
Andrii Siriak
@Panquesito7
@sparsh9 sounds great!
@antonAce added LU decomposition to the list, feel free to implement those or any other algorithms :D
@hebero I've added them to the list. It would be great if you could implement some of them in case you happen to have some spare time for that of...
> I could implement the Boyer-Moore algorithm and additionally the Rabin-Karp algorithm (in my opinion it's the easiest way to find a substring) Cool, go ahead!
@NikitaYermak added [Luhn algorithm](https://en.wikipedia.org/wiki/Luhn_algorithm)
@simolab99 Aliquot Sum - definitely Perfect Cube - a sequence of perfect cubes? Why not, looks interesting Perfect Number - yes Perfect Square - same as the perfect cube Prime...
Hi @ivanruski, sure thing! I've added Binary search tree to the list.
@rohansp you can take any algorithm/data structure that's not implemented yet and implement it.
You can check a list in README.md or browse directories in the repository and see in files. Also, [here](https://github.com/TheAlgorithms/C-Sharp/issues/112#issue-490317986) not implemented data structures are unchecked.