ผลต่างระหว่างรุ่นของ "Ait-aa"

รุ่นแก้ไขเมื่อ 01:31, 23 มกราคม 2559

This is a homepage for CS304 Advanced Algorithms.

Week 1-1 (1/19): Introduction, insertion sort, asymptotic notations
- YouTube:
  - Merge procedure: Part 1, Part 2, Part 3
  - Examples for O-notation: Full

Week 1-2 (1/21): More on big-O and algorithm analysis. Divide and conquer (maximum subarray sum)
- YouTube:
  - Analysis of merge sort: Part 1, Part 2
  - Integer Multiplication: Part 1, Part 2
  - Solving recurrences with the recursion-tree method: Full

@@ แถว 8: / แถว 8: @@
 *** Examples for O-notation: [http://www.youtube.com/watch?v=2jERkhCh7Oc Full]
-* Week 1-2 (1/21): Divide and conquer
+* Week 1-2 (1/21): More on big-O and algorithm analysis.  Divide and conquer (maximum subarray sum)
+** YouTube:
+*** Analysis of merge sort: [http://www.youtube.com/watch?v=UItoCEzvAe4 Part 1], [http://www.youtube.com/watch?v=U_S9iBybI6w Part 2]
+*** Integer Multiplication: [http://www.youtube.com/watch?v=uIA4CXVWvXA Part 1], [http://www.youtube.com/watch?v=mbRyDOEDTdk Part 2]
+*** Solving recurrences with the recursion-tree method: [http://www.youtube.com/watch?v=lYa4RtMpuMs Full]
 == Links ==
 * Old home pages for [[ait-aa-2014|2014]] and [[ait-aa-2013|2013]]