First - I'm "cross-posting" this ques. under Pascal and Java - someone may want to flame me for doing so - but I can't find the "rules" on "cross-posting" for this site.
Anyway, regarding different data structures and the time it takes to search, insert, deleting, etc. - what is the most efficient structure and why? I'm working on a project where I'm using a B-tree, but I'm just wondering if there is something better. I have to be able to do both types of functions - retrieve data and manipulate data - search, and add/dele, etc.
Any ideas? And can you explain your reasoning?
Also - if you take the time and give a thoughtful answer, please let me know what number of points should be awarded. I'm still getting used to how everyone weighs their questions - I haven't found any logic. I think it may be an easy answer for someone - I myself find it more difficult, otherwise I wouldn't be asking the question. So if you can help me out, I'm willing to give you whatever points are really deserved.
If you need more explanation as for the program/project let me know, but I'm really looking for what is the most efficient data structure.
Thanks - Dawn D.