Presentations
Templates
Features
Teams
Pricing
Log in
Sign up
Log in
Sign up
Menu
Data structures efficiency
Telerik Academy Alpha
DSA
Table of contents
Comparing data structures
Choose the right data structure
Summary
Comparing Data Structures
Big-O
Comparison of operations
Array sorting comparison
More information
More information
http://cooervo.github.io/Algorithms-DataStructures-BigONotation/
http://bigocheatsheet.com/
Choosing a data structure
Choosing the right data structure
Arrays (T[])
Use when fixed number of elements should be processed by index
Resizable array lists (List<T>)
Use when elements should be added and processed by index
Linked lists (LinkedList<T>)
Use when elements should be added at the both sides of the list
Otherwise use resizable array list (List<T>)
Choosing the right data structure
Stacks (Stack<T>)
Use to implement LIFO (last-in-first-out) behavior
List<T> could also work well
Queues (Queue<T>)
Use to implement FIFO (first-in-first-out) behavior
LinkedList<T> could also work well
Hash table based dictionary (Dictionary<K,T>)
Use when key-value pairs should be added fast and searched fast by key
Elements in a hash table have no particular order
Choosing the right data structure
Balanced search tree based dictionary (SortedDictionary<K,T>)
Use when key-value pairs should be added fast, searched fast by key and enumerated sorted by key
Hash table based set (HashSet<T>)
Use to keep a group of unique values, to add and check belonging to the set fast
Elements are in no particular order
Search tree based set (SortedSet<T>)
Use to keep a group of ordered unique values
Summary
Summary
Algorithm complexity is
rough
estimation of the
number of steps
performed by given computation
Complexity can be
l
o
g
a
r
i
t
h
m
i
c
logarithmic
l
o
g
a
r
i
t
hmi
c
l
i
n
e
a
r
linear
l
in
e
a
r
n
∗
l
o
g
n
n* log n
n
∗
l
o
g
n
s
q
u
a
r
e
square
s
q
u
a
re
c
u
b
i
c
cubic
c
u
bi
c
e
x
p
o
n
e
n
t
i
a
l
exponential
e
x
p
o
n
e
n
t
ia
l
e
t
c
.
etc.
e
t
c
.
Summary
Allows to estimating the speed of given code before its execution
Different data structures have different efficiency on different operations
The
fastest
add / find / delete
structure is the hash table -
O(1)
for all these operations
Questions?
Resume presentation
Data structures efficiency Telerik Academy Alpha DSA
[C# DSA] Data structures efficiency
By telerikacademy
Made with Slides.com
[C# DSA] Data structures efficiency
8 years ago
1,100
telerikacademy
More from
telerikacademy
