数据结构课--排序算法（插入、希尔、冒泡、快速、选择、堆、归并）

#include<bits/stdc++.h>

using namespace std;

void menu(){
   
	cout<<"请选择你需要的功能："<<endl;
	cout<<"1.插入排序"<<endl;
	cout<<"2.希尔排序"<<endl;
	cout<<"3.冒泡排序"<<endl;
	cout<<"4.快速排序"<<endl;
	cout<<"5.选择排序"<<endl;
	cout<<"6.堆排序"<<endl;
	cout<<"7.归并排序"<<endl;
	cout<<"8.退出"<<endl; 
	cout<<"请选择你需要的功能："<<endl; 
}

void Print(int* a, int len){
   
	cout<<"排序的结果为：";
	for(int i = 0; i < len; i ++ ){
   
		cout<<a[i]<<" ";
	} 
	return ;
}

void InsertSort(int* a, int len){
   
	for(int i = 0; i < len - 1; i ++ ){
   
		int end = i;
		int temp = a[end + 1];
		while(end >= 0){
   
			if(temp < a[end]){
   
				a[end + 1] = a[end];
				end -- ;
			}
			else{
   
				break;
			}
		}
		a[end + 1] = temp;
	}
	Print(a, len);
	cout<<endl;
	return ;
} 

void ShellSort(int* a, int len){
   
	int gap = len;
	while(gap > 1){
   
		gap /= 2;
		for(int i = 0; i < len - gap; i ++ ){
   
			int end = i;
			int temp = a[end + gap];
			while(end >= 0){
   
				if(temp < a[end]){
   
					a[end + gap] = a[end];
					end -= gap;
				}
				else{