This is the repository of the course of Computer Algorithms in NCUE, 2020 fall.
Programming language: Python
| github account | class | studentID | name |
|---|---|---|---|
| yxuan0329 | 資管四 | S0661124 | 梁芸瑄 |
| # | Name |
|---|---|
| 1 | Sorting |
| 2 | 2D-ranking |
| 3 | Shortest Path |
| 4 | BFS |
quick sort and insertion sort : given a sequence of number and sort them in two ways.
sort vertices on 2D plane.
Given the distance of each node and the road width, and find the shorest path. The road width here stands for another restriction for find paths, since users must find the shorest path by the allowed transportation. There are truck, car and bike, and each of the transportation has their car width. The car width should be larger than the road width or it can not passed. Among these statement, we use Dijkstra's Algorithm to find an answer for this problem.
Given a binary matrix with m * n, 0 stands for available and 1 stands for the opposite. Find a shortest path from the left-top to the right-bottom. We use BFS to solve this problem.