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 terminology
Search options not deleted
user 4251
Questions about how specific notions have to be understood as well as conventions of notation.
8
votes
2
answers
12k
views
How does taking modulo 1 make sense?
I need some help understanding the problem statement in CLRS 11.3-4 pg 269. It says:
Consider a hash table of size $m = 1000$ and a corresponding hash function
$ h(k) =\left \lfloor m(kA \bmo …
- 340
2
votes
Accepted
How does taking modulo 1 make sense?
Thanks to for clarifying mod 1 concept , for constant $\mathcal{A}$ I got the proper explanation in CLRS itself it says :
Although this method works with any value of the constant $\mathcal{A}$, it wo …
- 340