/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   ft_sort_int_tab.c                                  :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: whaffman <whaffman@student.codam.nl>       +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2024/06/05 18:49:17 by whaffman          #+#    #+#             */
/*   Updated: 2024/06/05 19:16:50 by whaffman         ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */
void	ft_swap(int *a, int *b)
{
	int	temp;

	temp = *a;
	*a = *b;
	*b = temp;
}

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

	swapped = 1;
	while (swapped == 1)
	{
		swapped = 0;
		i = 1;
		while (i < size)
		{
			if (*(tab + i - 1) > *(tab + i))
			{
				swapped = 1;
				ft_swap(tab + i - 1, tab + i);
			}
			i++;
		}
	}
}
/*
#include <stdio.h>
int	main(void)
{
	int arr[] = {4, 1, 3, 6, 2, 5};
	ft_sort_int_tab(arr, 6);
	for (int i = 0; i < 6; i++)
		printf("%d ", arr[i]);
	return (0);
}
*/