If a routing algorithm's execution time increases linearly with network nodes, which Big-O notation describes this?

💡 Explanation

Linear time complexity means the algorithm's execution time grows directly proportionally to the input size, because each element requires a constant amount of processing. Therefore, O(n) accurately depicts this growth, rather than the others which represent different growth characteristics like logarithmic, quadratic, or constant.

• Which outcome occurs when a network router's path selection uses a distance-vector routing algorithm with poisoned reverse?
• What outcome results when a scan line in a convex hull algorithm encounters an intersection event point?
• If a high-volume e-commerce site employs a randomized quicksort algorithm for daily sales transaction sorting, which consequence follows regarding execution?
• A constraint satisfaction solver encounters a conflict clause during Boolean constraint propagation. If the solver applies backjumping, which consequence follows?
• If a network protocol claims guaranteed delivery but packets are sometimes lost, which consequence follows, assuming we use proof by contradiction?
• A search algorithm must locate a student record within a database of 10,000 entries. Which algorithm provides the MOST efficient time complexity in the worst-case scenario?