可用数据结构之间的比较 [英] Comparison between available datastructures

问题描述

任何人都可以建议任何文章或参考材料，这些文章或参考材料可以指导我了解与链表，堆栈，队列，地图，向量等不同数据结构的效率，搜索时间等有关的利弊.何时使用.
我尝试搜索Google，但仍然找不到任何帮助.
任何人都可以通过提供地图和链接列表之间的比较来帮助我吗?(在比较时使用)

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)

推荐答案

Wikipedia可以给您带来好处开始:
数据结构 [数据结构列表 [ ^ ]
只需阅读有关链表，二叉树，哈希表，集合，映射等的文章.
他们还提供了一些有关基本操作的时间效率的比较信息.
但是对于现实生活的编程，您应该考虑简短描述的STL容器，例如，在这里: STL容器概述 [^ ]

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[^]

有一系列昂贵的书籍

唐纳德·克努斯(Donald Knuth)，《计算机编程的艺术》

许多人认为这是基本数据结构和算法描述的圣经".这是一本由3本书组成的系列，我特别推荐

第1卷:基本算法

和

第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.

看看Robert Sedgewick的书或Cormen的算法简介. /> (我将谷歌搜索留给您).

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

这篇关于可用数据结构之间的比较的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！