2.3 algorithms Flashcards
1
Q
linear search
A
2
Q
binary search
A
3
Q
bubble sort
A
4
Q
insertion sort
A
5
Q
merge sort
A
6
Q
quick sort
A
7
Q
dijkstra’s
A
8
Q
A*
A
-uses heuristic
9
Q
in-order traversal
A
LNR
10
Q
post-order traversal
A
LRN
-aka depth first traversal
-useful for operations with calculations (involving with brackets)
11
Q
pre-order traversal
A
NLR
-explore the closest solution to the root layer
11
Q
breadth-first traversal
A
parent layer then the children layer
12
Q
graphs
A
components of graph:
-edges and arcs
-nodes and vertices
-weigh
types of graph:
-simple
-connected
-complete
-directed : unidirectional/bidirectional
13
Q
trees
A
-parent and children
-considered a type of simply connected graph
-binary tree : only have 0/1/2 children for every parent node
