Answer:
polynomial-bounded algorithms
Explanation:
There are two algorithm complexities and they are time and space complexities. They can be denoted with the big-O notation. The big-o notation for a time and space complexity gets the worst-case time and space respectively.
The time complexity gets the measure of the execution time of an algorithm. When the time function is a polynomial ( k^n + k^n-1 ...) then the algorithm is said to be a polynomial-bounded algorithm.
Answer: Pin
Explanation:
Pin button is the button that is used for sticking or saving the ideas from the windows or web on that very place.This feature helps in reviewing or getting the idea back later anytime from the window as per users need. User use this button for saving any food recipe, steps of any process, guidelines etc.
- According to the question, Fryshta can use pin button from the help window for sticking or pinning the steps of inserting shapes in her presentation.She can have a look at the steps whenever she want.
A mail server. --------------------------------------------
In some aspects, yes but these have recently been outweighed with the ad boycott youtube has not to mention google plus wasn't the most popular, to begin with, but in an overall sense yes as the name google is more often used than Facebook or twitter
