Several methods to improve python performance
Some solutions to improve python performance.
1. Function call optimization (space span, avoid memory access)
The core point of program optimization is to minimize the span of operations, including the span of code execution time and the span of memory space.
1. Big data summation, use sum
a = range(100000) %timeit -n 10 sum(a) 10 loops, best of 3: 3.15 ms per loop %%timeit ...: s = 0 ...: for i in a: ...: s += i ...: 100 loops, best of 3: 6.93 ms per loop
2. Sum small data, avoid using sum
%timeit -n 1000 s = a + b + c + d + e + f + g + h + i + j + k # 数据量较小时直接累加更快 1000 loops, best of 3: 571 ns per loop %timeit -n 1000 s = sum([a,b,c,d,e,f,g,h,i,j,k]) # 小数据量调用 sum 函数，空间效率降低 1000 loops, best of 3: 669 ns per loop
Conclusion: The sum of big data is highly efficient, and the sum of small data is highly efficient in direct accumulation.
2. For loop optimization to get elements (use stack or register to avoid memory access)
for lst in [(1, 2, 3), (4, 5, 6)]: # lst 索引需要额外开销 pass
The use of indexes should be avoided as much as possible.
for a, b, c in [(1, 2, 3), (4, 5, 6)]: # better pass
Equivalent to directly assigning a value to each element.
def force():
lst = range(4)
for a1 in [1, 2]:
for a2 in lst:
for a3 in lst:
for b1 in lst:
for b2 in lst:
for b3 in lst:
for c1 in lst:
for c2 in lst:
for c3 in lst:
for d1 in lst:
yield (a1, a2, a3, b1, b2, b3, c1, c2, c3, d1)
%%timeit -n 10
for t in force():
sum([t[0], t[1], t[2], t[3], t[4], t[5], t[6], t[7], t[8], t[9]])
10 loops, best of 3: 465 ms per loop
%%timeit -n 10
for a1, a2, a3, b1, b2, b3, c1, c2, c3, d1 in force():
sum([a1, a2, a3, b1, b2, b3, c1, c2, c3, d1])
10 loops, best of 3: 360 ms per loop3. Generator optimization (lookup table instead of operation)
def force(start, end): # 用于密码暴力破解程序
for i in range(start, end):
now = i
sublst = []
for j in range(10):
sublst.append(i % 10) # 除法运算开销较大，比乘法大
i //= 10
sublst.reverse()
yield(tuple(sublst), now)
def force(): # better
lst = range(5)
for a1 in [1]:
for a2 in lst:
for a3 in lst:
for b1 in lst:
for b2 in lst:
for b3 in lst:
for c1 in lst:
for c2 in lst:
for c3 in lst:
for d1 in lst:
yield (a1, a2, a3, b1, b2, b3, c1, c2, c3, d1)
r0 = [1, 2] # 可读性与灵活性
r1 = range(10)
r2 = r3 = r4 = r5 = r6 = r7 = r8 = r9 = r1
force = ((a0, a1, a2, a3, a4, a5, a6, a7, a8, a9)
for a0 in r0 for a1 in r1 for a2 in r2 for a3 in r3 for a4 in r4
for a5 in r5 for a6 in r6 for a7 in r7 for a8 in r8 for a9 in r9)4. Power operation optimization (pow (x, y, z))
def isprime(n):
if n & 1 == 0:
return False
k, q = find_kq(n)
a = randint(1, n - 1)
if pow(a, q, n) == 1: # 比使用 a ** q % n 运算优化数倍
return True
for j in range(k):
if pow(a, pow(2, j) * q, n) == n - 1: # a **((2 ** j) * q) % n
return True
return FalseConclusion: pow(x,y,z) is better than x**y%z.
5. Division operation optimization
In [1]: from random import getrandbits In [2]: x = getrandbits(4096) In [3]: y = getrandbits(2048) In [4]: %timeit -n 10000 q, r = divmod(x, y) 10000 loops, best of 3: 10.7 us per loop In [5]: %timeit -n 10000 q, r = x//y, x % y 10000 loops, best of 3: 21.2 us per loop
Conclusion: divmod is better than // and %.
6. Time complexity of optimization algorithm
The time complexity of the algorithm has the greatest impact on the execution efficiency of the program. In python, you can choose an appropriate data structure to optimize the time complexity. For example, the time complexity of searching for a certain element in list and set is O(n) and O( respectively. 1). Different scenarios have different optimization methods. Generally speaking, there are generally ideas such as divide and conquer, branch and bound, and greedy dynamic programming.
7. Reasonable use of copy and deepcopy
For objects of data structures such as dict and list, direct assignment uses reference. In some cases, you need to copy the entire object. In this case, you can use copy and deepcopy in the copy package. The difference between these two functions is that deepcopy copies recursively. Efficiency is different:
In [23]: import copy In [24]: %timeit -n 10 copy.copy(a) 10 loops, best of 3: 606 ns per loop In [25]: %timeit -n 10 copy.deepcopy(a) 10 loops, best of 3: 1.17 us per loop
The -n after timeit indicates the number of runs. The last two lines correspond to the output of the two timeit, the same below. It can be seen that the latter is an order of magnitude slower.
An example about copy:
>>> lists = [[]] * 3 >>> lists [[], [], []] >>> lists[0].append(3) >>> lists [[3], [3], [3]]
What happens is this, [[]] is a one-element list containing an empty list, so all three elements of [[]] * 3 are (point to) this empty list. Modifying any element of lists modifies the list. The modification efficiency is high.
8. Use dict or set to find elements
Python dictionaries and sets are implemented using hash tables (similar to the c++ standard library unordered_map), and the time complexity of finding elements is O(1).
In [1]: r = range(10**7) In [2]: s = set(r) # 占用 588MB 内存 In [3]: d = dict((i, 1) for i in r) # 占用 716MB 内存 In [4]: %timeit -n 10000 (10**7) - 1 in r 10000 loops, best of 3: 291 ns per loop In [5]: %timeit -n 10000 (10**7) - 1 in s 10000 loops, best of 3: 121 ns per loop In [6]: %timeit -n 10000 (10**7) - 1 in d 10000 loops, best of 3: 111 ns per loop
Conclusion: set has the smallest memory footprint and dict has the shortest running time.
9. Reasonable use (generator) and yield (save memory)
In [1]: %timeit -n 10 a = (i for i in range(10**7)) # 生成器通常遍历更高效 10 loops, best of 3: 933 ns per loop In [2]: %timeit -n 10 a = [i for i in range(10**7)] 10 loops, best of 3: 916 ms per loop In [1]: %timeit -n 10 for x in (i for i in range(10**7)): pass 10 loops, best of 3: 749 ms per loop In [2]: %timeit -n 10 for x in [i for i in range(10**7)]: pass 10 loops, best of 3: 1.05 s per loop
Conclusion: Try to use generators to traverse.
The above are some solutions to improve python performance. We will continue to add more in the future. You can take a look if you need them.
Hot AI Tools
Undresser.AI Undress
AI-powered app for creating realistic nude photos
AI Clothes Remover
Online AI tool for removing clothes from photos.
Undress AI Tool
Undress images for free
Clothoff.io
AI clothes remover
Video Face Swap
Swap faces in any video effortlessly with our completely free AI face swap tool!
Hot Article
Hot Tools
Notepad++7.3.1
Easy-to-use and free code editor
SublimeText3 Chinese version
Chinese version, very easy to use
Zend Studio 13.0.1
Powerful PHP integrated development environment
Dreamweaver CS6
Visual web development tools
SublimeText3 Mac version
God-level code editing software (SublimeText3)
Hot Topics
1666
14
1425
52
1327
25
1273
29
1252
24
PHP and Python: Different Paradigms Explained
Apr 18, 2025 am 12:26 AM
PHP is mainly procedural programming, but also supports object-oriented programming (OOP); Python supports a variety of paradigms, including OOP, functional and procedural programming. PHP is suitable for web development, and Python is suitable for a variety of applications such as data analysis and machine learning.
Choosing Between PHP and Python: A Guide
Apr 18, 2025 am 12:24 AM
PHP is suitable for web development and rapid prototyping, and Python is suitable for data science and machine learning. 1.PHP is used for dynamic web development, with simple syntax and suitable for rapid development. 2. Python has concise syntax, is suitable for multiple fields, and has a strong library ecosystem.
How to run sublime code python
Apr 16, 2025 am 08:48 AM
To run Python code in Sublime Text, you need to install the Python plug-in first, then create a .py file and write the code, and finally press Ctrl B to run the code, and the output will be displayed in the console.
PHP and Python: A Deep Dive into Their History
Apr 18, 2025 am 12:25 AM
PHP originated in 1994 and was developed by RasmusLerdorf. It was originally used to track website visitors and gradually evolved into a server-side scripting language and was widely used in web development. Python was developed by Guidovan Rossum in the late 1980s and was first released in 1991. It emphasizes code readability and simplicity, and is suitable for scientific computing, data analysis and other fields.
Python vs. JavaScript: The Learning Curve and Ease of Use
Apr 16, 2025 am 12:12 AM
Python is more suitable for beginners, with a smooth learning curve and concise syntax; JavaScript is suitable for front-end development, with a steep learning curve and flexible syntax. 1. Python syntax is intuitive and suitable for data science and back-end development. 2. JavaScript is flexible and widely used in front-end and server-side programming.
Golang vs. Python: Performance and Scalability
Apr 19, 2025 am 12:18 AM
Golang is better than Python in terms of performance and scalability. 1) Golang's compilation-type characteristics and efficient concurrency model make it perform well in high concurrency scenarios. 2) Python, as an interpreted language, executes slowly, but can optimize performance through tools such as Cython.
Where to write code in vscode
Apr 15, 2025 pm 09:54 PM
Writing code in Visual Studio Code (VSCode) is simple and easy to use. Just install VSCode, create a project, select a language, create a file, write code, save and run it. The advantages of VSCode include cross-platform, free and open source, powerful features, rich extensions, and lightweight and fast.
How to run python with notepad
Apr 16, 2025 pm 07:33 PM
Running Python code in Notepad requires the Python executable and NppExec plug-in to be installed. After installing Python and adding PATH to it, configure the command "python" and the parameter "{CURRENT_DIRECTORY}{FILE_NAME}" in the NppExec plug-in to run Python code in Notepad through the shortcut key "F6".
