selectmenu.cpp

排序算法的内部复杂度分析,有八个算法,有时间和空间的分析,比较完整

#include"isbubble.cpp"
#include"isselect.cpp"
#include"isinsert.cpp"
#include"isshell.cpp"
#include"isquicksort.cpp"
#include"isheapsort.cpp"
#include"readme.cpp"
void selectmenu()
{
	char ch;

        do{
			ch=getchar();
			getchar();
			switch(ch)
			{
			case'a':isbubble();
			     
			   	break;
			case'b':isselect();
             
				break;
			case'c': isinsert();
                     
				break;
			case'd': isshell();
				     
				break;
            case'e': isquicksort();
				    
				break;
			case'f': isheapsort();
			    
				break;
            case'h':readme();
				break;
			case'q':
				break;
			default :
			 printf("sorry,you may press any invalid key\nBe aware at the next time when you keying!\ntry again:"); 
			}
		}while(ch!='a'&&ch!='b'&&ch!='c'&&ch!='d'&&ch!='e'&&ch!='f'&&ch!='h'&&ch!='q');
}