int main()
{
int pole1[10] = {7, 1, 2, 0, 8, 4, 5, 3, 9, 6};
int pole2[10] = {0, 3, 1, 8, 7, 2, 5, 4, 6, 9};
int pole3[10] = {2, 1, 3, 6, 9, 0, 4, 5, 7, 8};
printf("Původní pole1: ");
VypisPole(pole1, 10);
InsertSort(pole1, 10);
printf("\nSetřízené pole1 (InsertSort): ");
VypisPole(pole1, 10);
printf("\nPůvodní pole2: ");
VypisPole(pole2, 10);
BubbleSort(pole2, 10);
printf("\nSetřízené pole2 (BubbleSort): ");
VypisPole(pole2, 10);
printf("\nPůvodní pole3: ");
VypisPole(pole3, 10);
SelectSort(pole3, 10);
printf("\nSetřízené pole3 (SelectSort): ");
VypisPole(pole3, 10);
return 0;
}
int main(int argc, char *argv[]){
FILE *fp;
int *array, num, flag;
num = atoi(argv[2]);
flag = atoi(argv[3]);
array = (int *)malloc(sizeof(int) * num);
if((fp = fopen(argv[1], "rb")) == NULL){
fprintf(stderr, "Cant open file\n");
exit(1);
}
fread(array, sizeof(int), num, fp);
fclose(fp);
switch(flag){
case 1:
SelectSort(array, num);
break;
case 2:
InsertSort(array, num);
break;
default:
fprintf(stderr, "Wrong Flag(%d)!! \n", flag);
exit(1);
}
free(array);
return dTrue;
}
int main()
{
int a[6] = {1, 5, 9, 3, 2, 8};
SelectSort(a, 6);
std::cout << a[0] << a[1] << a[2] <<
a[3] << a[4] << a[5] << std::endl;
return 1;
}
void TestSelectSort()
{
int array[] = {2,5,6,9,1,3,4,7,8,0};
SelectSort(array,sizeof(array)/sizeof(array[0]));
for(int i = 0; i<sizeof(array)/sizeof(array[0]); i++)
{
cout<<array[i] <<" " ;
}
cout <<endl;
}
int _tmain(int argc, _TCHAR* argv[]) {
int* mas = new int[ MAX ];
srand(time(NULL));
printf("===================================\n");
printf("\tBubble sort\n");
printf("===================================\n");
for (int i = 0; i < MAX; i++)
mas[ i ] = rand() % 30;
printf("Before:\n");
for (int i = 0; i < MAX; i++)
printf("%d ", mas[i]);
BubbleSort(mas, MAX);
printf("\n-----------------------------------\n");
printf("After:\n");
for (int i = 0; i < MAX; i++)
printf("%d ", mas[i]);
printf("\n-----------------------------------\n");
printf("\n\n\n");
printf("===================================\n");
printf("\tSelect sort\n");
printf("===================================\n");
printf("Before:\n");
for (int i = 0; i < MAX; i++)
mas[ i ] = rand() % 30;
for (int i = 0; i < MAX; i++)
printf("%d ", mas[ i ]);
SelectSort(mas, MAX);
printf("\n-----------------------------------\n");
printf("After:\n");
for (int i = 0; i < MAX; i++)
printf("%d ", mas[ i ]);
printf("\n-----------------------------------\n");
return 0;
}
int main2 (void)
{
int a[] = {21, 3, 12, 0, 5, 3, 18, 22, 30, 8, 6 };
int i, length = sizeof(a) / sizeof(int);
SelectSort(a, length);
for (i = 0; i < length; ++i)
{
printf("%d ", a[i]);
}
return 0;
}
void SelectSortTest()
{
int arr[] = {9,1,5,8,3,7,4,6,2};
int length = sizeof(arr)/sizeof(arr[0]);
printf("Befor sort:\n");
PrintArr(arr, length);
SelectSort(arr, length);
printf("After sort:\n");
PrintArr(arr, length);
}
int main()
{
int i, a[]={5,2,6,0,3,9,1,7,4,8};
int len=sizeof(a)/sizeof(int);
SelectSort(a, len);
printf("排序后的结果是:\n");
for(i=0; i<len; i++)
{
printf("%d ", a[i]);
}
printf("\n\n");
}
int main(int argc, char *argv[]) {
SqList L = { { 0, 12, 57, 90, 8, 34, 10, 42, 99, 64, 56, 73, 27 }, 12 };
SqList *ptrL = &L;
SelectSort(ptrL);
for (int i = 1; i <= ptrL->length; i++) {
printf("%d ", ptrL->r[i]);
}
return 0;
}
int main(void)
{
int i;
int arr[10] = {9,5,2,4,8,7,3,6,1,0};
SelectSort(arr,10);
for (i=0; i<10;i++)
{
printf("%d ",arr[i]);
}
getch();
return 0;
}
int main()
{
int arr[] = {1, 7, 5, 3, 8, 6, 15, 13, 14};
int i, n = sizeof(arr)/sizeof(arr[0]);
/*BubbleSort(arr, n);*/
SelectSort(arr, n);
for(i=0; i<n; i++) {
printf("%d\t", arr[i]);
}
return 0;
}
int main()
{
int arrData[10] = {2, 46, 5, 17, 2, 3, 99, 12, 66, 21};
printf("[********** Before SelectSort **********]\n");
Output(arrData, sizeof(arrData) / sizeof(int));
SelectSort(arrData, sizeof(arrData) / sizeof(int));
printf("[********** After SelectSort **********]\n");
Output(arrData, sizeof(arrData) / sizeof(int));
return 0;
}
int main()
{
int i = 0;
int array[10] = {9, 3, 2, 5, 4, 7, 6, 0, 1, 8};
SelectSort(array, sizeof(array)/sizeof(int));
for(i = 0; i < sizeof(array)/sizeof(int); i++)
{
printf("%d ",array[i]);
}
printf("\n");
system("pause");
return 0;
}
int main()
{
int N,MAX;
printf("Please input the length of your randomness list: ");
scanf("%d",&N);
printf("Please set the MAX number of random range: ");
scanf("%d",&MAX);
int a1[N];
generator(a1, N, MAX);
printlist2(a1, N);
SelectSort(a1, N);
printlist2(a1, N);
return 0;
}
void main()
{
int i;
int dlta[max];
SqList l,a,b,c,d,e,f;
CreateSq(&l);
a=b=c=d=e=f=l;
BubbleSort(&a);
SelectSort(&b);
QuickSort(&c);
ShellSort(&d,dlta);
Heapsort(&e);
insertsort(&f);
}
void main()
{
RedType d[N]={{49,1},{38,2},{65,3},{97,4},{76,5},{13,6},{27,7},{49,8}};
SqList l;
int i;
for(i=0;i<N;i++)
l.r[i+1]=d[i];
l.length=N;
printf("排序前:\n");
print(l);
SelectSort(&l);
printf("排序后:\n");
print(l);
}
int change(int *mat)
{
int i = 0, j = 0;
SelectSort(mat, 25);
int help[5] = {mat[0], mat[1], mat[2], mat[3], mat[24]};
while (i < 25) {
if (i != 12) {
*(mat+i) = help[j%4];
j++;
}
i++;
}
mat[12] = help[4];
return 0;
}
int main(){
int data[] = {8,5,3,1,9,2,7,4,6};
int len;
GET_ARRAY_LEN(data, len);
// 打印原始需排序成员
printf("original : ");
printIntArray(data, len);
// 冒泡排序
SelectSort(data, len);
// 打印最终结果
printf("result : ");
printIntArray(data, len);
}
int main()
{
int iData[MAX_CNT];
SetData(iData,MAX_CNT);
time_t sTmp = clock();
//선택 정렬
SelectSort(iData,MAX_CNT);
time_t eTmp = clock();
printf("\n%s : %8.3f[%ld]\n","선택 정렬",(eTmp-sTmp)/(double)CLK_TCK,eTmp-sTmp);
PrintData(iData, 10);
SetData(iData, MAX_CNT);
sTmp = clock();
//거품 정렬
BubbleSort(iData, MAX_CNT);
eTmp = clock();
printf("\n%s : %8.3f[%ld]\n", "거품 정렬", (eTmp - sTmp) / (double)CLK_TCK, eTmp - sTmp);
PrintData(iData, 10);
SetData(iData, MAX_CNT);
sTmp = clock();
//삽입 정렬
InsertSort(iData, MAX_CNT);
eTmp = clock();
printf("\n%s : %8.3f[%ld]\n", "삽입 정렬", (eTmp - sTmp) / (double)CLK_TCK, eTmp - sTmp);
PrintData(iData, 10);
SetData(iData, MAX_CNT);
sTmp = clock();
//쉘 정렬
ShellSort(iData, MAX_CNT);
eTmp = clock();
printf("\n%s : %8.3f[%ld]\n", "쉘 정렬", (eTmp - sTmp) / (double)CLK_TCK, eTmp - sTmp);
PrintData(iData, 10);
SetData(iData, MAX_CNT);
sTmp = clock();
//퀵 정렬
QuickSort(iData,0, MAX_CNT-1);
eTmp = clock();
printf("\n%s : %8.3f[%ld]\n", "퀵 정렬", (eTmp - sTmp) / (double)CLK_TCK, eTmp - sTmp);
PrintData(iData, 10);
return 0;
}
int main(int argc, char const *argv[])
{
int data[MAX_SIZE] = {0};
for (int i = 0; i < MAX_SIZE; ++i)
{
data[i] = rand()%100;
printf("%d\t", data[i]);
}
printf("\n");
SelectSort(data, (int)MAX_SIZE);
for (int i = 0; i < MAX_SIZE; ++i)
{
printf("%d\t", data[i]);
}
printf("\n");
return 0;
}
int main()
{
int i;
int *array;
printf("请输入数组的大小：");
scanf("%d", &n);
array = (int*) malloc(sizeof(int) * n);
printf("请输入数据（用空格分隔）：");
for (i = 0; i < n; i++)
{
scanf("%d", &array[i]);
}
SelectSort(array);
printf("排序后为：");
for (i = 0; i < n; i++)
{
printf("%d ", array[i]);
}
printf("\n");
}
int main(int argc,int *argv[])
{
int i;
sqList myList;
srand((unsigned)time(NULL));
myList.length = MAXSIZE -1;
myList.r[0] = 0;
for(i = 1;i <= myList.length;i++)
{
myList.r[i] = rand() % 100;
}
SelectSort(&myList);
for(i = 0;i <= myList.length;i++)
{
printf("%d--%d ",i,myList.r[i]);
}
}
void TestSelectSort(int arr[], size_t len)
{
// PArr(arr, len);
SelectSort(arr, len);
// PArr(arr,len);
}
