quick sort
来源:互联网 发布:淘宝客服催单用语 编辑:程序博客网 时间:2024/05/20 18:42
#include<stdio.h>
int Division(int a[],int left,int right)
{
int base=a[left];
while(left<right)
{
while(right>left && a[right]>base)
right--;
a[left]=a[right];
left++;
while(left<right && a[left]<base)
left++;
a[right]=a[left];
right--;
}
a[left]=base;
return left;
}
void QuickSort(int a[],int left,int right)
{
int i;
if(left<right)
{
i=Division(a,left,right);
QuickSort(a,left,i-1);
QuickSort(a,i+1,right);
}
}
int main()
{
int a[10]={72,6,57,88,60,42,83,73,48,85};
int i;
QuickSort(a,0,9);
for(i=0;i<10;i++)
printf("%d ",a[i]);
return 0;
}
int Division(int a[],int left,int right)
{
int base=a[left];
while(left<right)
{
while(right>left && a[right]>base)
right--;
a[left]=a[right];
left++;
while(left<right && a[left]<base)
left++;
a[right]=a[left];
right--;
}
a[left]=base;
return left;
}
void QuickSort(int a[],int left,int right)
{
int i;
if(left<right)
{
i=Division(a,left,right);
QuickSort(a,left,i-1);
QuickSort(a,i+1,right);
}
}
int main()
{
int a[10]={72,6,57,88,60,42,83,73,48,85};
int i;
QuickSort(a,0,9);
for(i=0;i<10;i++)
printf("%d ",a[i]);
return 0;
}
0 0
- Quick Sort
- Quick Sort
- quick sort
- quick sort
- quick sort
- Quick Sort
- Quick Sort
- quick sort
- Quick Sort
- Quick Sort
- Quick Sort
- Quick Sort
- Quick Sort
- Quick Sort
- Quick Sort
- Quick Sort
- quick sort
- Quick sort
- dwz 点击table自动排序
- Monitoring the Dispatcher Queue
- Android初始化语言
- scrapy结合webkit抓取js生成的页面
- 动态创建对话框WND形式
- quick sort
- String和StringBuffer 在java中引用和赋值
- AS3移动设备上的触控事件和手势(转)
- jQuery自带方法/函数来获取outerHTML
- linux内存管理--linux内核高端内存
- 最近总结
- Linux上SVN的 "db/txn-current-lock: Permission denied" 问题解决办法
- 磨刀不误砍材工 - Java的基础语言要素(数组)
- 良好的编程风格