第三周作业——冒泡排序和归并排序
#include <stdio.h>
#include <fstream>
#include <iostream>
using namespace std;
冒泡
//Bubble sort
void bubbleSort()
{
int Text[10000000];
int j;
int k;
int Transit;
int i = 0;
ifstream fileInput;
fstream fileOutput;
fileInput.open("E:\\largeW1.txt");
while(!fileInput.eof())
{
fileInput>>Text[i];
i++;
}
for (j = 0;j <= i - 1; j++)
{
for (k = 0; k < i - j; k++)
{
if (Text[k] > Text[k +1])
{
Transit = Text[k];
Text[k] = Text[k + 1];
Text[k + 1] = Transit;
}
}
}
fileOutput.open("E:\\largeW2.txt", ios_base::out);
fileOutput<<Text[i];
fileOutput.close();
}
void main()
{
bubbleSort();
}