From 3058cb41b07a0110a3d79d06b6a3d653798b169f Mon Sep 17 00:00:00 2001 From: liuchengray Date: Sun, 3 Nov 2024 18:32:16 +0100 Subject: [PATCH] article.md --- 2024/Time-and-Space-Complexity/article.md | 13 ++++++------- 1 file changed, 6 insertions(+), 7 deletions(-) diff --git a/2024/Time-and-Space-Complexity/article.md b/2024/Time-and-Space-Complexity/article.md index 6490b4f9..4430e374 100644 --- a/2024/Time-and-Space-Complexity/article.md +++ b/2024/Time-and-Space-Complexity/article.md @@ -1,11 +1,10 @@ - # Time and Space Complexity: The Soul of Algorithms +# Time and Space Complexity: The Soul of Algorithms - Imagine you are at a restaurant trying to decide what to order. Flipping through the entire menu might take a while, but if you ask the waiter for a quick recommendation, you can make your decision much faster. In computer science, this method of seeking efficiency in algorithm is known as reducing "time complexity", which means minimizing the numbers of steps needed to find a solution. +Imagine you are at a restaurant trying to decide what to order. Flipping through the entire menu might take a while, but if you ask the waiter for a quick recommendation, you can make your decision much faster. In computer science, this method of seeking efficiency in algorithm is known as reducing "time complexity", which means minimizing the numbers of steps needed to find a solution. - Now, consider how much easier it would be if the menu assigned numbers to each dish. This way, you only need to remember a few digits instead of the names of all the dishes. Similarly, in computer science, saving storage space is equally important when designing algorithms. Reducing "space complexity" is a necessary task for any quality algorithm. +Now, consider how much easier it would be if the menu assigned numbers to each dish. This way, you only need to remember a few digits instead of the names of all the dishes. Similarly, in computer science, saving storage space is equally important when designing algorithms. Reducing "space complexity" is a necessary task for any quality algorithm. - Both time and space complexity are essential factors to consider when designing algorithms. Beyond just solving a problem, the ability to run efficiently is a vital requirement for any algorithm. +Both time and space complexity are essential factors to consider when designing algorithms. Beyond just solving a problem, the ability to run efficiently is a vital requirement for any algorithm. - - ## Author - Chengrui Liu \ No newline at end of file +## Author +Chengrui Liu