Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with performance
Search options answers only
not deleted
user 6654
Questions related to improving application performance, this can be range from selection software architecture to selection of algorithms.
2934
votes
Accepted
Which hashing algorithm is best for uniqueness and speed?
I tested some different algorithms, measuring speed and number of collisions.
I used three different key sets:
A list of 216,553 English words 🕗archive(in lowercase)
The numbers "1" to "216553" (th …
- 25k