tom/CMake_C_Template
Template
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions
Cmake C template project.
2 commits 1 branch 0 tags 149 KiB
Find a file Use this template
Exact
Tom Irgang 14b759584b
 quicksort
2025-09-17 21:56:26 +02:00
.vscode inital cmake project 2025-09-15 19:34:08 +02:00
app quicksort 2025-09-17 21:56:26 +02:00
docs/quicksort quicksort 2025-09-17 21:56:26 +02:00
include/modern_c_challenge_1 inital cmake project 2025-09-15 19:34:08 +02:00
src quicksort 2025-09-17 21:56:26 +02:00
tests quicksort 2025-09-17 21:56:26 +02:00
.gitignore inital cmake project 2025-09-15 19:34:08 +02:00
CMakeLists.txt quicksort 2025-09-17 21:56:26 +02:00
README.md inital cmake project 2025-09-15 19:34:08 +02:00

README.md

Modern C - Challenge 1: Sequential sorting algorithms

Can you do:

  • A merge sort (with recursion)
  • A quick sort (with recursion)

on arrays with sort keys such as double or strings to your liking?

Nothing is gained if you don’t know whether your programs are correct. Therefore, can you provide a simple test routine that checks whether the resulting array really is sorted? This test routine should just scan once through the array and should be much, much faster than your sorting algorithms.