算法的時間復雜度 & 性能對比

累加算法性能對比

// js 累加算法性能對比測試
const n = 10**6;

(() => {
  console.time(`for`);
  let result = 0;
  for (let i = 1; i <= n; i++) {
    result += i;
    if (i === n) {
      console.log(`ok`, result);
    }
  }
  console.timeEnd(`for`);
})();

(() => {
  console.time(`math`);
  const result = (n * (n + 1)) / 2;
  console.log(`ok`, result);
  console.timeEnd(`math`);
})();

如何計算算法的復雜度

https://time.geekbang.org/course/detail/100019701-41531

refs

https://www.bigocheatsheet.com/

Big-O Complexity Chart

O(n^2) O(n log(n)) O(log(n)) O(n)

Ω(n^2 ) Ω(n log(n)) Ω(log(n)) Ω(n)

Θ(n^2 ) Θ(n log(n)) Θ(log(n)) Θ(n))

---

---

©xgqfrms 2012-2020

www.cnblogs.com 發布文章使用：只允許注冊用戶才可以訪問！

---