The problem of seeking log2 N in C

Source: Internet
Author: User

Today, when writing the sequential storage of a two-fork tree, a mathematical problem was encountered.

It is known that the total binary tree with the number of nodes n is the depth k: K = log2 n + 1,log2n is rounded down. Check the C-math.h only log and LOG10 functions. Log is based on the base e, LOG10 is based on 10, then how to find a 2-based tree?

Baidu did not know log2n = in (N)/In (2) , in is the base of E, the value is 2.71828 ..., the use of the logarithm of the bottom-changing formula.

Math is good, and it's important for a software developer. Hey.. Surf the internet to check the logarithm of the other formula, so that later temperature.

1, 2, 3, 4, 5, Exchange Formula reference URL: Click to open the link

The problem of seeking log2 N in C

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.