![EthanIsHyper](/avatars/11824.jpg)
EthanIsHyper
05.12.2020 •
Computers and Technology
Advantages of python programming language
Solved
Show answers
More tips
- G Goods and services How to sew a ribbon: Tips for beginners...
- L Leisure and Entertainment How to Learn to Draw Graffiti: Tips for Beginners...
- F Family and Home How to Remove Tar Stains: Tips and Recommendations from Experts...
- F Family and Home How to Remove Fading from Clothes: Tips and Tricks...
- S Sport How to Do a Jumping Split...
- H Health and Medicine How Did Inna Lose Weight on Dom 2?...
- F Family and Home How to Properly Fold Napkins in a Napkin Holder?...
- F Food and Cooking How to Set Up Ventrilo - The Ultimate Guide...
- S Science and Technology How to Make a Homemade Smoker: The Ultimate Guide...
- A Auto and Moto Battle for the Relocation of The Cherkizovsky Market: Who Won?...
Answers on questions: Computers and Technology
- E English Lol wt f is going XDD hey this is my new acc if yk me so plzz add as a friend...
- M Mathematics How to find standard deviation of sumation of values normal distribution....
- P Physics if you could have a magic wand, and learn the answer to any questions in the world, what would you want to know and why?...
- B Business Chav has taken her employees for a team-building lunch. The final bill is $92.50. How much should Chav leave for a 20% tip?...
- M Mathematics Plsss what is the slope of the line shown below?...
Ответ:
Great starter programming language. Overall very powerful but for beginners the more advanced characteristics like GUIs are too complicated. This is coming from personal experience and after first experiencing programming through Python, Javascript is my new favorite.
Explanation:
a great video by code camp titled "Learn Python - Full Course for Beginners [Tutorial]" is a great starting point!
Ответ:
Explanation:
We can say according what we
already know that Greedy algorithm selects the shortest path, and we can also say that the given approach is greedy as it selects the last activity to start as it is the shortest path to take.
Now suppose we are given a set S = {x1, x2, , xn} (where x1, x2…. are activities), and xi = [si, fi), and we try to find an optimal solution by selecting the last activity to start that is compatible with all previously selected
activities.
Now create a set S’ = {x’1, x’2, · · · , x’n}, where x’i = [f’i, si). (x’1 = x1 in reverse). We can see that, a subset of {x1, x2, · · · , xn}⊂S is mutually compatible if and only if the corresponding subset {x’1, x’2, · · · , x’n} ⊂ S’ is also mutually compatible. Thus, an optimal solution for S maps directly to an
optimal solution for S’ and vice versa.
The given algorithm when run on S, produces the same result as the greedy algorithm when run on S’. The solution of algorithm for S corresponds to the solution of greedy algorithm for S’, and hence the algorithm is optimal.