Final Challenge #2
Lesson 9 of 9 in Coddy's Insertion Sort - DSA Series course.
Challenge
EasyCreate a variation of Insertion Sort that sorts elements in descending order but skips every second element during the sorting process.
Make sure to print the sorted array at the end of the function, element by element, with a new line in between.
Try it yourself
#include <stdio.h>
void insertionSort(int* arr, int arr_size) {
// Write code here
}
