Algorithms for Searching, Sorting, and Indexing
Develop expertise in fundamental algorithms for data manipulation, organization, and analysis using Python, with hands-on projects and real-world applications.
Develop expertise in fundamental algorithms for data manipulation, organization, and analysis using Python, with hands-on projects and real-world applications.
This course cannot be purchased separately - to access the complete learning experience, graded assignments, and earn certificates, you'll need to enroll in the full Foundations of Data Structures and Algorithms Specialization program. You can audit this specific course for free to explore the content, which includes access to course materials and lectures. This allows you to learn at your own pace without any financial commitment.
4.7
(354 ratings)
43,883 already enrolled
Instructors:
English
پښتو, বাংলা, اردو, 2 more
Powered by
What you'll learn
Design and analyze fundamental searching and sorting algorithms
Implement heap data structures and priority queues
Develop efficient hash functions and hash tables
Master quicksort and quickselect algorithms
Apply advanced indexing techniques with Bloom filters
Skills you'll gain
This course includes:
9.8 Hours PreRecorded video
15 quizzes
Access on Mobile, Tablet, Desktop
FullTime access
Shareable certificate
Closed caption
Get a Completion Certificate
Share your certificate with prospective employers and your professional network on LinkedIn.
Created by
Provided by
Top companies offer this course to their employees
Top companies provide this course to enhance their employees' skills, ensuring they excel in handling complex projects and drive organizational success.
There are 4 modules in this course
This comprehensive course covers essential algorithms for searching, sorting, and indexing data. Students learn fundamental concepts through practical implementations in Python, including insertion sort, binary search, merge sort, heap data structures, hash tables, and advanced applications like Bloom filters. The course emphasizes both theoretical understanding through algorithm analysis and practical implementation skills.
Basics of Algorithms Through Searching and Sorting
Module 1 · 10 Hours to complete
Heaps and Hashtable Data Structures
Module 2 · 9 Hours to complete
Randomization: Quicksort, Quickselect, and Hashtables
Module 3 · 9 Hours to complete
Applications of Hashtables
Module 4 · 6 Hours to complete
Fee Structure
Instructor
Professor
Sriram Sankaranarayanan is a professor of Computer Science at the University of Colorado Boulder, where he teaches a variety of courses on algorithms, theory of computation, mathematical optimization and programming languages. His research studies how computers can be used to verify and design other computer systems by combining ideas from mathematical logic, theory of computation and control theory. He uses these to analyze "safety-critical" systems ranging from autonomous vehicles to artificial pancreas devices for patients with type-1 diabetes. Sriram obtained a PhD in computer science from Stanford University. Subsequently he worked as a research staff member at NEC research labs in Princeton, NJ. He has been on the faculty at CU Boulder since 2009. Sriram has been the recipient of awards including the CAREER award from NSF, and the Provost's faculty achievement award at CU Boulder.
Testimonials
Testimonials and success stories are a testament to the quality of this program and its impact on your career and learning journey. Be the first to help others make an informed decision by sharing your review of the course.
4.7 course rating
354 ratings
Frequently asked questions
Below are some of the most commonly asked questions about this course. We aim to provide clear and concise answers to help you better understand the course content, structure, and any other relevant information. If you have any additional questions or if your question is not listed here, please don't hesitate to reach out to our support team for further assistance.