I would like to store an input of tab separated values where say C1, C2, C3 and C4 represent the columns of the data and there are N rows of data. If so, I could do lookups in the hash to see if some given values for C1,C2,C3,C4 exist. Someone suggested to me that, in the worst case, the space complexity of this was N4. I would like help formulating a clear explanation as to why that is not true.
space complexity of multi-dimensional hash
346 Views Asked by harschware At
1
There are 1 best solutions below
Related Questions in HASH
- What is a runtime environment for supposedly "no-overhead" systems languages?
- What do you call a thread's "ancestry"?
- What does it mean for a language to be open source?
- How to eliminate division inside code like "a/b>c/d"?
- Error reporting in a recursive descent parser
- How do I get tabs to copy properly in Netbeans?
- Statistical method to know when enough performance test iterations have been performed
- Greedy algorithm: highest value first vs earliest deadline first
- Algorithm: Best way to create solve this algorithm scenario
- Waiting for two subprocesses to finish but not necessarily waiting for first
Related Questions in HASHTABLE
- What is a runtime environment for supposedly "no-overhead" systems languages?
- What do you call a thread's "ancestry"?
- What does it mean for a language to be open source?
- How to eliminate division inside code like "a/b>c/d"?
- Error reporting in a recursive descent parser
- How do I get tabs to copy properly in Netbeans?
- Statistical method to know when enough performance test iterations have been performed
- Greedy algorithm: highest value first vs earliest deadline first
- Algorithm: Best way to create solve this algorithm scenario
- Waiting for two subprocesses to finish but not necessarily waiting for first
Related Questions in BIG-O
- What is a runtime environment for supposedly "no-overhead" systems languages?
- What do you call a thread's "ancestry"?
- What does it mean for a language to be open source?
- How to eliminate division inside code like "a/b>c/d"?
- Error reporting in a recursive descent parser
- How do I get tabs to copy properly in Netbeans?
- Statistical method to know when enough performance test iterations have been performed
- Greedy algorithm: highest value first vs earliest deadline first
- Algorithm: Best way to create solve this algorithm scenario
- Waiting for two subprocesses to finish but not necessarily waiting for first
Related Questions in MULTIDIMENSIONAL-ARRAY
- What is a runtime environment for supposedly "no-overhead" systems languages?
- What do you call a thread's "ancestry"?
- What does it mean for a language to be open source?
- How to eliminate division inside code like "a/b>c/d"?
- Error reporting in a recursive descent parser
- How do I get tabs to copy properly in Netbeans?
- Statistical method to know when enough performance test iterations have been performed
- Greedy algorithm: highest value first vs earliest deadline first
- Algorithm: Best way to create solve this algorithm scenario
- Waiting for two subprocesses to finish but not necessarily waiting for first
Related Questions in SPACE-COMPLEXITY
- What is a runtime environment for supposedly "no-overhead" systems languages?
- What do you call a thread's "ancestry"?
- What does it mean for a language to be open source?
- How to eliminate division inside code like "a/b>c/d"?
- Error reporting in a recursive descent parser
- How do I get tabs to copy properly in Netbeans?
- Statistical method to know when enough performance test iterations have been performed
- Greedy algorithm: highest value first vs earliest deadline first
- Algorithm: Best way to create solve this algorithm scenario
- Waiting for two subprocesses to finish but not necessarily waiting for first
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular # Hahtags
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
The other person is thinking that if you try to store an N by N grid of points, there will be N4 points to store.
But if you have N points, then you're just storing a hash. And a hash with N data points typically takes O(N) space. (Technically it takes the size of the hash table plus the space for the data, but people usually dynamically size the hash table to be the same order of magnitude size as the data set.)