Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion lectures/numba.md
Original file line number Diff line number Diff line change
Expand Up @@ -555,7 +555,7 @@ Now let's see how fast it runs:
%time calculate_pi()
```

If we switch of JIT compilation by removing `@njit`, the code takes around
If we switch off JIT compilation by removing `@njit`, the code takes around
150 times as long on our machine.

So we get a speed gain of 2 orders of magnitude--which is huge--by adding four
Expand Down
5 changes: 3 additions & 2 deletions lectures/scipy.md
Original file line number Diff line number Diff line change
Expand Up @@ -63,7 +63,8 @@ from numpy.fft import fft, ifft
from numpy.lib.scimath import *
```

However, it's more common and better practice to use NumPy functionality explicitly
However, it's more common and better practice to use NumPy functionality explicitly.


```{code-cell} python3
import numpy as np
Expand Down Expand Up @@ -442,7 +443,7 @@ We leave you to investigate the [set of available routines](http://docs.scipy.or
(sp_ex1)=
### Exercise 1

Previously we discussed the concept of {ref}`recursive function calls <recursive_functions>`.
In {ref}`this lecture <python_advanced_features>`, we will discuss the concept of {ref}`recursive function calls <recursive_functions>`.

Try to write a recursive implementation of homemade bisection function {ref}`described above <bisect_func>`.

Expand Down