1038: 起泡排序
Description
已知起泡排序的部分代码如下,勿改动,请补充实现起泡排序函数,要求输出每趟排序结果。
提示:起泡排序时,当某趟排序时,一次交换也未发生,则该趟排序后,即结束。
#include<iostream>
using namespace std;
const int MaxSize=100;
class List
{
private:
int r[MaxSize+1];
int n;
public:
List(){n=0;} //empty list
void InsertR(int k) //表尾插入
{ r[++n]=k;}
void Display(); //display
void BubbleSort(); //BubbleSort
};
void List::Display()
{
for(int i=1;i<=n;i++)
cout<<r[i]<<" ";
cout<<"\n";
}
int main()
{
List L;
while(1)
{
int k;
cin>>k;
if(!k) break;
L.InsertR(k);
}
//L.Display();
L.BubbleSort();
//L.Display();
return 0;
}
Input
Output
Sample Input
12 21 32 2 4 24 21 432 23 9 0
Sample Output
12 21 2 4 24 21 32 23 9 432
12 2 4 21 21 24 23 9 32 432
2 4 12 21 21 23 9 24 32 432
2 4 12 21 21 9 23 24 32 432
2 4 12 21 9 21 23 24 32 432
2 4 12 9 21 21 23 24 32 432
2 4 9 12 21 21 23 24 32 432
2 4 9 12 21 21 23 24 32 432
//
// Created by Legends丶Hu on 2020/2/8.
//
#include<iostream>
using namespace std;
const int MaxSize = 100;
class List {
private:
int r[MaxSize + 1];
int n;
public:
List() { n = 0; } //empty list
void InsertR(int k) //表尾插入
{ r[++n] = k; }
void Display(); //display
void BubbleSort(); //BubbleSort
};
void List::Display() {
for (int i = 1; i <= n; i++)
cout << r[i] << " ";
cout << "\n";
}
void List::BubbleSort() {
int exchange = n;
while (exchange) {
int bound = exchange;
exchange = 0;
for (int i = 1; i < bound; i++) {
if (r[i] > r[i + 1]) {
swap(r[i], r[i + 1]);
exchange = i;
}
}
Display();
}
}
//12 21 32 2 4 24 21 432 23 9 0
int main() {
List L;
while (1) {
int k;
cin >> k;
if (!k) break;
L.InsertR(k);
}
// L.Display();
L.BubbleSort();
// L.Display();
return 0;
}