Question
Define O(log n).

Answer

O(log n) denotes logarithmic time complexity. O(log n) represents a code whose execution time will grow logarithmically w.r.t. the size of the input data. O(log n) is typical with algorithms that keep on successively dividing the data range to work upon.

Need a full question paper?

Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.

Start Generating Free