Comparison between available datastructures

Question

3.67/5 (3 votes)

See more:

Can anyone suggest any articles or reference material which guides me through the pros and cons related to efficiency,search time etc. of different datastructures like linked list, stacks , queues, maps ,vectors etc. So that I am able to decide which to use when.
I have tried searching google but still not able to find anything of help.
Can anyone please help me by providing a comparison between a map and a linked list?(which to use when kind of a comparison)

Posted 4-Apr-12 21:07pm

Member 8576081

Add a Solution

Comments

Sergey Alexandrovich Kryukov 5-Apr-12 3:15am

Between a map and a linked list?! Simply makes no sense. Who told you that things can be "compared", generally?
--SA

4 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Sergey Chepurin · Answer 1 · 2012-04-04T23:09:00

Solution 2

Wikipedia can give you are good start:
Data structure[^]
List of data structures[^]
Simply read articles on linked lists, binary trees, hash tables, sets, maps, etc.
They also have some comparison information on time efficiency of basic operations.
But for real life programming you should consider STL containers shortly described, for example, here: STL containers overview[^]

Posted 4-Apr-12 23:09pm

Sergey Chepurin

Updated 4-Apr-12 23:10pm

v2

Comments

Member 8576081 5-Apr-12 5:40am

Thnx for your help..

Sergey Chepurin 5-Apr-12 7:35am

There is a good surprise for you from Wikipedia that i just found "Book:Data structures": http://en.wikipedia.org/wiki/Book:Data_structures

Member 8576081 6-Apr-12 2:13am

@Sergey Chepurin - thanx a lot...the link seems good to start off with and then ill move onto the books referred above.. I really appreciate your help...thanx again.

Sergey Chepurin 6-Apr-12 6:40am

You are welcome.

nv3 · Answer 2 · 2012-04-05T00:41:00

Solution 3

There is a sort of expensive series of books

The Art of Computer Programming, Donald Knuth

which is considered by many as "the bible" of elementary data structures and algorithm description. It's a series of 3 books, of which I particularly recommend

Vol 1: Fundamental Algorithms

and

Vol 3: Sorting and Searching

The series is already a bit oldish, but excellently done and still considered up-to-date.

Posted 5-Apr-12 0:41am

nv3

Comments

Member 8576081 5-Apr-12 7:06am

ok ill try to pick these up and start reading..thnx!

nv3 5-Apr-12 7:42am

You are welcome. Happy reading, and I think you will enjoy it.

Maximilien 5-Apr-12 8:23am

(IMO)
No one enjoy reading Knuth's books, it is torture on a high level.
It is written in antiquated manner and even if the fundamentals are still valid, its presentation makes it useless ; it is not a educational book.

Sergey Chepurin 5-Apr-12 10:47am

I think, he should go to the library to take a look at Knut's books. This is really academic level studying. And it is not clear what for to read these 3 volumes nowadays, if you going to program with STL classes. Not mentioning the price for used ones from 100 USD.

Espen Harlinn 5-Apr-12 8:31am

They are excellent, learning to think never hurt anybody - ok, you might start out with a bruised ego, but you will en up understanding the why of things ...

Member 8576081 6-Apr-12 2:08am

Thanx everyone for your valuable suggestions..

Maximilien · Answer 3 · 2012-04-05T02:25:00

Solution 4

Have a look at Robert Sedgewick's book or Introduction to Algorithms by Cormen.
(I'll leave googling to you).

Posted 5-Apr-12 2:25am

Maximilien

Comments

Espen Harlinn 5-Apr-12 8:35am

Sedgewicks' books are good too, I haven't read Cormen - but my understanding is that it's on the same level of difficulty. IMHO difficult != antiquated

stib_markc · Answer 4 · 2012-04-04T21:25:00

Solution 1

Consider reading STL(Standard Template Library).. You might get an idea..

Posted 4-Apr-12 21:25pm

stib_markc

Comments

Member 8576081 5-Apr-12 5:40am

Thnx!