Think Python: How to Think Like a Computer Scientist

Semantic Errors In some ways, semantic errors are the hardest to debug, because the interpreter provides no informa ...

My program doesn’t work. You should ask yourself these questions: Is there something the program was supposed to ...

I’ve got a big hairy expression and it doesn’t do what I expect. Writing complex expressions is fine as long ...

I’ve got a function that doesn’t return what I expect. If you have a return statement with a comp ...

I’m really, really stuck and I need help. First, try getting away from the computer for a few minutes. Co ...

No, I really need help. It happens. Even the best programmers occasionally get stuck. Sometimes you work ...

...

Chapter 21. Analysis of Algorithms This appendix is an edited excerpt from Think Complexity, by Allen B. ...

proportional to the size of the input, n, and Algorithm B tends to be proportional to n^2 , then I ex ...

Order of Growth Suppose you have analyzed two algorithms and expressed their runtimes in terms of the size ...

algorithmic analysis, in increasing order of badness. Order of growth Name O(1) constant logarithmic (for any b) O( ...

But if you keep those caveats in mind, algorithmic analysis is a useful tool. At least for large problems ...

Analysis of Basic Python Operations In Python, most arithmetic operations are constant time; multiplication usua ...

Sorting is . Most dictionary operations and methods are constant time, but there are some exceptions: The runtim ...

Analysis of Search Algorithms A search is an algorithm that takes a collection and a target item and dete ...

Hashtables To explain how hashtables work and why their performance is so good, I start with a simple impleme ...

def __init__(self, n=100): self.maps = [] f ...

self.resize() self.maps.add(k, v) ...

Figure 21-1 shows how this works graphically. Each block represents a unit of work. The columns show ...

Glossary analysis of algorithms: A way to compare algorithms in terms of their runtime and/or space requirement ...