[Algorithm] Notes for Chapter 2

• [Basic Operation] The most time-consuming operation in the innermost loop. Among the four operations of addition, subtraction, multiplication and division, division is the most time-consuming, followed by multiplication, and addition and subtraction are generally considered uniformly.
• 由于$lo{g}_a^n=lo{g}_a^{b}lo{g}_b^n$, So the base of the logarithm is often ignored in algorithm analysis, written as $logn$ .
• [Worst efficiency] When the input scale is n, the efficiency of the algorithm in the worst case is the longest running time compared to other input instances of scale n.
• [Optimal efficiency] When the input scale is n, the efficiency of the algorithm in the optimal situation is the shortest running time compared to other input instances of scale n.
• [Sign $The$】
  
  
• 【Symbol $\Omega$】
  
  
• 【Symbol $\Theta$】
  
  
• 【theorem】
  
  
  
• [Compare the number of increases with the limit]
  
  
• 【Growth Type】
  
• 【About Logarithm】
  
• 【About $\Sigma Summation$】
  
  
• 【Master Theorem】
• 【Characteristic equation method】