From 60fd331394358cc7f9c0862ab29f3f6d61eb702d Mon Sep 17 00:00:00 2001 From: NaiJi Date: Sun, 21 Apr 2024 22:28:31 +0400 Subject: [PATCH] 1 --- .../1. Big O Time Complexity.md | 8 ++++++++ 1 file changed, 8 insertions(+) create mode 100644 The Last Algorithms Course You'll Need/1. Big O Time Complexity.md diff --git a/The Last Algorithms Course You'll Need/1. Big O Time Complexity.md b/The Last Algorithms Course You'll Need/1. Big O Time Complexity.md new file mode 100644 index 0000000..5a52d11 --- /dev/null +++ b/The Last Algorithms Course You'll Need/1. Big O Time Complexity.md @@ -0,0 +1,8 @@ +Important concepts + +Big O is a way to categorize your algorithms time or memory requirements based on input. + +- Growth is with respect to the input +- Constants are dropped +- Worst case is usually the way we measure +