User talk:Dkf11

Rabin–Karp string search algorithm
In response to User_talk:OMouse: I removed the simple algorithm because it is obvious that the Rabin-Karp algorithm is an improvement on it. There should be a wikilink to that simple string search algorithm perhaps, but I stand by the removal of it. I forgot to change the rest of the text to remove references to this unnecessary example. --OMouse (talk) 22:04, 6 January 2010 (UTC)


 * Well, as I noted on your talk page, you should have then rewritten the rest of that section to not be so dependent on the text that you removed. That you didn't, well, it was poor editing. I've no particular commitment to having the simple algorithm there, but such clean up jobs need to be done carefully. (It's not like you fixed things up afterwards either; it was just a deletion of a chunk of text parachuted in without regard for the rest.) Please, for the good of all, sharpen up. Smarter editing is better editing. –Donal Fellows (talk) 22:38, 10 January 2010 (UTC)


 * You are correct. I was making edits to other algorithms-related pages and I can assure you I tried to be much more careful. That was my first go at editing an algorithms page in a long time. I'll make sure to review my own edits before posting them. Thanks for the reminder to be careful! --OMouse (talk) 16:12, 11 January 2010 (UTC)


 * No worries. It's just the usual issues relating to embarking on a big project. Had it been less than a week from your edit, I'd have just contacted you to ask what was up rather than reverting. Several months though (and no comment on either the talk page, your user page, or your talk page) and I couldn't tell that it was a partial edit. Still, no permanent damage done and I agree that it would probably have been better long-term to not have the simple algorithm there (and certainly not higher in the page than the real one). In other words, I agree with your basic plan, but the execution of it was only partial (which was what I was complaining about). There probably ought to be a page that compares the various string searching algorithms, discussing the trade-offs involved with selection of each one (and noting how they interact with modern computers; my local experimentation indicates that the simple algorithm is often pretty good because it works very well with L1 data caches) but that is a big project, particularly as it requires sourcing all the trade-offs in the literature. Meh. I have too many other things to do, alas… –Donal Fellows (talk) 09:49, 12 January 2010 (UTC)

Wikipedia at the University of Manchester
Dear Dkf11,

The WP:CONTRIB team are holding an event at the University of Manchester in the first week of March. The event aims to spread the love of Wikipedia as well as encourage other people to edit and also answer any questions people may have about us and what we do. We'd love to have you so if you are interested please sign up at http://en.wikipedia.org/wiki/Wikipedia:Contribution_Team/Events or reply to this email!

We hope to hear from you soon and happy editing!

Thanks

Ironholds

ArbCom elections are now open!
Hi, You appear to be eligible to vote in the current Arbitration Committee election. The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to enact binding solutions for disputes between editors, primarily related to serious behavioural issues that the community has been unable to resolve. This includes the ability to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail. If you wish to participate, you are welcome to review the candidates' statements and submit your choices on the voting page. For the Election committee, MediaWiki message delivery (talk) 13:35, 24 November 2015 (UTC)