TD1_DEV51_Qualite_Algo/bubblesort.c

// Bubblesort Algorithm
// M.Menault 2024

void bubblesort(int* array, int length)
{
	int swapped, i, tmp;
	do
	{
		swapped = 0;
		for(i=1;i<length;i++)
		{
			if(array[i-1] > array[i])
			{
				/*tmp = array[i-1];
				array[i-1] = array[i];
				array[i] = tmp;*/
				swap(array[i-1],array[i]);
				swapped++;
			}
		}
	} while(swapped==1);
}

void swap(int a, int b)
{
    int temp = a;
    a = b;
    b = temp;
}