(C++)写一个排序函数接口,能完成对整数和小数的排序。 接口中多传入一个缺省参数,如果不指定,就采用A排序方式,如果指定了,就按他的选择决定排序方式(至少包含三种)。
用一个函数接口对不同的数据类型排序, 就要用到函数重载
我们在fun.h中声明所需要的接口函数和排序后函数
#pragma once
#include<iostream>
using namespace std;
void mysort(int* src, int size, int n = 0);
void mysort(double* src, int size, int n = 0);
void InsertSort(int* src, int size);//插排
void BubbleSort(int* src, int size);//冒泡
void SelectionSort(int* src, int size);//选择
void ShellSort(int* src, int size);//希尔
void PrintArray(int* src, int size);//打印
void InsertSort(double* src, int size);//插排
void BubbleSort(double* src, int size);//冒泡
void SelectionSort(double* src, int size);//选择
void ShellSort(double* src, int size);//希尔
void PrintArray(double* src, int size);//打印
在fun.cpp中定义这些函数 :
#include"fun.h"
void InsertSort(int* src, int size) { //直接插入排序
int tmp, j;
for (int i = 1; i < size; ++i) {
tmp = src[i];
for (j = i; j > 0 && src[j - 1] > tmp; --j) {
src[j] = src[j - 1];
}
src[j] = tmp;
}
}
void ShellSort(int* src, int size) {
int gap, j;
int tmp;
gap = size / 3;//n/3是最快的
for (int k = 0; gap; ++k) {
if (k >= gap) {
gap /= 2;
k = -1;
continue;
}
for (int i = gap + k; i < size; i += gap) {
tmp = src[i];
for (j = i; j >= gap && src[j - gap] > tmp; j -= gap) {
src[j] = src[j - gap];
}
src[j] = tmp;
}
}
}
void Swap(int* a, int* b) {
int tmp = *a;
*a = *b;
*b = tmp;
}
void BubbleSort(int* src, int size) {
for (int i = 0; i < size; ++i) {
for (int j = 0; j < size - i - 1; ++j) {
if (src[j] > src[j + 1]) {
Swap(src + j, src + j + 1);
}
}
}
}
void SelectionSort(int* src, int size) {
for (int i = 0; i < size; ++i) {
for (int j = i + 1; j < size; ++j) {
if (src[i] > src[j]) {
Swap(src + i, src + j);
}
}
}
}
void PrintArray(int* src, int size) {
for (int i = 0; i < size; ++i) {
cout << src[i] << ' ';
}
cout << endl;
}
void InsertSort(double* src, int size) { //直接插入排序
double tmp;
int j;
for (int i = 1; i < size; ++i) {
tmp = src[i];
for (j = i; j > 0 && src[j - 1] > tmp; --j) {
src[j] = src[j - 1];
}
src[j] = tmp;
}
}
void ShellSort(double* src, int size) {
int gap, j;
double tmp;
gap = size / 3;//n/3是最快的
for (int k = 0; gap; ++k) {
if (k >= gap) {
gap /= 2;
k = -1;
continue;
}
for (int i = gap + k; i < size; i += gap) {
tmp = src[i];
for (j = i; j >= gap && src[j - gap] > tmp; j -= gap) {
src[j] = src[j - gap];
}
src[j] = tmp;
}
}
}
void Swap(double* a, double* b) {
double tmp = *a;
*a = *b;
*b = tmp;
}
void BubbleSort(double* src, int size) {
for (int i = 0; i < size; ++i) {
for (int j = 0; j < size - i - 1; ++j) {
if (src[j] > src[j + 1]) {
Swap(src + j, src + j + 1);
}
}
}
}
void SelectionSort(double* src, int size) {
for (int i = 0; i < size; ++i) {
for (int j = i + 1; j < size; ++j) {
if (src[i] > src[j]) {
Swap(src + i, src + j);
}
}
}
}
void PrintArray(double* src, int size) {
for (int i = 0; i < size; ++i) {
cout << src[i] << " ";
}
cout << endl;
}
void mysort(int* src, int size,int n) {
if (n == 0) {
cout << "冒泡\n";
BubbleSort(src, size);
}
else if (n == 1) {
cout << "插入\n";
InsertSort(src, size);
}
else if (n == 2) {
cout << "选择\n";
SelectionSort(src, size);
}
else {
cout << "希尔\n";
ShellSort(src, size);
}
}
void mysort(double* src, int size,int n) {
if (n == 0) {
cout << "冒泡\n";
BubbleSort(src, size);
}
else if (n == 1) {
cout << "插入\n";
InsertSort(src, size);
}
else if (n == 2) {
cout << "选择\n";
SelectionSort(src, size);
}
else {
cout << "希尔\n";
ShellSort(src, size);
}
}
在main.cpp中实现调试入口
#include"fun.h"
#define N 10
int main() {
int src1[N] = { 4,8,1,6,9,10,2,7,3,5 };
double src2[N] = { 4.5,8.6,1.7,6.8,9.67,10.90,2.45,7.67,3.12,5.1 };
mysort(src1, N);
PrintArray(src1, N);
mysort(src2, N, 100);
PrintArray(src2, N);
system("pause");
return 0;
}
运行结果