Extremely easy question about Time to check table look-ups
- From: todaysmulan@xxxxxxxxxxxxx
- Date: 16 Jul 2006 18:26:23 -0700
I am not sure about this, because making a table like this sounds
really stupid
i create a simple 100x100 table called A, with "switch" statements
***
switch(something){
switch(someotherthing){
switch(otherthng){
....}
....}
.....}
***
something really long like that till 100x100 cells are neatly
organized. But each of those cells when processed, again link to
another 100x100 table called B which i also create with "switch"
statements.
if I do a search in that table, I guess (a) my time complexity is O(1),
correct ? (b) I will know there will be other ways to make a table that
would save more memory if you are willing to tell me.Thanks
.
- Follow-Ups:
- Prev by Date: Re: Dynamically Creating Variables in C#
- Next by Date: Re: Extremely easy question about Time to check table look-ups
- Previous by thread: Dynamically Creating Variables in C#
- Next by thread: Re: Extremely easy question about Time to check table look-ups
- Index(es):
Relevant Pages
|
