cretinous

27.02.2020 • 

Computers and Technology

Suppose you are choosing between the following three algorithms:

Algorithm A solves problems by dividing them into five sub-problems of half the size, recursively solving each sub-problem, and then combining the solutions in linear time.

Algorithm B solves problems of size n by recursively solving two sub-problems of size n=1 and then combining the solutions in constant time.

Algorithm C solves problems of size n by dividing them into nine sub-problems of size n=3, recursively solving each sub-problem, and then combining the solutions in O(n2) time.

What are the running times of each of these algorithms (in big-O notation), and which would you choose?

Ответ:

naiomireyes74p2aybs

24.02.2023

Computers and Technology

---

The pseudocode is as follows:

1. Start

2. total = 0

3. for i = 100 to 180 step 5

3.1    total = total + i

4. print total

5. Stop

Explanation:

This begins the algorithm

1. Start

This initializes the total to 0

2. total = 0

This iterates from 100 to 180 with an increment of 5

3. for i = 100 to 180 step 5

This adds up all multiples of 5 within the above range

3.1    total = total + i

This prints the calculates total

4. print total

This ends the algorithm

5. Stop

See attachment for flowchart

---

0,0(0 оценок)