Seed Programming

School of Seed Programming Logo

5. Sorting Algorithms

Wishlist Share
Share Course
Page Link
Share On Social Media

About Course

This is the fifth short courseSorting Algorithms – of the Master Series on the Analysis of Algorithms. In this course, you’ll explore advanced sorting techniques beyond the traditional approaches. Learn about pseudo-algorithms like Stable Count Sort, Radix Sort, and Bucket Sort. You’ll also dive into computational geometry problems such as the Skyline and Closest Pair problems, which demonstrate the practical applications of these sorting algorithms in real-world scenarios.

What Will You Learn?

  • Stable Count Sort
  • Radix Sort
  • Bucket Sort
  • Computing the Skyline problem
  • Solving the Closest Pair problem

Course Content

Sorting Algorithms

  • Pseudo Algorithms | Stable Count Sort, Radix Sort, Bucket Sort | Computing Skyline | Closest Pair Problem
    01:15:00

Student Ratings & Reviews

No Review Yet
No Review Yet
Open chat
Hello 👋
Can we help you?
Need more information about 5. Sorting Algorithms