Re: Help needed for ada package
- From: tmoran@xxxxxxx
- Date: Tue, 26 Jul 2005 12:31:39 -0500
If you are a humanities major just trying to pass a required science
course, and just want something to barely "get by", forget priority queues
and databases and just use arrays. If there aren't many citizens that
will work fine in both speed and storage. If type ID is (<>); is for
instance "range 1 .. 100" just declare your arrays with ID as their
subscripts. If ID is too big (eg, Integer), you can have a separate
lookup list to translate between ID and a (small) subscript value.
Even the "find all the associates of all the associates of ... of all
the associates of X can be done with a simple recursion and a check-off
list of citizens already looked at.
In general, sitting back and asking "what information is required here?"
is a better start than "which of these complicated tools that I don't
really understand all that well, should I use?". OTOH, be aware that more
than one dot-com company started with a simple implementation cooked up in
a dorm room that turned out not to scale up.
.
- References:
- Re: Help needed for ada package
- From: strictly_mk@xxxxxxxxxxx
- Re: Help needed for ada package
- Prev by Date: Re: Help needed for ada package
- Next by Date: Re: Memory management clarification
- Previous by thread: Re: Help needed for ada package
- Next by thread: Re: Help needed for ada package
- Index(es):