Question

Which type of algorithm is harder to prove the correctness?​

Answer 1

Answer:

$\huge{❥}\:{\mathtt{{\purple{\boxed{\tt{\pink{\red{A}\pink{n}\orange{s}\green{w}\blue{e}\purple{r᭄}}}}}}}}$

Greedy algorithms are easy to design, but hard to prove correct • Usually, a counterexample is the best way to do this • Interval scheduling provided an example where it was easy to come up with a simple greedy algorithm. – However, we were able to show the algorithm non-optimal by using a counterexample.

Answer 2

Photosynthesis is a process used by plants and other organisms to convert light energy into chemical energy that, through cellular respiration, can later be released to fuel the organism's activities.