From a memory usage point of view, an array is pretty tightly packed. What
kind of data are we talking .. strings?
As far as searches go -- What an array might not be good at would be speed
of browsing thru the list. A Hashtable or a NameValueCollection (strings
only) has an associated btree structure that makes browsing thru that data a
lot quicker, i.e, hashtable[key] is probably a lot quicker than opening very
element in an array and doing a walkthru basically. But really what is a
sort in either a hashtable or a nvc.
As far as sorting goes, it depends to a great extent on what datatype are
you sorting on -- so what datatype are you doing sorting on?
- Sahil Malik
You can reach me thru my blog at
http://www.dotnetjunkies.com/weblog/sahilmalik
"able" <ab**@epost.no> wrote in message
news:8A*****************@news4.e.nsc.no...
Dear friends
I have loaded a huge amount of data in an two domensional array. I need
to do a lot searching in the array and sorting the array. My question is if
an array is the most apropriate for this task? May be ArrayList or something
else is a better object? Some adwise?
Regards Able