冒泡排序

int main() {

const int arrSize = 8;
int arr[arrSize] = {5,21,9,87,5,54,62,6};
bool ret = true;
do
{
ret = false;
for (size_t i = 0; i < arrSize-1; i++)
{
int temp = arr[i];
if (temp > arr[i+1])
{
arr[i] = arr[i + 1];
arr[i + 1] = temp;
ret = true;
}
}

} while (ret);