Algorithm Analysis Flashcards
1
Q
data structure
A
systematic way of organizing & accessing data
2
Q
algorithm
A
step-by-step procedure for performing some task in finite time
3
Q
primitive operation
A
execution time is constant (low-level instruction)
4
Q
examples of primitive operations
A
- assigning identifier to object
- arithmetic operation
- comparing 2 numbers
- accessing single element of Python list by index
- length of Python list
- calling a function
- returning from a function
