/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   ft_sort_int_tab.c                                  :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: tischmid <marvin@42.fr>                    +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2023/03/19 05:36:28 by tischmid          #+#    #+#             */
/*   Updated: 2023/03/19 05:58:13 by tischmid         ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

void	ft_sort_int_tab(int *tab, int size)
{
	int	i;
	int	tmp;

	while (--size >= -1)
	{
		i = -1;
		while (++i < size)
		{
			if (tab[i] > tab[i + 1])
			{
				tmp = tab[i];
				tab[i] = tab[i + 1];
				tab[i + 1] = tmp;
			}
		}
	}
}

/* ////
#include <stdio.h>

void	print_int_arr(int *arr, int arrlen)
{
	int i;

	i = -1;
	while (++i < arrlen - 1)
	{
		printf("%d, ", arr[i]);
	}
	printf("%d\n", arr[i]);
}

int	main(void)
{
	int arrlen = 19;

	int arr[] = {1, 6, 7, 8, 8, 77, 63, 3, 64, 51, 5, 53, 65, 67, 7, 8, 68, 99, 9};
	print_int_arr(arr, arrlen);
	ft_sort_int_tab(arr, arrlen);
	print_int_arr(arr, arrlen);
	return (0);
}
*/ ////