sorting_algorithms

Author: victorpreston

0-O

@@ -0,0 +1,3 @@
+O(n)
+O(n^2)
+O(n^2)

2-O

@@ -0,0 +1,3 @@
+O(n^2)
+O(n^2)
+O(n^2)

2-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");
+    selection_sort(array, n);
+    printf("\n");
+    print_array(array, n);
+    return (0);
+}

2-selection_sort.c

@@ -0,0 +1,47 @@
+#include "sort.h"
+
+/**
+ * selection_sort - Calls function
+ * @array: Array to be sorted
+ * @size: Size of array given
+ * Descrtiption: Function that sorts an array using the Selection
+ * sort algotrithm
+ * Return: 0
+ */
+void selection_sort(int *array, size_t size)
+{
+	unsigned int i, j, min_idx;
+
+	if (!array)
+		return;
+
+	for (i = 0; i < size - 1; i++)
+	{
+		min_idx = i;
+		for (j = i + 1; j < size; j++)
+			if (array[j] < array[min_idx])
+				min_idx = j;
+
+		if (i != min_idx)
+		{
+			swap_func(&array[min_idx], &array[i]);
+			print_array(array, size);
+		}
+	}
+}
+
+/**
+ * swap_func - Function that swaps two values
+ *
+ * @a: Fisrt value
+ * @b: Second value
+ * Return: 0
+ */
+void swap_func(int *a, int *b)
+{
+	int tmp;
+
+	tmp = *b;
+	*b = *a;
+	*a = tmp;
+}