Please enable JavaScript.
Coggle requires JavaScript to display documents.
Data Structures and Algorithms - Coggle Diagram
Data Structures and Algorithms
Algorithm Analysis
Big O
Time Complexity
how long
takes to run
Spacial Complexity
how much
RAM or disk space
Linear
O(n)
Logrithmic
O(log n)
Quadratic
O(n²)
Constant
O(1)
Sorting algorithms
Recursive Sort
Merge Sort
Quick Sort
Non-comparison Sort
Radix Sort
Iterative Sort
Bubble Sort
Insertion Sort
Data Structures
Lists
Array List
dynamic
size increase
Linked List
Types
Single LL
Double LL
Trees
BST
AVL Tree
Traversals Tree
Depth First
Inorder Traversal
Postorder Traversal
Preorder Traversal
Breadth First
Graphs
Pathfinding
Shortest Way from A to B
Neat algorithm
Dijkstra algorithm
Tries
Bloom Filters
Heap
is an array
represents a tree
Max heap
Root node
Largest in the heap
Min heap
Root node
Smallest in the heap