In Questions fiNd the "Best" Big-O Notation to Describe the Complexity

question 22

Short Answer

In questions find the "best" big-O notation to describe the complexity of the algorithm. Choose your
answers from the following:
1, $$\log _ { 2 } n , n , n \log _ { 2 } n , n ^ { 2 } , n ^ { 3 } , \ldots , 2 ^ { n } , n !$$
-The number of print statements in the following: while $n > 1$
print "hello";
$$n : = \lfloor n / 2 \rfloor$$

---

Definitions:

LAN

Stands for Local Area Network, a computer network that interconnects computers within a limited area such as a residence, school, laboratory, or office building.

WAN

Wide Area Network, a telecommunications network that extends over a large geographic area for the purpose of computer networking.

Fiber-Optic

Referring to the technology of transmitting light through thin, flexible fibers of glass or plastic for telecommunications or lighting.

Dial-Up

A form of internet access that connects users to the internet through a telephone line.