APFIVE Constant Time Algorithm Efficiency
An algorithm processes a single, fixed-size chunk of 10 elements from a larger data set. The algorithm’s execution time is not affected by the total size of the data set. Which of the following best describes this algorithm’s time efficiency?
A
O(n) where n is the input size
B
O(10n) which simplifies to O(n)
C
O(1) since it processes fixed-size chunks
D
O(log n) since it divides the problem
Question Leaderboard
| Rank | |||||
|---|---|---|---|---|---|
| #1 | manessa.hachem2011 | 2 | 4 | 0m 00s | 180 |
| #2 | hxuna0217 | 1 | 1 | 0m 19s | 81 |
| #3 | afeldman0610 | 1 | 1 | 0m 21s | 79 |
| #4 | soniahalepota2005 | 1 | 2 | 0m 36s | 54 |
| #5 | legendarykavin10 | 1 | 3 | 0m 42s | 38 |
| #6 | 31201469 | 1 | 2 | 1m 05s | 25 |
| #7 | hazimstudy112 | 0 | 1 | 0m 00s | -10 |
| #8 | lionel.nguyen.haiminh | 1 | 3 | 1m 51s | -31 |
| #9 | tianbo.shen | 0 | 1 | 0m 26s | -36 |
| #10 | mahmoudjibrin08 | 0 | 1 | 0m 31s | -41 |
Items per page:
10
1 – 10 of 18