常见排序算法之选择排序及算法对比

选择排序

之前已经写过一篇关于冒泡排序及其改进的文章，参考博客。现在介绍一下简单选择排序。

算法思想

选择排序，从头至尾扫描序列，找出最小的一个元素，和第一个元素交换，接着从剩下的元素中继续这种选择和交换方式，最终得到一个有序序列。相比于冒泡排序，交换的次数更少，性能优于冒泡排序。

时间复杂度

最坏时间复杂度O(n²)

选择排序代码

void MySort::SelectSort(std::vector<int>& nums) 
{
	int count1 = 0, count2 = 0;
	int min = 0;
	int numsSize = nums.size();
	for (int i = 0; i < numsSize ; i++) {
		min = i;
		for (int j = i + 1; j < numsSize; j++) {
			count1++;
			if (nums[min] > nums[j]) {	
				min = j;
			}
		}
		if (min != i)
		{
			count2++;
			int tmp = nums[i];
			nums[i] = nums[min];
			nums[min] = tmp;
		}
		
	}
	std::cout << "比较次数：" << count1 << " 交换次数：" << count2 << std::endl;
}

选择排序测试

#include <iostream>
#include <vector>
#include <cstdlib>//rand(),srand
#include <ctime>//time()
#include "print_data.h"
#include "mysort.h"

using namespace std;
int main()
{
	srand((int)time(NULL));//随机种子
	vector<int> nums,nums1;
	print_data printTest;
	MySort sortTest;
	for (int i = 0; i < 10; i++)
	{
		nums.push_back(rand() % 100);//生成0-99之间的随机数
	}
	/*nums.push_back(1);
	nums.push_back(0);
	nums.push_back(2);
	nums.push_back(3);
	nums.push_back(4);
	nums.push_back(5);
	nums.push_back(6);
	nums.push_back(7);
	nums.push_back(8);
	nums.push_back(9);*/


	//nums1 = nums;

	//经典冒泡排序
	/*printTest.printVector(nums);
	sortTest.BubbleSort(nums);
	printTest.printVector(nums);
	cout << endl;*/
	//改进冒泡排序
	/*printTest.printVector(nums1);
	sortTest.BubbleSort1(nums1);
	printTest.printVector(nums1);
	cout << endl;*/
	//选择排序
	printTest.printVector(nums);
	sortTest.SelectSort(nums);
	printTest.printVector(nums);

	system("pause");
	return 0;
}

结果

选择排序与冒泡排序对比

冒泡排序算法见这篇博客。

测试代码

#include <iostream>
#include <vector>
#include <cstdlib>//rand(),srand
#include <ctime>//time()
#include "print_data.h"
#include "mysort.h"

using namespace std;
int main()
{
	srand((int)time(NULL));//随机种子
	vector<int> nums,nums1;
	print_data printTest;
	MySort sortTest;
	for (int i = 0; i < 10; i++)
	{
		nums.push_back(rand() % 100);//生成0-99之间的随机数
	}
	/*nums.push_back(1);
	nums.push_back(0);
	nums.push_back(2);
	nums.push_back(3);
	nums.push_back(4);
	nums.push_back(5);
	nums.push_back(6);
	nums.push_back(7);
	nums.push_back(8);
	nums.push_back(9);*/


	nums1 = nums;

	//经典冒泡排序
	/*printTest.printVector(nums);
	sortTest.BubbleSort(nums);
	printTest.printVector(nums);
	cout << endl;*/
	//改进冒泡排序
	printTest.printVector(nums1);
	sortTest.BubbleSort1(nums1);
	printTest.printVector(nums1);
	cout << endl;
	//选择排序
	printTest.printVector(nums);
	sortTest.SelectSort(nums);
	printTest.printVector(nums);

	system("pause");
	return 0;
}

对比结果

可以看到选择排序算法的交换次数小于改进后的冒泡排序。

完整代码

mysort.h

#pragma once
#include <vector>
#include <iostream>
class MySort {
public:
	void BubbleSort(std::vector<int>& nums);//冒泡排序
	void BubbleSort1(std::vector<int>& nums);//改进冒泡排序
	void SelectSort(std::vector<int>& nums);//选择排序
};

mysort.cpp

#include "mysort.h"
void MySort::BubbleSort(std::vector<int>& nums) {
	int count1 = 0, count2 = 0;
	int numsSize = nums.size();
	for (int i = 0; i < numsSize - 1; i++) {
		for (int j = 0; j < numsSize -1 - i; j++) {
			count1++;
			if (nums[j] > nums[j+1]){
				count2++;
				int tmp = nums[j];
				nums[j] = nums[j+1];
				nums[j+1] = tmp;
			}
		}
	}
	std::cout << "比较次数：" << count1 << " 交换次数：" << count2 << std::endl;
}

void MySort::BubbleSort1(std::vector<int>& nums) {
	int count1 = 0, count2 = 0;
	int numsSize = nums.size();
	bool flag = true;
	for (int i = 0; (i < numsSize - 1) && flag; i++) {
		flag = false;
		for (int j = 0; j < numsSize - 1 - i; j++) {
			count1++;
			if (nums[j] > nums[j + 1]) {
				count2++;
				flag = true;
				int tmp = nums[j];
				nums[j] = nums[j + 1];
				nums[j + 1] = tmp;
			}
		}
	}
	std::cout << "比较次数：" << count1 << " 交换次数：" << count2 << std::endl;
}

void MySort::SelectSort(std::vector<int>& nums) 
{
	int count1 = 0, count2 = 0;
	int min = 0;
	int numsSize = nums.size();
	for (int i = 0; i < numsSize ; i++) {
		min = i;
		for (int j = i + 1; j < numsSize; j++) {
			count1++;
			if (nums[min] > nums[j]) {	
				min = j;
			}
		}
		if (min != i)
		{
			count2++;
			int tmp = nums[i];
			nums[i] = nums[min];
			nums[min] = tmp;
		}
		
	}
	std::cout << "比较次数：" << count1 << " 交换次数：" << count2 << std::endl;
}

print_data.h

//#pragma once	两种方式防止重定义
#ifndef PRINT_DATA_H
#define PRINT_DATA_H
#include <iostream>
#include <vector>
class print_data
{
public:
	print_data() = default;
	~print_data() = default;
	void printHello();
	void printNum(int num);
	void printVector(std::vector<int> nums);
private:
};


#endif // !PRINT_DATA_H

print_data.cpp

#include "print_data.h"

void print_data::printHello() {
	std::cout << "print_data function!" << std::endl;
}
void print_data::printNum(int num){
	std::cout << num << std::endl;
}

void print_data::printVector(std::vector<int> nums) {
	int size = nums.size();
	for (int i = 0; i < size; i++)
	{
		std::cout << nums[i] << " ";
	}
	std::cout << std::endl;
}

main.cpp

#include <iostream>
#include <vector>
#include <cstdlib>//rand(),srand
#include <ctime>//time()
#include "print_data.h"
#include "mysort.h"

using namespace std;
int main()
{
	srand((int)time(NULL));//随机种子
	vector<int> nums,nums1;
	print_data printTest;
	MySort sortTest;
	for (int i = 0; i < 10; i++)
	{
		nums.push_back(rand() % 100);//生成0-99之间的随机数
	}
	/*nums.push_back(1);
	nums.push_back(0);
	nums.push_back(2);
	nums.push_back(3);
	nums.push_back(4);
	nums.push_back(5);
	nums.push_back(6);
	nums.push_back(7);
	nums.push_back(8);
	nums.push_back(9);*/


	nums1 = nums;

	//经典冒泡排序
	/*printTest.printVector(nums);
	sortTest.BubbleSort(nums);
	printTest.printVector(nums);
	cout << endl;*/
	//改进冒泡排序
	printTest.printVector(nums1);
	sortTest.BubbleSort1(nums1);
	printTest.printVector(nums1);
	cout << endl;
	//选择排序
	printTest.printVector(nums);
	sortTest.SelectSort(nums);
	printTest.printVector(nums);

	system("pause");
	return 0;
}