Algorithms for Searching, Sorting, and Indexing
Completed by Emil Joakim Koljonen
August 31, 2024
35 hours (approximately)
Emil Joakim Koljonen'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: Data Structures
- Category: Python Programming
- Category: Probability & Statistics
- Category: Computational Thinking
- Category: Analysis
- Category: Algorithms
- Category: Data Science
- Category: Theoretical Computer Science
- Category: Programming Principles
