Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

# Data Structures and Algorithms (IV)

## Overview

##### Class Central Tips
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.

## Syllabus

• 第零章
• 第十章 优先级队列
• 本章内容为：优先级队列
• 第十一章 串（上）
• 本章内容为：串
• 第十一章 串（下）
• 本章内容为：串
• 第十二章 排序
• 本章内容为：排序
• 编程作业

Junhui Deng

## Reviews

Start your review of Data Structures and Algorithms (IV)

### Never Stop Learning!

Get personalized course recommendations, track subjects and courses with reminders, and more.