


This article mainly introduces the concept literacy tutorial of python algorithm representation to everyone in detail. It has certain reference value. Interested friends can refer to it.
This article explains the concept of python algorithm representation for everyone. For your reference, the specific content is as follows
Constant order O(1)
Constant is also called a fixed number, which refers to a constant whose value does not change. The opposite is Variable
Why is the time complexity of the following algorithm not O(3), but O(1).
int sum = 0,n = 100; /*执行一次*/ sum = (1+n)*n/2; /*执行一次*/ printf("%d", sum); /*行次*/
The number of runs function of this algorithm is f(n)=3. According to our method of deriving the big O order, the first step is to change the constant term 3 to 1. When retaining the highest-order term, we found that it has no highest-order term at all, so the time complexity of this algorithm is O(1).
In addition, let us imagine that if the statement sum=(1+n)*n/2 in this algorithm has 10 sentences, that is:
int sum = 0, n = 100; /*执行1次*/ sum = (1+n)*n/2; /*执行第1次*/ sum = (1+n)*n/2; /*执行第2次*/ sum = (1+n)*n/2; /*执行第3次*/ sum = (1+n)*n/2; /*执行第4次*/ sum = (1+n)*n/2; /*执行第5次*/ sum = (1+n)*n/2; /*执行第6次*/ sum = (1+n)*n/2; /*执行第7次*/ sum = (1+n)*n/2; /*执行第8次*/ sum = (1+n)*n/2; /*执行第9次*/ sum = (1+n)*n/2; /*执行第10次*/ printf("%d",sum); /*执行1次*/
In fact, no matter what n is, the above The two pieces of code are the difference between 3 and 12 executions. This algorithm, which has a constant execution time regardless of the size of the problem (the size of n), is called a time complexity of O(1), and is also called a constant order.
Note: No matter what the constant is, we will record it as O(1), not any other number such as O(3), O(12), etc. This is a mistake often made by beginners.
Derivation of the Big O method
1. Replace all additive constants in the running time with constant 1
2. In the modified number of runs function, only the highest-order term
3 is retained. If the highest-order term exists and is not 1, the constant multiplied by this term
is removed Logarithm of order O(log2n)
##Logarithm
If the x power of a is equal to N (a>0, and a is not equal to 1), then the number x is called the logarithm of N with a as the base (logarithm), recorded as x=logaN, . Among them, a is called the base of the logarithm, and N is called the real number.5^2 = 25, recorded as 2= log5 25
Logarithm is an operation, and exponential is a reciprocal operation. For example
logarithmic order
int count = 1; while (count < n) { count = count * 2; /* 时间复杂度为O(1)的程序步骤序列 */ }Since each count After multiplying by 2, it is one point closer to n. In other words, how many 2s multiplied together are greater than n, then the loop will exit. Get x=log2n from 2^x=n. So the time complexity of this loop is O(logn).
Linear order O(n)
The execution time increases proportionally with the size of the problemdata = [ 8,3,67,77,78,22,6,3,88,21,2] find_num = 22 for i in data: if i == 22: print("find",find_num,i )
Linear logarithmic order O(nlog2n )
square order O(n^2)
for i in range(100): for k in range(100): print(i,k)cubic order O(n^3)
k times Square order O(n^k),
exponential order O(2^n).
The above is the detailed content of Example tutorial on python algorithm representation concept literacy. For more information, please follow other related articles on the PHP Chinese website!

本篇文章给大家带来了关于Python的相关知识,其中主要介绍了关于Seaborn的相关问题,包括了数据可视化处理的散点图、折线图、条形图等等内容,下面一起来看一下,希望对大家有帮助。

本篇文章给大家带来了关于Python的相关知识,其中主要介绍了关于进程池与进程锁的相关问题,包括进程池的创建模块,进程池函数等等内容,下面一起来看一下,希望对大家有帮助。

本篇文章给大家带来了关于Python的相关知识,其中主要介绍了关于简历筛选的相关问题,包括了定义 ReadDoc 类用以读取 word 文件以及定义 search_word 函数用以筛选的相关内容,下面一起来看一下,希望对大家有帮助。

本篇文章给大家带来了关于Python的相关知识,其中主要介绍了关于数据类型之字符串、数字的相关问题,下面一起来看一下,希望对大家有帮助。

VS Code的确是一款非常热门、有强大用户基础的一款开发工具。本文给大家介绍一下10款高效、好用的插件,能够让原本单薄的VS Code如虎添翼,开发效率顿时提升到一个新的阶段。

本篇文章给大家带来了关于Python的相关知识,其中主要介绍了关于numpy模块的相关问题,Numpy是Numerical Python extensions的缩写,字面意思是Python数值计算扩展,下面一起来看一下,希望对大家有帮助。

pythn的中文意思是巨蟒、蟒蛇。1989年圣诞节期间,Guido van Rossum在家闲的没事干,为了跟朋友庆祝圣诞节,决定发明一种全新的脚本语言。他很喜欢一个肥皂剧叫Monty Python,所以便把这门语言叫做python。


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

AI Hentai Generator
Generate AI Hentai for free.

Hot Article

Hot Tools

VSCode Windows 64-bit Download
A free and powerful IDE editor launched by Microsoft

MantisBT
Mantis is an easy-to-deploy web-based defect tracking tool designed to aid in product defect tracking. It requires PHP, MySQL and a web server. Check out our demo and hosting services.

mPDF
mPDF is a PHP library that can generate PDF files from UTF-8 encoded HTML. The original author, Ian Back, wrote mPDF to output PDF files "on the fly" from his website and handle different languages. It is slower than original scripts like HTML2FPDF and produces larger files when using Unicode fonts, but supports CSS styles etc. and has a lot of enhancements. Supports almost all languages, including RTL (Arabic and Hebrew) and CJK (Chinese, Japanese and Korean). Supports nested block-level elements (such as P, DIV),

Dreamweaver CS6
Visual web development tools

SublimeText3 Mac version
God-level code editing software (SublimeText3)