Algorithms for Searching, Sorting, and Indexing
It is one of the Best Online Sorting Courses. This course covers the fundamentals of algorithm design and analysis, array sorting algorithms, hash functions, priority queues, and applications like Bloom filters. As a part of the Master of Science in Data Science (MS-DS) program at CU Boulder, which is available on the Coursera platform, students may take Algorithms for Searching, Sorting, and Indexing for academic credit. The MS-DS is a multidisciplinary degree that brings together academics from the Applied Mathematics, Computer Science, Information Science, and other departments at CU Boulder.
The MS-DS is best suited for people with a wide variety of undergraduate education and/or professional experience in computer science, information science, mathematics, and statistics since it has performance-based admissions and no application procedure. This course will help you grasp key ideas and will include practice problems so that you can easily complete online coding challenges and code-athons. The main issues in this area of specialty include randomized algorithms, asymptotic ("Big-oh") notation, and sorting and searching (QuickSort, contraction algorithm for min cuts).
This course offers:
- Flexible deadlines: Reset deadlines in accordance to your schedule.
- Certificate: Earn a Certificate upon completion
- 100% online
- Intermediate Level
- Approx. 35 hours to complete
- Subtitles: English
Course Rating: 4.7/5
Enroll here: https://www.coursera.org/learn/algorithms-searching-sorting-indexing