{"course":{"id":"113262701Q01","name":"演算法","enroll_type":"必修","general_type":"","dept":"人工智慧學程","grade":2,"class_group":"甲","teacher":"高黃江","credit":3,"hour":3,"time":[{"day":1,"section":[2,3,4]}],"classroom":"","max":56,"min":10,"remark":"English-taught course","alt_for":"","courses":""},"detail":[["指定教材",""],["參考教材","Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein\nData Structures and Algorithms in Python by Michael T. Goodrich, Roberto Tamassia, and Michael H. Goldwasser"],["成績評量標準","Homework, Quiz: 60%\nMidterm: 20%\nFinal: 20%"],["教學方法","理論講授,實務講授"],["教學目標","This course introduces fundamental algorithms and data structures, focusing on algorithm design, recursion, sorting, searching, and graph/tree structures. Students will develop problem-solving skills, understand time complexity, and apply these concepts using Python or C++ for efficient implementation."]],"office_time":[["高黃江","Office: AI Center, Innovation Building | 3F\nOffice hours: Thursday Morning, 9:00 - 12:00"]],"schedule":[["2025/01/13","2","4","3","高黃江","Introduction to the course","","Introduction to the course",""],["2025/01/20","2","4","3","高黃江","Introduction to Algorithm Design","","Flow chart, algorithm design",""],["2025/02/10","2","4","3","高黃江","Basic algoritms 1D array","","Search, Min, Max, Sum, Average",""],["2025/02/17","2","4","3","高黃江","Matrix Algorithm 2D array","Homework 1","Plus, multiply, broadcast between matrix, vector, and scalar",""],["2025/02/24","2","4","3","高黃江","String algorithms","","Reversing a String, Palindromes, Anagram Detection, Naive Pattern Matching, Substring Frequency",""],["2025/03/03","2","4","3","高黃江","Practice Session","","Hands-on practice with arrays, matrix, and string algorithms",""],["2025/03/10","2","4","3","高黃江","Recursive Functions","","Fibonacci, Power, Factorial, GCD, Sum of Digits",""],["2025/03/17","2","4","3","高黃江","Practice Session on Recursive Functions","Homework 2","Hands-on practice with Recursive Functions",""],["2025/03/24","2","4","3","高黃江","Big-O Complexity Analysis","","Complexity analysis, worst, average and best case analysis",""],["2025/03/31","2","4","3","高黃江","MIDTERM","","MIDTERM",""],["2025/04/07","2","4","3","高黃江","Search algorithm","","Linear Search, Binary Search",""],["2025/04/14","2","4","3","高黃江","Sort algorithm part 1","","Bubble Sort, Insertion Sort, Selection Sort",""],["2025/04/21","2","4","3","高黃江","Sort algorithm part 2","Homework 3","Merge Sort, Quick Sort, Heap Sort, Complexity Analysis",""],["2025/04/28","2","4","3","高黃江","Introduction to Graph, Graph Algorithms Part 1","","BFS, DFS",""],["2025/05/05","2","4","3","高黃江","Introduction to Graph, Graph Algorithms Part 2","","Shortest Path Algorithms Dijkstra's algorithm, Floyd-Warshall Algorithm, Bellman-Ford Algorithm",""],["2025/05/12","2","4","3","高黃江","Introduction to Tree, Binary Tree Part 1","","Basic terms: Complete BT, Balanced, Unbalanced BT, Insert, Delete",""],["2025/05/19","2","4","3","高黃江","Introduction to Tree, Binary Tree Part 2","Homework 4","Tree Traverse, Inorder, Postorder, Preorder",""],["2025/05/26","2","4","3","高黃江","FINAL EXAM","","FINAL EXAM",""]]}