Final Challenge #1

Lesson 8 of 9 in Coddy's Counting Sort - DSA Series course.

Challenge

Easy

Time to put a twist on Counting Sort.

Modify your countingSort function so it returns the array in descending order (from largest to smallest).

Hint: only the rebuild direction changes.

Try it yourself

#include <stdlib.h>

int* countingSort(int* arr, int arr_size, int* returnSize) {
    // Write code here
    *returnSize = arr_size;
    return arr;
}

All lessons in Counting Sort - DSA Series

1Introduction

Introduction Motivation

2The Algorithm

How it works?Pseudo Code Implementation (Part 1)Implementation (Part 2)

Time and Space Complexity

3Final Challenges

Final Challenge #1Final Challenge #2