- Algorithms
- Analysis
- Theoretical Computer Science
- Programming Principles
- Computational Thinking
- Data Structures
- Python Programming
- Pseudocode
Algorithms for Searching, Sorting, and Indexing
Completed by NIGEL DIAS
November 30, 2021
35 hours (approximately)
NIGEL DIAS'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
