Algorithms for Searching, Sorting, and Indexing
Completed by Daniel Smith
October 16, 2021
35 hours (approximately)
Daniel Smith's account is verified. Coursera certifies their successful completion of Algorithms for Searching, Sorting, and Indexing
What you will learn
Explain fundamental concepts for algorithmic searching and sorting
Describe heap data structures and analyze heap components, such as arrays and priority queues
Design basic algorithms to implement sorting, selection, and hash functions in heap data structures
Skills you will gain
- Category: Algorithms
- Category: Data Science
- Category: Computational Thinking
- Category: Analysis
- Category: Data Structures
- Category: Theoretical Computer Science
- Category: Probability & Statistics
- Category: Python Programming
