By learning this course, you will get a comprehensive grasp of Priority Queues and string match techniques, as well as their applications. By the end of this course, you will be able to understand/implement Bucketsort, Counting-sort, and Radixsort, understand the principle/implementation/application of different Priority Queues such as complete binary heap and leftist heap, understand and implement Heapsort, understand and implement typical string matching algorithms such as KMP, BM, and Karp-Rabin, implement and analyze advanced selection/sorting algorithms such as Quicksort, QuickSelect, LinearSelect, and Shellsort.
本課程是 数据结构与算法 專項課程 專項課程的一部分
提供方


課程信息
Basic Computer Science and programming skills
您將學到的內容有
Algorithms used to solve complex problems
Principles and methods in the design and implementation of various data structures
Skills for algorithm design and performance analysis
Background on fundamental data structures and recent results
Basic Computer Science and programming skills
提供方

清华大学
Free online courses from Tsinghua University
教學大綱 - 您將從這門課程中學到什麼
第零章
第十章 优先级队列
本章内容为:优先级队列
第十一章 串(上)
本章内容为:串
第十一章 串(下)
本章内容为:串
關於 数据结构与算法 專項課程
Data structures play a central role in computer science and are the cornerstones of efficient algorithms. This specialization explores the principles and methods in the design and implementation of various data structures. You will learn the essential skills for algorithm design and performance analysis. Topics covered by this specialization range from fundamental data structures to recent research results.

常見問題
我什么时候能够访问课程视频和作业?
我订阅此专项课程后会得到什么?
Is financial aid available?
還有其他問題嗎?請訪問 學生幫助中心。