C++冒泡排序

用C++比用C可读性和方便性要强些。

#include<iomanip>
#include<iostream>
#include<vector>
#include<ctime>

using namespace std;

#define VECTOR_SIZE		500


int main(int argc, char* argv[])
{
	/*cout << argv[argc - 1] << endl;*/
	vector<int> arr;
	/*cout << arr.capacity() << endl;*/
	srand(time(NULL));
	for (int i = 0; i < VECTOR_SIZE; i++)
	{
		arr.push_back(rand());
	}
	/*cout << arr.size() << endl;*/
	for (auto a : arr)
	{
		cout << a << " ";
	}
	cout << endl;
	auto start = clock();
	for (int j = arr.size()-1; j > 0; j--)
	{
		for (int i = 0; i < j; i++)
		{
			if (arr.at(i) > arr.at(i + 1))
			{
				//cout << arr.at(i) << " " << arr.at(i + 1) << endl;
				int tmp = arr.at(i);
				arr[i] = arr[i + 1];
				arr[i + 1] = tmp;
			}
		}
	}

	auto end = clock();

	for (auto a : arr)
	{
		cout << a << " ";
	}
	cout << endl;
	auto duration = (double)(end - start) / CLOCKS_PER_SEC;
	cout << duration << "seconds" << endl;

	return 0;
}