# Difference between revisions of "Greedy Algorithm"

Sweetmango77 (talk | contribs) |
Sweetmango77 (talk | contribs) |
||

Line 3: | Line 3: | ||

===How to use=== | ===How to use=== | ||

If you're solving a math problem, and it involves something similar or the same as egyptian fractions, | If you're solving a math problem, and it involves something similar or the same as egyptian fractions, | ||

− | Step 1: Find the largest fraction with a denominator of a positive integer. | + | Step <math>1</math>: Find the largest fraction with a denominator of a positive integer. |

− | Step 2: Subtract the number you got from (1) from the original fraction. | + | |

− | Step 3: Repeat until you get a fraction with numerator 1. | + | Step <math>2</math>: Subtract the number you got from (<math>1</math>) from the original fraction. |

+ | |||

+ | Step <math>3</math>: Repeat until you get a fraction with numerator <math>1</math>. | ||

==Example== | ==Example== |

## Latest revision as of 01:20, 23 January 2021

A Greedy Algorithm is one that always chooses the best immediate option. The advantage is that it usually makes decisions simpler, but it may create problems in the long run. It is useful for making programs that don't take long to run. Do not use it in your everyday life.

### How to use

If you're solving a math problem, and it involves something similar or the same as egyptian fractions, Step : Find the largest fraction with a denominator of a positive integer.

Step : Subtract the number you got from () from the original fraction.

Step : Repeat until you get a fraction with numerator .

## Example

### Problem

If , , and are positive integers, and , what is ?

### Solution using the Greedy Algorithm

Let . Obviously, as the denominator decreases, the fraction increases. Therefore, . The least possible value of is . Then, . Again, we find the least possible value of , which is . We subtract to get . Therefore, . Our answer is then .