Algorithms for Searching, Sorting, and Indexing

This course covers basics of algorithm design and analysis, as well as algorithms for sorting arrays, data structures such as priority queues, hash functions, and applications such as Bloom filters. Algorithms for Searching, Sorting, and Indexing can be taken for academic credit as part of CU Boulder’s Master of Science in Data Science (MS-DS) degree offered on the Coursera platform. The MS-DS is an interdisciplinary degree that brings together faculty from CU Boulder’s departments of Applied M

• Explain fundamental concepts for algorithmic searching and sorting
• Describe heap data structures and analyze components like priority queues
• Design basic algorithms for sorting, selection, and hash functions

• Intermediate programming knowledge