Index
A
Abstract data structures
Abstractions
Access attributes
add_two function
Algorithmic efficiency
amortized complexity
add elements
analysis
append operation
banker’s method
cheap operation
data structures
expensive operation
individual operation
memory layout
operations
potential method
Python’s lists
rule
space
statistical properties
analysis
guessing game
if statement
operations
running time
best-case scenario
data size
empirical
input data
input size
measurement uncertainty
plotting
range
sleep() function
theoretical
validation
variable-size data
worst-case scenario
sequence of numbers
types
average-case complexity
best-case complexity
worst-case complexity
Algorithms
abstraction level
checking
combining
comparing
comparison-based
complexity
computational problem
cryptographic protocols ...
Get Introduction to Computational Thinking: Problem Solving, Algorithms, Data Structures, and More now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
