TD1_DEV51_Qualite_Algo_MaximeLeb/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;
				swapped=1;
			}
		}
	} while(swapped==1);
}







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;
				swapped++;
			}
		}
	} while(swapped==1);
}


	int * test = (int*) malloc(length*sizeof(int));
	int max = -1;
	for (j=1;j<length;j++){
		int indice = 0;
		for(i=1;i<length;i++){
			if(array[i]>max){
				indice = i ;
				max =array[i];
			}
		}
		test[indice]=max;
		array[indice]=-1;
	}
	for (j=1;j<length;j++){





	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;
				swapped++;
			}
		}
	} while(swapped==1)
}