Naive Approach
Create a recursive function:
Pseudocode
1. Take original list and split it in half recursively
The time complexity is
C implementation
int* sort_case(int *arr){
}Create a recursive function:
1. Take original list and split it in half recursively
The time complexity is O(nlog2n)
int* sort_case(int *arr){
}