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,...
About This Course
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 Mathematics, Computer Science, Information Science, and others. With performance-based admissions and no application process, the MS-DS is ideal for individuals with a broad range of undergraduate education and/or professional experience in computer science, information science, mathematics, and statistics. Learn more about the MS-DS program at https://www.coursera.org/degrees/master-of-science-data-science-boulder.
Topics Covered
Frequently Asked Questions
How much does Algorithms for Searching, Sorting, and Indexing cost?
Visit the Algorithms for Searching, Sorting, and Indexing course page for current pricing and available discounts.
Who teaches Algorithms for Searching, Sorting, and Indexing?
Algorithms for Searching, Sorting, and Indexing is taught by Sriram Sankaranarayanan, University of Colorado Boulder.
What skill level is Algorithms for Searching, Sorting, and Indexing for?
This course is designed for beginner learners.
Similar Courses
HTML & CSS Coding for Beginners: Build your own portfolio!
Chris Dixon
Maya for Beginners: Animation
Lucas Ridley
JavaScript for Beginners (includes 6+ real life projects)
Kalob Taulien
Beginner Bootstrap 4: Hand code beautiful responsive websites fast
Chris Dixon