A sorting algorithm that repeatedly compares adjacent elements and swaps them if they are in the wrong order, causing smaller (or larger) values to gradually migrate to one end of the array like rising bubbles. While straightforward to implement, its average and worst-case time complexity is O(n²).

Past questions testing this term · 1 questions

• 2023r05 #60手続 printArray は，配列 integerArray の要素を並べ替えて出力する。手続 printArray を呼び出したときの出力はどれか。ここで，…