sorting_algorithms

Author: victorpreston

100-shell_sort.c

@@ -0,0 +1,58 @@
+#include "sort.h"
+
+/**
+ * swap - Function that swaps two values
+ *
+ * @a: Fisrt value
+ * @b: Second value
+ * Return: 0
+ */
+void swap(int *a, int *b)
+{
+	int tmp;
+
+	tmp = *b;
+	*b = *a;
+	*a = tmp;
+}
+
+/**
+ * gap_sort - sort array with gaps
+ * @array: array to be sorted
+ * @size: size of array
+ * @gap: gap size
+ */
+void gap_sort(int *array, size_t size, unsigned int gap)
+{
+	size_t j, k;
+
+	for (j = gap; j < size; j++)
+	{
+		k = j;
+		while (k >= gap && array[k] < array[k - gap])
+		{
+			swap(array + k, array + k - gap);
+			k -= gap;
+		}
+	}
+}
+
+/**
+ * shell_sort - shell sort
+ * @array: array to be sorted
+ * @size: size of array
+ */
+void shell_sort(int *array, size_t size)
+{
+	unsigned int gap = 1;
+
+	while (gap < size / 3)
+		gap = gap * 3 + 1;
+
+	while (gap >= 1)
+	{
+		gap_sort(array, size, gap);
+		gap = (gap - 1) / 3;
+		print_array(array, size);
+	}
+}

main/100-main.c

@@ -0,0 +1,21 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include "sort.h"
+
+/**
+ * main - Entry point
+ *
+ * Return: Always 0
+ */
+int main(void)
+{
+    int array[] = {19, 48, 99, 71, 13, 52, 96, 73, 86, 7};
+    size_t n = sizeof(array) / sizeof(array[0]);
+
+    print_array(array, n);
+    printf("\n");
+    shell_sort(array, n);
+    printf("\n");
+    print_array(array, n);
+    return (0);
+}