今天碰到这个问题，我第一眼没反应过来。 O(n!) = O((n + 1)!)<script defer crossorigin="anonymous" integrity="sha256-bgI9WhLOPSUlPrdgHUg3rPIB2vq+D+mYkUTM3q0U8fw=" onload="katex.render(this.parentNode.innerText, this.parentNode, {"fleqn":false,"leqno":false,"output":"htmlAndMathml","throwOnError":false,"errorColor":"#cc0000","minRuleThickness":0.05,"maxSize":10,"maxExpand":1000,"macros":{},"colorIsTextColor":false,"displayMode":false})" src="https://lf6-cdn-tos.bytecdntp.com/cdn/expire-1-M/KaTeX/0.15.2/katex.min.js"> ，对吗？

正确的理解应该是 (n+1)! = \omega(n!)<script defer crossorigin="anonymous" integrity="sha256-bgI9WhLOPSUlPrdgHUg3rPIB2vq+D+mYkUTM3q0U8fw=" onload="katex.render(this.parentNode.innerText, this.parentNode, {"fleqn":false,"leqno":false,"output":"htmlAndMathml","throwOnError":false,"errorColor":"#cc0000","minRuleThickness":0.05,"maxSize":10,"maxExpand":1000,"macros":{},"colorIsTextColor":false,"displayMode":false})" src="https://lf6-cdn-tos.bytecdntp.com/cdn/expire-1-M/KaTeX/0.15.2/katex.min.js"> 。

Bintou 对的，就一个 1 <script defer crossorigin="anonymous" integrity="sha256-bgI9WhLOPSUlPrdgHUg3rPIB2vq+D+mYkUTM3q0U8fw=" onload="katex.render(this.parentNode.innerText, this.parentNode, {"fleqn":false,"leqno":false,"output":"htmlAndMathml","throwOnError":false,"errorColor":"#cc0000","minRuleThickness":0.05,"maxSize":10,"maxExpand":1000,"macros":{},"colorIsTextColor":false,"displayMode":false})" src="https://lf6-cdn-tos.bytecdntp.com/cdn/expire-1-M/KaTeX/0.15.2/katex.min.js"> ，能有什么影响~ 话说，这样是不是意味着，我把一个算法从 O((n+1)!) <script defer crossorigin="anonymous" integrity="sha256-bgI9WhLOPSUlPrdgHUg3rPIB2vq+D+mYkUTM3q0U8fw=" onload="katex.render(this.parentNode.innerText, this.parentNode, {"fleqn":false,"leqno":false,"output":"htmlAndMathml","throwOnError":false,"errorColor":"#cc0000","minRuleThickness":0.05,"maxSize":10,"maxExpand":1000,"macros":{},"colorIsTextColor":false,"displayMode":false})" src="https://lf6-cdn-tos.bytecdntp.com/cdn/expire-1-M/KaTeX/0.15.2/katex.min.js"> 改进到 O(n!) <script defer crossorigin="anonymous" integrity="sha256-bgI9WhLOPSUlPrdgHUg3rPIB2vq+D+mYkUTM3q0U8fw=" onload="katex.render(this.parentNode.innerText, this.parentNode, {"fleqn":false,"leqno":false,"output":"htmlAndMathml","throwOnError":false,"errorColor":"#cc0000","minRuleThickness":0.05,"maxSize":10,"maxExpand":1000,"macros":{},"colorIsTextColor":false,"displayMode":false})" src="https://lf6-cdn-tos.bytecdntp.com/cdn/expire-1-M/KaTeX/0.15.2/katex.min.js"> ，也是很厉害了？

时间复杂度的一个小问题

Error

今天碰到这个问题，我第一眼没反应过来。
O(n!) = O((n + 1)!)，对吗？

Bintou

Error 你可以说一下自己的第二眼是什么反应吗？

Error

Bintou 我好菜 🤣

Error

正确的理解应该是 (n+1)! = \omega(n!)。

Bintou

我猜一下，第一眼：O(n) = O(n+1)，所以O(n!) = O((n+1)!) 。很和谐，没毛病......

Error

Bintou 对的，就一个 1 ，能有什么影响~
话说，这样是不是意味着，我把一个算法从 O((n+1)!) 改进到 O(n!) ，也是很厉害了？