Question: Say your and your coworkers write an algorithm that takes in an array of numbers and returns the highest one, select the the three (3)
Say your and your coworkers write an algorithm that takes in an array of numbers and returns the highest one, select the the three (3) best analysis below that describes your algorithm.
Group of answer choices
The absolute slowest it can run is constant time time O(c)
The absolute slowest it can run is Linear time O(n)
This algorithm be tightly asymptotically bound so we can also say its (n)
The absolute fastest it can run is Linear time (n)
The absolute fastest it can run in Quadratic time (n^2)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
