sort
来源:互联网 发布:js记录访问次数 编辑:程序博客网 时间:2024/06/06 13:20
#include <stdio.h>
int quickSort(int argv[],int low,int high);
int selectionSort(int argv[],int);
int main(void)
{
int temp[10] = {45,64,234,56,34,345,346,765,224,645};
int temp1[10] = {45,64,234,56,34,345,346,765,224,645};
int sum = selectionSort(temp,10);
for(int i=0;i<10;i++)
{
printf("%d\n",temp[i]);
}
sum = quickSort(temp1,0,9);
for(int i=0;i<10;i++)
{
printf("%d\n",temp1[i]);
}
return 0;
}
int selectionSort(int argv[],int size)
{
int time =0;
for(int i=0;i<size;i++)
{
int minIndex = i;
for(int j=i+1;j<size;j++)
{
++time;
if(argv[j] < argv[minIndex])
{
minIndex = j;
}
}
if(minIndex !=i)
{
int temp = argv[i];
argv[i] = argv[minIndex];
argv[minIndex] = temp;
}
}
return time;
}
int quickSort(int argv[],int low,int high)
{
int key,L,H,time=0;
time++;
if(low>=high)
return time;
H=high;
L=low;
key=argv[low];
while(H != L)
{
if(L<H && argv[H] >= key)
H--;
argv[L]=argv[H];
if(L<H && argv[L] <= key)
L++;
argv[H]=argv[L];
}
argv[L] = key;
quickSort(argv,low,L-1);
quickSort(argv,L+1,high);
return time;
}
int quickSort(int argv[],int low,int high);
int selectionSort(int argv[],int);
int main(void)
{
int temp[10] = {45,64,234,56,34,345,346,765,224,645};
int temp1[10] = {45,64,234,56,34,345,346,765,224,645};
int sum = selectionSort(temp,10);
for(int i=0;i<10;i++)
{
printf("%d\n",temp[i]);
}
sum = quickSort(temp1,0,9);
for(int i=0;i<10;i++)
{
printf("%d\n",temp1[i]);
}
return 0;
}
int selectionSort(int argv[],int size)
{
int time =0;
for(int i=0;i<size;i++)
{
int minIndex = i;
for(int j=i+1;j<size;j++)
{
++time;
if(argv[j] < argv[minIndex])
{
minIndex = j;
}
}
if(minIndex !=i)
{
int temp = argv[i];
argv[i] = argv[minIndex];
argv[minIndex] = temp;
}
}
return time;
}
int quickSort(int argv[],int low,int high)
{
int key,L,H,time=0;
time++;
if(low>=high)
return time;
H=high;
L=low;
key=argv[low];
while(H != L)
{
if(L<H && argv[H] >= key)
H--;
argv[L]=argv[H];
if(L<H && argv[L] <= key)
L++;
argv[H]=argv[L];
}
argv[L] = key;
quickSort(argv,low,L-1);
quickSort(argv,L+1,high);
return time;
}
- sort
- Sort
- sort
- Sort
- sort
- Sort
- sort
- sort
- Sort
- Sort
- sort
- sort
- sort
- sort()
- sort
- sort
- sort
- sort
- 在WinForm中使用Membership身份验证(转载)
- 分段函数求值
- SCHED_FIFO与SCHED_RR
- 第八周项目1-求解分段函数的值
- jquery.onepage-scroll.js
- sort
- 关于一个宏的测试(偶数判断)
- 模拟手机和手机卡号
- Caused by: com.sun.mail.smtp.SMTPAddressFailedException: 554 5.7.1
- Python性能鸡汤
- 加油。。。。求复杂的分段函数的值
- 【AA】SQL学习笔记(二)
- HSQLDB安装与使用
- HDU 1231最大连续子序列(周赛F题)