<ul><li>Bubble sort is a sorting algorithm which swaps two elements if the next element is greater in value.</li><li>Bubble sort involves two loops, an outer and an inner one.</li><li>In bubble sort, the largest element is sorted and brought to the end of the list in every iteration.</li><li>An implementation of bubble sort in C is provided to sort an array by comparing and swapping elements.</li><li>Bubble sort has a time complexity of O(n^2) as it always compares two elements in each pass.</li><li>Bubble sort sorts an array by making comparisons between two adjacent values and swapping them whenever required.</li><li>The sorted array can be displayed with the 'print_array' function.</li><li>Bubble sort is commonly used in small-scale applications and not as much in larger real-time applications.</li><li>The program saves processing time by breaking out of the loop if no swapping is done after the third pass.</li><li>Bubble sort is not considered an efficient sorting algorithm for large arrays.</li></ul>

Sorting algorithm 1: Bubble sort

Discover more