Answer:
Explanation:
The minimum depth occurs for the path that always takes the smaller portion of the
split, i.e., the nodes that takes α proportion of work from the parent node. The first
node in the path(after the root) gets α proportion of the work(the size of data
processed by this node is αn), the second one get (2)
so on. The recursion bottoms
out when the size of data becomes 1. Assume the recursion ends at level h, we have
(ℎ) = 1
h = log 1/ = lg(1/)/ lg = − lg / lg
Maximum depth m is similar with minimum depth
(1 − )() = 1
m = log1− 1/ = lg(1/)/ lg(1 − ) = − lg / lg(1 − )
The answer should be C because most bloggers sacrifice privacy for content.
Elements that have little or no effect on search results include:
b. stop words.
d. capital letters.
<h3>What is a binary search?</h3>
Binary search can be defined as an efficient algorithm that is designed and developed for searching an element (information) from a sorted list of data that are stored on a database, especially by using the run-time complexity of Ο(log n)
<u>Note:</u> n is the total number of elements in a list.
In Computer technology, elements that have little or no effect on search results include he following:
However, keywords and search operators are important elements that have a significant effect on search results.
Read more on binary search here: brainly.com/question/24268720
#SPJ1
