What is the question for !!!!!!!!!!!!
Answer:
Following are the algorithm to this question:
y = 0 // initialize variable y that assigns the value 0
p = 1 // initialize value 1 in the variable p which also known as starting position
init num = 1//define variable num that assign value 1
for j = 1 to n: //defining loop
y = m[j] - m[p]
if (y > 10) //defining if block
num++; //increment num variable
p=i; //holding loop value in p variable
y= 0//assign value 0 in y variable
Explanation:
Following are the runtime analysis of the above-given algorithm:
The above-provided algorithm is greedy, but if it doesn't exceed the scope, it operates by greedily choosing its next object. Therefore the algorithm selects the fewest number of pens.
Running time:
This algorithm merely iterates once over all the points. The run-time is therefore O(n).
Answer: Where the guide lines?
Explanation: I’ll help but where the guidelines?
<span>The smallest network is a </span>personal area network,<span> which is a network of personal devices, such as the network you use when you sync your cell phone and your computer. </span>personal area network
Answer: the term is known as Align Justified
Explanation:
In typesetting and page layout, alignment or range is the setting of text flow or image placement relative to a page, column, table cell, or tab. The type alignment setting is sometimes referred to as text alignment, text justification, or type justification.
