Algorithms for Searching, Sorting, and Indexing

This course is part of Foundations of Data Structures and Algorithms Specialization

Instructor: Sriram Sankaranarayanan

What you'll 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'll gain

  •   Programming Principles
  •   Pseudocode
  •   Computational Thinking
  •   Probability & Statistics
  •   Analysis
  •   Data Structures
  •   Big Data
  •   Algorithms

    • There are 4 modules in this course

    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.

    Heaps and Hashtable Data Structures

    Randomization: Quicksort, Quickselect, and Hashtables

    Applications of Hashtables

    Explore more from Algorithms

    Foundations of Data Structures and Algorithms

    Divide and Conquer, Sorting and Searching, and Randomized Algorithms

    Trees and Graphs: Basics

    The Binary Search Algorithm

    ©2025  ementorhub.com. All rights reserved