improved versiob of bubble sort:

void bubbleSort ( int arr[], int size) {

int i, j, temp;

for (i = 0; i

{

bool swap = false;

for ( j = size 1; j > i; j--)

if (arr[j]

{

temp = arr[j]; // swap adjacent elments arr[j] = arr[i];

arr[i] = temp;

swap = true;

} // if

if(!swap)

break;

} // bubbleSort

using these algorithms: public static void insertionSort (int [] a) int i, j, temp; fori-1; i 0) && (aj-1]>temp)) al- a-1]: while alil temp; )// for The running time of insertion sort is O(n 2) bubble sort: public static void bubbleSort (int D a) int i, j, temp for 0; - temp = all; //swap adjacent elements al)- ali-1]: ai-1] temp )/l if I/ bubbleSort selection sort: public static void selectionSort (int Da) int i, j, temp, min; for (i 0; i a.length; i++) min i; for (i-i+1: j al temp aj://swap with the next minimum a[i] = a[min]; almin-temp