Timeline for Determining if a C-style string is alphabetic
Current License: CC BY-SA 3.0
16 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 12, 2024 at 4:57 | answer | added | chux | timeline score: 2 | |
| Mar 29, 2018 at 21:42 | vote | accept | esote | ||
| Mar 29, 2018 at 5:49 | comment | added | Turksarama | You can easily shortcut the function by returning false as soon as you find a non alpha character. | |
| Mar 29, 2018 at 1:23 | history | edited | Jamal | CC BY-SA 3.0 |
deleted 33 characters in body; edited title
|
| Mar 28, 2018 at 23:49 | history | tweeted | twitter.com/StackCodeReview/status/979143554097348614 | ||
| Mar 28, 2018 at 18:20 | comment | added | Cort Ammon | I don't have time to put together a solution myself, but there may be an interesting approach using perfect hashing and the machine's native word size. If you could operate on strings in 4 or 8 character chunks, that could be significant enough to warrant the extra opcodes needed to produce the hash. | |
| Mar 28, 2018 at 17:21 | history | edited | esote | CC BY-SA 3.0 |
Fixed header misspelling, edit about double negation
|
| Mar 28, 2018 at 16:06 | answer | added | Roman Odaisky | timeline score: 1 | |
| Mar 28, 2018 at 15:34 | answer | added | user2601195 | timeline score: -2 | |
| Mar 28, 2018 at 13:57 | answer | added | nmnir | timeline score: -3 | |
| Mar 28, 2018 at 8:01 | answer | added | user7649 | timeline score: 14 | |
| Mar 28, 2018 at 7:54 | answer | added | Lundin | timeline score: 5 | |
| Mar 28, 2018 at 4:48 | answer | added | vnp | timeline score: 8 | |
| Mar 28, 2018 at 4:46 | answer | added | user1118321 | timeline score: 9 | |
| Mar 28, 2018 at 3:10 | history | edited | esote | CC BY-SA 3.0 |
added 131 characters in body
|
| Mar 28, 2018 at 2:48 | history | asked | esote | CC BY-SA 3.0 |