adding neccessarry files

Author: CARTOON01

0-O

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

0-bubble_sort.c

@@ -1,46 +1,30 @@
 #include "sort.h"
-
-/**
- * swap_ints - Swap two integers in an array.
- * @a: The first integer to swap.
- * @b: The second integer to swap.
- */
-void swap_ints(int *a, int *b)
-{
-	int tmp;
-
-	tmp = *a;
-	*a = *b;
-	*b = tmp;
-}
-
 /**
- * bubble_sort - Sort an array of integers in ascending order.
- * @array: An array of integers to sort.
- * @size: The size of the array.
- *
- * Description: Prints the array after each swap.
+ * bubble_sort - sorts array using bubble sort algorithm
+ * @array: the array to be sorted
+ * @size: size of array
+ * Return: void
  */
 void bubble_sort(int *array, size_t size)
 {
-	size_t i, len = size;
-	bool bubbly = false;
-
-	if (array == NULL || size < 2)
-		return;
+	size_t i, k/*, hld = size*/;
+	int temp;
 
-	while (bubbly == false)
+	if (array)
 	{
-		bubbly = true;
-		for (i = 0; i < len - 1; i++)
+	for (i = 0; i < size; i++)
+	{
+		for (k = 0; k < size - 1; k++)
 		{
-			if (array[i] > array[i + 1])
+			if (array[k] > array[k + 1])
 			{
-				swap_ints(array + i, array + i + 1);
+				temp = array[k];
+				array[k] = array[k + 1];
+				array[k + 1] = temp;
 				print_array(array, size);
-				bubbly = false;
 			}
 		}
-		len--;
+		/*hld--;*/
+	}
 	}
 }

1-O

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

1-insertion_sort_list.c

@@ -1,52 +1,38 @@
 #include "sort.h"
-
 /**
- * swap_nodes - Swap two nodes in a listint_t doubly-linked list.
- * @h: A pointer to the head of the doubly-linked list.
- * @n1: A pointer to the first node to swap.
- * @n2: The second node to swap.
- */
-void swap_nodes(listint_t **h, listint_t **n1, listint_t *n2)
-{
-	(*n1)->next = n2->next;
-	if (n2->next != NULL)
-		n2->next->prev = *n1;
-	n2->prev = (*n1)->prev;
-	n2->next = *n1;
-
-	if ((*n1)->prev != NULL)
-		(*n1)->prev->next = n2;
-
-	else
-		*h = n2;
-
-	(*n1)->prev = n2;
-	*n1 = n2->prev;
-}
-
-/**
- * insertion_sort_list - Sorts a doubly linked list of integers
- *                       using the insertion sort algorithm.
- * @list: A pointer to the head of a doubly-linked list of integers.
- *
- * Description: Prints the list after each swap.
+ * insertion_sort_list - sorts doubly linked list using insertion sort
+ * @list: doubly linked list
+ * Return: void
  */
 void insertion_sort_list(listint_t **list)
 {
-	listint_t *iter, *insert, *tmp;
-
-	if (list == NULL || *list == NULL || (*list)->next == NULL)
-		return;
+	listint_t *ptr, *precede, *current, *nexus, *hold;
 
-	for (iter = (*list)->next; iter != NULL; iter = tmp)
+	if (list)
 	{
-		tmp = iter->next;
-		insert = iter->prev;
+	ptr = *list;
+	while (ptr)
+	{
+		current = ptr;
+		ptr = ptr->next;
 
-		while (insert != NULL && iter->n < insert->n)
+		while (current->prev && current->n < current->prev->n)
 		{
-			swap_nodes(list, &insert, iter);
-			print_list((const listint_t *)*list);
+		hold = current->prev;
+		nexus = current->next;
+		precede = hold->prev;
+		current->prev = precede;
+		if (precede)
+			precede->next = current;
+		else
+			*list = current;
+		current->next = hold;
+		hold->next = nexus;
+		hold->prev = current;
+		if (nexus)
+			nexus->prev = hold;
+		print_list(*list);
 		}
 	}
-}
+	}
+}