Answer:
Using the above algorithm matches one pair of Ghostbuster and Ghost. On each side of the line formed by the pairing, the number of Ghostbusters and Ghosts are the same, so use the algorithm recursively on each side of the line to find pairings. The worst case is when, after each iteration, one side of the line contains no Ghostbusters or Ghosts. Then, we need n/2 total iterations to find pairings, giving us an P()- time algorithm.
Answer:
The right choice would be Option b (2.545).
Explanation:
The given values are:
The aggregate blend will be:
= 55%
= 2.631
= 25%
= 2.331
= 20%
= 2.609
Now,
On applying the formula, we get
⇒
On substituting the values, we get
⇒
⇒
⇒
Using the knowledge of computational language in python it is possible to write a code that writes a list and defines the arrange.
<h3>Writing code in python:</h3><em>def isSorted(lyst):</em>
<em>if len(lyst) >= 0 and len(lyst) < 2:</em>
<em>return True</em>
<em>else:</em>
<em>for i in range(len(lyst)-1):</em>
<em>if lyst[i] > lyst[i+1]:</em>
<em>return False</em>
<em>return True</em>
<em>def main():</em>
<em>lyst = []</em>
<em>print(isSorted(lyst))</em>
<em>lyst = [1]</em>
<em>print(isSorted(lyst))</em>
<em>lyst = list(range(10))</em>
<em>print(isSorted(lyst))</em>
<em>lyst[9] = 3</em>
<em>print(isSorted(lyst))</em>
<em>main()</em>
See more about python at brainly.com/question/18502436
#SPJ1
