Merge pull request #10503 from RP99/fix/9655BigO
fix Big-o-notation from exponential time to polynomial time in videos/big-o-notation-a-few-examplespull/18182/head
commit
3fe4da54d5
|
@ -76,7 +76,7 @@
|
|||
],
|
||||
"tests": [
|
||||
[
|
||||
"Algorithms expressed exponentially like O(N^2) can work well in certain situations, so you shouldn't avoid them completely.",
|
||||
"Algorithms expressed exponentially like O(C^N), where C is a constant can work well in certain situations, so you shouldn't avoid them completely.",
|
||||
false,
|
||||
"While they can work in certain small scale situations, they aren't good practice because they will not work larger scale."
|
||||
],
|
||||
|
|
Loading…
Reference in New Issue