Optimization of space-time complexity--mathematics

Source: Internet
Author: User

When solving various algorithmic problems, we often use O () to indicate the time complexity of the algorithm and the rate at which spatial complexity increases as the size of the data grows. Typically, the time complexity that can be solved in 1s time is related to the data size in table 1-1.

Table 1-1 basic time complexity in 1s

The size of n

The time complexity of the solution can be calculated in 1s

10

N! (usually some search algorithms)

20

100

N3

1000

N2;n2㏒n

10000

N√n

100000

N㏒n

1000000

N

Optimization of space-time complexity--mathematics

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.