The structure of this summary is mainly derived from the course materials and experimental materials of the same-name course in the Department of Computer Science and Engineering(CSE) of Southern University of Science and Technology(SUSTECH). At the same time, many search engines, including google, edge, and many websites, such as csdn, StackOverflow, chatgpt also gave me great help. Here I would like to express my gratitude to all the above people, websites, etc. who have helped me.
This course maily introduce strict proofs and usages of some algorithms.
-
I will try my best to update it once a week
-
I will try my best to update it in both Chinese and English
If you feel that these documents have helped you, you can light up a small star in the upper right corner
in main branch
chapter 0 -- induction, recursive function and contradiction
chapter 1 (includes lab 1) -- static matching problems, test procedures
chapter 2 (includes lab 2) -- algorithm analysis and some representative problem
chapter 3 (includes lab 3) -- BFS, Bipartiteness, Connectivity, DAG and topological order
in master branch
tellDifference.java -- tell difference between two strings or files
QReaderQwriter.java -- used for quicker reading and writing
Lab1 assignment -- sample code for stable matching
本摘要结构主要来源于 南方科技大学(SUSTECH)计算机科学与工程系(CSE) 同名课程的课程资料和实验资料。同时很多搜索引擎,包括google,edge,还有很多网站,比如csdn,StackOverflow,chatgpt也给了我很大的帮助。在此向以上所有帮助过我的人、网站等表示感谢。
本课程主要介绍一些算法的严格证明和用法。
1.我会尽量每周更新一次
2.我会尽量更新中英文版本
如果你觉得这些文件给予了你帮助,你可以在右上角Star出点亮一个小星星
在main分支
章节0 -- 演绎法,递归函数,反证法
章节1(内部包含实验1) -- 静态匹配问题,如何测试一个程序
章节2(内部包含实验2) -- 算法分析和一些有代表性的问题
章节3(包括实验 3)-- BFS、二分性、连通性、DAG 和拓扑顺序
在master分支
tellDifference.java -- 用于区分字符串和文件的不同
QReaderQwriter.java -- 用来进行快速的控制台读写
实验1的作业 -- 稳定匹配的样例代码