Menu
Coddy logo textTech
Course

Counting Sort - DSA Series

Master Counting Sort, a non-comparison algorithm that sorts non-negative integers in linear time by tallying values. Build the counting phase, write the full sort in your language of choice, analyze its O(n + k) complexity, and practice with coding challenges.

Topics

Syllabus

3 chapters9 lessons1 project3 challenges52 quiz questions

Introduction

2 lessons14
  • 01Introduction
  • 02Motivation

The Algorithm

Project5 lessons138
  • 01How it works?
  • 02Pseudo Code
  • 03Implementation (Part 1)
  • 04Implementation (Part 2)
  • 05Time and Space Complexity

Final Challenges

2 lessons2
  • 01Final Challenge #1
  • 02Final Challenge #2

More like this

Frequently asked questions

How many lessons does Counting Sort - DSA Series have?

Counting Sort - DSA Series contains 9 interactive lessons you can complete at your own pace.

What does Counting Sort - DSA Series cover?

The course is organized into chapters covering: Introduction, The Algorithm, Final Challenges.

Is Counting Sort - DSA Series free?

Yes - every course on Coddy is free to start. You can complete lessons in your browser without any downloads or signup.
Coddy programming languages illustration

Start Counting Sort - DSA Series for free

GET STARTED