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

รุ่นแก้ไขเมื่อ 01:41, 30 มกราคม 2557

This is a homepage for CS304 Advanced Algorithms.

Homework 1 is announced. You should work on this in class during the 1st hour of Jan 17th's class. It is due on Feb 7th. ~~Jan 24th.~~

Homework 1: (to start working in class on Friday 17th, due Friday, Feb 7th ~~Friday 31st~~ ~~Friday 24th~~)
- Ch.2: Problems 2-2, 2-3
- Ch.3: Exercises 3.1-1, 3.1-2; Problems 3-1a, 3-1b, 3-2, 3-4
Homework 2:

Week 1: Introduction, insertion sort, asymptotic notations
- YouTube:
  - Merge procedure: Part 1, Part 2, Part 3
  - Examples for O-notation: Full
  - Analysis of merge sort: Part 1, Part 2

Week 2: Divide and conquer, recurrences
- YouTube:
  - Integer Multiplication: Part 1, Part 2
  - Solving recurrences with the recursion-tree method: [www.youtube.com/watch?v=lYa4RtMpuMs Full]

@@ แถว 16: / แถว 16: @@
 *** Merge procedure: [http://www.youtube.com/watch?v=hKsbzzY7kts Part 1], [http://www.youtube.com/watch?v=JvnDiQxhRUo Part 2], [http://www.youtube.com/watch?v=d3prchuiNhc Part 3]
 *** Examples for O-notation: [http://www.youtube.com/watch?v=2jERkhCh7Oc Full]
-*** Analysis of merge sort: [http://www.youtube.com/watch?v=UItoCEzvAe4 Part 1], [Part 2]
+*** Analysis of merge sort: [http://www.youtube.com/watch?v=UItoCEzvAe4 Part 1], [http://www.youtube.com/watch?v=U_S9iBybI6w Part 2]
 * Week 2: Divide and conquer, recurrences