Skip to content

Translated Joseph's Problem #294

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

Merged
merged 4 commits into from
Oct 6, 2018
Merged

Conversation

singamandeep
Copy link
Contributor

No description provided.

@jakobkogler
Copy link
Member

Thanks a lot for the translation.

I replaced the explanation for the k log(n) algorithm. I didn't understand at all why the formula worked using that explanation. (Not your fault, I don't understand the original russian one either).
I checked out Wikipedia and added a modified version of their explanation, which makes sense.

I hope your fine with that. Otherwise we can revert to your version.

@jakobkogler jakobkogler merged commit 6bed0a0 into cp-algorithms:master Oct 6, 2018
@singamandeep
Copy link
Contributor Author

Yes it is easy to understand it now. No, I don't have any problem it would be better to keep this version.

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

Successfully merging this pull request may close these issues.

2 participants
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy