feat: add quick sort for int *

Author: 42lan

Makefile

@@ -6,7 +6,7 @@
 #    By: amalsago <[email protected]>          +#+  +:+       +#+         #
 #                                                 +#+#+#+#+#+   +#+            #
 #    Created: 2018/11/15 11:06:32 by amalsago          #+#    #+#              #
-#    Updated: 2020/02/22 11:03:45 by amalsago         ###   ########.fr        #
+#    Updated: 2020/02/29 14:21:28 by amalsago         ###   ########.fr        #
 #                                                                              #
 # **************************************************************************** #
 
@@ -106,6 +106,7 @@ SRCNAME		= conversions/ft_atoi.c					\
 			  print/ft_putstr.c		\
 			  print/ft_putstr_fd.c	\
 			  sorting/ft_qsort.c	\
+			  sorting/ft_qsort_int.c	\
 			  string/form_path.c			\
 			  string/ft_getenv.c			\
 			  string/ft_realpath.c			\

includes/libft.h

@@ -6,7 +6,7 @@
 /*   By: amalsago <[email protected]>          +#+  +:+       +#+        */
 /*                                                +#+#+#+#+#+   +#+           */
 /*   Created: 2018/11/09 12:05:58 by amalsago          #+#    #+#             */
-/*   Updated: 2020/02/22 11:03:30 by amalsago         ###   ########.fr       */
+/*   Updated: 2020/02/29 14:21:10 by amalsago         ###   ########.fr       */
 /*                                                                            */
 /* ************************************************************************** */
 
@@ -139,6 +139,7 @@ void				ft_putstr_fd(char const *s, int fd);
 */
 
 void				ft_qsort(char **array, int left, int right);
+void				ft_qsort_int(int *array, int lo, int hi);
 
 /*
 ** STRING

sources/sorting/ft_qsort_int.c

@@ -0,0 +1,47 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   ft_qsort_int.c                                     :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: amalsago <[email protected]>          +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2020/02/29 13:46:40 by amalsago          #+#    #+#             */
+/*   Updated: 2020/02/29 14:32:57 by amalsago         ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "libft.h"
+
+static int		ft_partition(int *array, int lo, int hi)
+{
+	int			i;
+	int			j;
+	int			pivot;
+
+	i = lo;
+	j = lo - 1;
+	pivot = array[hi];
+	while (i <= hi - 1)
+	{
+		if (array[i] <= pivot)
+		{
+			++j;
+			ft_swap(&array[i], &array[j], sizeof(int));
+		}
+		++i;
+	}
+	ft_swap(&array[j + 1], &array[hi], sizeof(int));
+	return (j + 1);
+}
+
+void			ft_qsort_int(int *array, int lo, int hi)
+{
+	int			pivot;
+
+	if (lo < hi)
+	{
+		pivot = ft_partition(array, lo, hi);
+		ft_qsort_int(array, lo, pivot - 1);
+		ft_qsort_int(array, pivot + 1, hi);
+	}
+}