Skip to main content

CS303: Algorithms

Page path
  • Home /
  • Courses /
  • Course Catalog /
  • Computer Science /
  • CS303: Algorithms /
  • Unit 4: Sorting Algorithms
Back to course 'CS303: Algorithms'
  • Unit 4: Sorting Algorithms

    This unit introduces algorithms that sort real numbers. Algorithms often use sorting as a key subroutine. There is a wide variety of sorting algorithms, and they use a rich set of techniques. These algorithms have different runtime complexities and work better in certain conditions. Some of algorithms that we will study include Quick Sort, Insertion Sort, Bubble Sort, and Merge Sort.

    Completing this unit should take you approximately 7 hours.

    • Unit 4 Learning Outcomes Page
    • 4.1: Introduction to Sorting Algorithms

      • Knight School: "Algorithmic Thinking" Page

        Watch this video to learn about sorting algorithms.

      • "Google Interview with Barack Obama" Page

        Watch this video to learn about sorting algorithms.

    • 4.2: Sorting Algorithms - Part I

      • Massachusetts Institute of Technology: Dr. Charles E. Leiserson's "Quicksort, Randomized Algorithms" Page

        Watch this video to learn about the basics of sorting algorithms.

    • 4.3: Sorting Algorithms - Part II

      • Massachusetts Institute of Technology: Dr. Erik Demaine's "Introduction to Algorithms" Page

        Watch this video to learn about various types of sorting algorithms.

    • 4.4: Popular Sorting Algorithms

      •  Wikipedia: "Sorting Algorithms" URL

        Read this article to learn about the popular sorting algorithms in use today.

      •  Sorting Assignment URL

        Please complete all questions in this assignment. There are two questions on the sorting algorithms. The first one involves the merge-sort algorithm and requires you to work through the merging part of the algorithm. The second one then asks you to implement the merging work that you just completed in the first problem. You can check your answers against the Answer Key.

Navigation

Art History
Biology
Business Administration
Chemistry
Communication
Economics
English
History
Mathematics

Creative Commons License
© Saylor Academy 2010-2018 except as otherwise noted. Excluding course final exams, content authored by Saylor Academy is available under a Creative Commons Attribution 3.0 Unported license. Third-party materials are the copyright of their respective owners and shared under various licenses. See www.saylor.org/open/licensinginformation for detailed licensing information.

Saylor Academy and Saylor.org® are trade names of the Constitution Foundation, a 501(c)(3) organization through which our educational activities are conducted.

Terms of Use | Privacy Policy