1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Grace [21]
3 years ago
9

Letm1, m2,···mnbe distinct numbers on the number line, in the increasing order. Your goalis to color all of them blue. You have

magical blue pens with the following property: Whenyou place the pen at co-ordinate x, all the points in the range [x - 5, x + 5] turn blue. Apen can be used only once. Give an algorithm to color all the points using as few pens aspossible. Prove the correctness of the algorithm and derive the runtime.
Computers and Technology
1 answer:
siniylev [52]3 years ago
7 0

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).

You might be interested in
Does trend in computing important for organization management?​
mario62 [17]

Answer:

yes it is...................

6 0
3 years ago
Noticing his reduced performance at work, Dan enrolled himself for training sessions offered by the company and saw his producti
Luden [163]

A. self-efficacy.

B. overreward inequity.

C. expectancy.

D. cognitive distortion.

Answer:B. overreward inequity.

Explanation: Overreward inequity is a term mostly associated with the feeling of guilt by an employee who believes that his contributions to work or his performance rating is less than what he or she is been paid for.

An employee with this kind of guilt feelings will mostly like do his or her best to engage in in performance improvement Activities which includes enrollment for training and classes to enhance his or her performance.

6 0
3 years ago
Express 0.0005 x 10-4 farads as picofarads
prohojiy [21]
0.0005 x 10⁻⁴ Farad = 0.000 000 05 Farad.
1 pF = 0.000 000 000 001 Farad

Divide them and get 50000 pF.
3 0
3 years ago
Read 2 more answers
Which LIKE operator would match a single character?<br><br> *<br> ?<br> []<br> #
algol [13]

Answer:

underscore hope that helps

Explanation:

4 0
3 years ago
50 POINTS! What can be viewed in the Tasks folder? Check all that apply.
Rom4ik [11]

1, 2, and 4 :))) good luck

6 0
3 years ago
Read 2 more answers
Other questions:
  • George borrowed some equipment from his friend for recording his monologue for his art class. He got all the equipment except th
    15·1 answer
  • Which presenter would most likely benefit from a custom slide show?
    10·2 answers
  • It is a small hand tool used generally in decorative works such as making garnishes
    15·1 answer
  • An example of creative curating is when a:
    9·1 answer
  • (fill in the blank) <br><br> ____ is when data is formatted, transmitted and received in a network.
    13·1 answer
  • What is HTML? (list down any 5 points)
    12·1 answer
  • LAB: Convert to binary - methods
    11·1 answer
  • Ask the user to input a word. Then, print the first letter, the last letter, and the length of the word on the same line with no
    6·1 answer
  • Help plz (will give brainliest)
    9·1 answer
  • FoRWarD MaRcH AND hERe We Go MEMbers of the agEncy BaKuGO AHHHHHHHHH-
    10·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!