Bubble sorting function CODE



Bubble sort is a simple sorting algorithm. The algorithm starts at the beginning of the data set. It compares the first two elements, and if the first is greater than the second, it swaps them. It continues doing this for each pair of adjacent elements to the end of the data set. It then starts again with the first two elements, repeating until no swaps have occurred on the last pass.[25] This algorithm s average and worst-case performance is O(n2), so it is rarely used to sort large, unordered data sets.