/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   ft_sort_string_tab.c                               :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: jayang <[email protected]>                      +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2022/02/17 11:01:43 by jayang            #+#    #+#             */
/*   Updated: 2022/02/17 20:57:35 by jayang           ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

int	ft_ptrlen(char **ptr)
{
	int	index;

	index = 0;
	while (ptr[index] != 0)
		index++;
	return (index);
}

void	ft_swap(char **ptr1, char **ptr2)
{
	char	*temp;

	temp = *ptr1;
	*ptr1 = *ptr2;
	*ptr2 = temp;
}

char	ft_strcmp(char *s1, char *s2)
{
	int	i;

	i = 0;
	while (s1[i] && (s1[i] == s2[i]))
		i++;
	return (s1[i] - s2[i]);
}

void	ft_sort_string_tab(char **tab)
{
	int	i;
	int	j;
	int	tab_size;

	tab_size = ft_ptrlen(tab);
	i = 0;
	while (i < tab_size)
	{
		j = 0;
		while (j < tab_size - 1 - i)
		{
			if (ft_strcmp(tab[j], tab[j + 1]) > 0)
				ft_swap(tab + j, tab + j + 1);
			j++;
		}
		i++;
	}
}