[CrashCourse CS] #13 Intro to Algorithms

The term algorithm comes from Persian polymath Muhammad ibn Musa al-Khwarizmi (780 ~ 850), one of the fathers of algebra.

Sorting Algorithms

• The relationship of input size to the number of steps the algorithm takes to run charaterizes the complexity of sort algorithm (Big O Notation)
• Selection sort : O(n^2)
• Merge sort : O( n log(n))
  
  

Graph Search

• Graph : nework of nodes connected by lines.
• Brute Force Approach: taking every path to calculate the total cost of each (O(n!))
• Dijkstra Algorithm, Edsger Dijkstra (Dutch computer scientist, 1930~2002), O(n^2)
• Dijkstra is later improved to O( n log(n+1)).
  
  

Vocabulary

• storied - recorded in history or in a story
• brute - 거친
• conceive - 고안하다.
  
  

Thoughts

• 내가 알았던 내용이 나와서 간단히 정리했다.
• 게임개발 배울 때 열심히 공부했던 내용들이 나오고 있다.