I Understand
We use cookies.Click here for details.

Data Structures and Algorithms (IV)

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.

Created by Tsinghua University


brand

What you’ll learn


From this learning opportunity you will acquire the compentencies sought by employers these days. The most in demand technique from the learning resource that is commonly mentioned from companies is Data Analysis.

Who will benefit?


Comparing content from this learning opportunity with nearly 10,000 data-related job maps, we determine that those in or pursuing Data Scientist roles would benefit the most.