Java VS C

yeah I agree. I think it's because they pretty much allow contributions of algorithms from various people and the code review standards are not super high. I recall at one point the BFS algorithm in Java actually used an ArrayList (roughly equivalent to std::vector) for the queue, which is silly because popping from the front is O(N), so I had to submit a fix for that:

https://github.com/TheAlgorithms/Java/pull/3231

but I agree that basic low-hanging issues like this (and the exponential-time fibonacci that another commenter pointed out) really prevents me from taking this repo very seriously

here you can use of the ciphers

I would start by learning about base class libraries: What is java and then study how some algorithms might be implemented by looking at this repository

C: https://github.com/TheAlgorithms/C/blob/master/sorting/merge_sort.c

prime.c

I like the awesome-algorithms link, but some of the code linked is definitely not perfect. A few questionable things from one of the header files [0] in https://github.com/TheAlgorithms/C:

- Defines a macro with no parentheses

- Uses unsigned for length and capacity (should be size_t)

- Uses () instead of (void) for an empty parameter list

- Useless use of "extern" for function declarations

- I think that leading double underscores and structures ending with _t are reserved identifiers, but I don't really have a good source for this

[0]: https://github.com/TheAlgorithms/C/blob/master/data_structur...