排序操作实验报告

scanf(\switch(i) { } } } case 1: InsertSort(L,n); break; case 2: BubbleSort(L,n); break; case 3: SelectSort(L,n); break; case 0: exit(0); default: printf(\错误！请重新输入...\\n\ break;