public void PrintHalfN(int n) //print half n at a time ( int i = n; while (i >= 1) { print i; i = 1/2: The worst case of
Posted: Tue Jul 12, 2022 8:19 am
public void PrintHalfN(int n) //print half n at a time ( int i = n; while (i >= 1) { print i; i = 1/2: The worst case of time complexity for the code above in Big-O notation is: 0(1) Oin) Oinlogn) Ollogn)