Write a function that sorts an array of integers in ascending order using the Shell sort algorithm, using the Knuth sequence. Prototype: void shell_sort(int *array, size_t size);

Author: FaroukOyekunle

100-shell_sort.c

@@ -1,39 +1,34 @@
 #include "sort.h"
 
+void insertion_sort(int *, long int, long int, size_t);
+
 /**
- * shell_sort - Sorts an array of integers in ascending order using Shell sort
- * @array: The array to be sorted
- * @size: The size of the array
- */
+* shell_sort - shell sort algorithm
+*
+* @array: array to sort
+* @size: size of array
+*/
 void shell_sort(int *array, size_t size)
 {
- size_t gap = 1, i, j;
- int temp;
-
- if (array == NULL || size < 2)
- return;
-
- while (gap < size / 3)
- gap = gap * 3 + 1;
-
- while (gap >= 1)
- {
- for (i = gap; i < size; i++)
- {
- temp = array[i];
- j = i;
-
- while (j >= gap && array[j - gap] > temp)
- {
- array[j] = array[j - gap];
- j -= gap;
- }
-
- array[j] = temp;
- }
-
- print_array(array, size);
-
- gap /= 3;
- }
+long int n = 1;
+long int i, k, tmp;
+
+if (size < 2)
+return;
+
+while (n < (long int)size / 3)
+n = n * 3 + 1;
+
+while (n > 0)
+{
+for (i = n; i < (long int) size; i++)
+{
+tmp = array[i];
+for (k = i; k >= n && array[k - n] > tmp; k = k - n)
+array[k] = array[k - n];
+array[k] = tmp;
+}
+print_array(array, size);
+n = (n - 1) / 3;
+}
 }