← 返回首页

数据结构与算法

Data Structures and Algorithms

课程介绍 Course Introduction

学分:3 | 先修课:离散数学 | 学期:第3学期

数据结构与算法课程系统讲解线性表、栈、队列、树、图、哈希表等基本数据结构,以及排序、搜索、动态规划、贪心算法、分治法等经典算法。课程注重时间与空间复杂度分析,培养学生高效处理大规模数据的能力,为后续机器学习、数据库系统、大数据处理等课程提供必要的算法基础与编程训练。

This course systematically covers fundamental data structures including lists, stacks, queues, trees, graphs, and hash tables, along with classic algorithms such as sorting, searching, dynamic programming, greedy algorithms, and divide-and-conquer. The course emphasizes time and space complexity analysis, develops the ability to efficiently process large-scale data, and provides essential algorithmic foundations and programming training for machine learning, database systems, and big data processing.

大作业 Final Project

作业标题:算法实现与性能对比

实现并对比多种排序与图算法在不同数据规模下的运行时间,撰写性能分析报告,分析算法复杂度与实际表现,并给出工程优化建议。

Implement and compare the runtime of various sorting and graph algorithms across different data scales, write a performance analysis report, analyze algorithm complexity versus actual performance, and provide engineering optimization recommendations.