Question

Based on Algorithm Analysis Rules Write The C++ Code for the following Algorithms and Contrast which one of the following Algorithm is Best Running Time/ Cases? T (n)= 1+1+1+(1+n+1+n)+2n+1=4n+6 = O(n) T (n)= 1+ (1+n+1+n)+2n+1 = 4n+4 = O(n)  T (n)= 1+(1+n+1+n)+4n+1 = 6n+4 = O(n)

Answer 1

Answer:

giucxtzxyuvvotjbrjtachrvd