This repository records the homeworks and projects of the DS lecture.
All of the files have the pdf file displaying the results of the projects
- HW1-Selection Sort, Bubble Sort and Binary Search
- HW2-Magic Square
- HW3-Mouse in Maze
- HW4-infix2prefix/postfix
- HW5-Singly Linked List
- HW6-Binary Search Tree
- HW7-Shortest Path
- HW8-Performance Evaluation for Sorting Algorithms
- bonus1-Power and Polynomial
- bonus2-Knight Tour
- bonus3-N-Queen
- bonus4-Addition of polynomials