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?
Остались вопросы? Посетите Центр поддержки учащихся.