You’ve Seen DSA Before
4 data structures in python
- dictionary
- list
- tuple
- set
java
- array list
- hashmap
- hashtable
- etc
Cont.
Algorithm
→ has to run for finite steps
- some examples of infinite loops can be video games and drones
→ Precise
→ (receive) Input/Output
Primitive DS: Array, Linked List, Tree
- Every existing data structure queue, stack, etc will be built on top of one of these.
Array - Linear allocation of memory, static, indexed
Linear Search Linear Search
- Element by element in order
- Shows up on every single data structure but not necessary with that name (preorder in a tree)
Next: Runtime Operations