-
Notifications
You must be signed in to change notification settings - Fork 5k
READY TO REVIEW: Bucket Sort #96
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
Conversation
Hi @hollance just an update: I have added changes but I'm still not finished here. I need to prepare the documention. |
Sure, just let me know when it's done. :-) |
…n failure). Adding OSX like target. Using the null identity for signing
@hollance I'm done with this, it's ready to review. I'll go back to see your comments next week, Thursday / Friday. thanks! |
Cool, I'll look at it soon. :-) |
I had a quick look and I think the explanation needs some work. It looks like you took some things from Wikipedia. It would be better to describe these things in your own words (otherwise people might just as well check out Wikipedia). I always like to work through an example step-by-step. That lets you describe the algorithm but also makes it easy for readers to follow along. |
Hi Hollance, I like reusing knowledge and Wikipedia is a good source of Barbara Skype: barbararodeker On Fri, Apr 15, 2016 at 4:44 PM, Matthijs Hollemans <
|
"Re-explaining the algorithm in other words" is pretty much the idea behind this project. ;-) I often don't find the Wikipedia explanations very clear and so I try to do a better job (but one that is probably less academically rigorous). [And to be honest, writing down the explanation in my own words, and including step-by-step examples makes me understand the algorithm better too.] It's OK if you want to leave the explanation in its current state, but then I'll probably end up editing it quite a bit (which I do with most pull requests anyway). It may be a while before I get around to that. |
Hi Hollance, I'm coming back to this. |
Awesome, thanks. I'll look at it soon! :-) |
I'll be working on this sorting algorithm.