Algorithms for Searching, Sorting, and Indexing
Completed by Philip Ranney
December 23, 2023
35 hours (approximately)
Philip Ranney'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: Computational Thinking
- Category: Python Programming
- Category: Analysis
- Category: Data Science
- Category: Algorithms
- Category: Probability & Statistics
- Category: Data Structures
- Category: Theoretical Computer Science
