linux kernel data struct: quick sort
2013-06-11 14:28
260 查看
快速排序采用分而治之的排序方式,在一次排序后,便将整个欲排序的数组以第一个元素为为界,分为小于和大于两边;这种方式能将时间复杂度降到O(n*logn)。
以下为个人的C实现,在Dev-C上验证通过:
关于这种排序的思路,网上都有介绍,其中有种,挖了填,拆东墙补西墙的解释挺通俗易懂的,大家可以自己去了解一下;
#include <stdio.h>
#include <stdlib.h>
void quick_sort(int a[], int i, int j)
{
int m = i;
int n = j;
int temp = 0;
int x = a[i];
if(i >= j)
{
printf("end\n");
return;
}
printf("before:i = %d, j = %d\n",i,j);
while(i < j)
{
do
{
if(a[j] < x)
{
a[i] = a[j];
break;
}
else j--;
}while(i < j);
if(i >= j) break;;
do
{
if(a[i] > x)
{
a[j] = a[i];
break;
}
else i++;
}while(i < j);
if(i >= j) break;
}
if(i==j) a[i] = x;
printf("after:i = %d, j = %d\n",i,j);
for(temp = 0; temp < 10; temp++)
{
printf("% d",a[temp]);
}
quick_sort(a,m,i-1);
quick_sort(a,i+1,n);
return;
}
int main(int argc, char *argv[])
{
int i;
int a[10]={4,2,8,7,9,1,3,6,5,10};
quick_sort(a,0,9);
for(i = 0; i< 10; i++)
{
printf("% d",a[i]);
}
system("PAUSE");
return 0;
}
以下为个人的C实现,在Dev-C上验证通过:
关于这种排序的思路,网上都有介绍,其中有种,挖了填,拆东墙补西墙的解释挺通俗易懂的,大家可以自己去了解一下;
#include <stdio.h>
#include <stdlib.h>
void quick_sort(int a[], int i, int j)
{
int m = i;
int n = j;
int temp = 0;
int x = a[i];
if(i >= j)
{
printf("end\n");
return;
}
printf("before:i = %d, j = %d\n",i,j);
while(i < j)
{
do
{
if(a[j] < x)
{
a[i] = a[j];
break;
}
else j--;
}while(i < j);
if(i >= j) break;;
do
{
if(a[i] > x)
{
a[j] = a[i];
break;
}
else i++;
}while(i < j);
if(i >= j) break;
}
if(i==j) a[i] = x;
printf("after:i = %d, j = %d\n",i,j);
for(temp = 0; temp < 10; temp++)
{
printf("% d",a[temp]);
}
quick_sort(a,m,i-1);
quick_sort(a,i+1,n);
return;
}
int main(int argc, char *argv[])
{
int i;
int a[10]={4,2,8,7,9,1,3,6,5,10};
quick_sort(a,0,9);
for(i = 0; i< 10; i++)
{
printf("% d",a[i]);
}
system("PAUSE");
return 0;
}
相关文章推荐
- linux kernel data struct: binary search
- linux kernel data struct : 改进的冒泡排序法
- linux kernel data struct: KMP算法实现
- linux kernel data struct : 随机产生一副扑克牌
- linux kernel data struct : circular buf
- linux kernel data struct : find longest sub string
- Network Data Flow through the Linux Kernel
- Linux 2.6 kernel versions below 2.6.19 32bit ip_append_data() ring() root exploit.
- The task_struct of linux kernel 0.11
- linux 笔记 关于struct file 结构下 private_data 数据结构的思考
- Linux kernel data types, alignment, compat_ioctl 数据类型,对齐问题和compat_ioctl
- kernel struct file结构中的private_data
- The Detailed explanation of __initdata macro in linux kernel
- Linux kernel data types, alignment, compat_ioctl 数据类型,对齐问题和compat_ioctl
- Basic Data Structures and Algorithms in the Linux Kernel--reference
- Basic Data Structures and Algorithms in the Linux Kernel--reference
- linux 笔记 关于struct file 结构下 private_data 数据结构的思考
- Linux Device Drivers 3rd Edition Data Types in the Kernel
- Basic Data Structures and Algorithms in the Linux Kernel
- Basic Data Structures and Algorithms in the Linux kernel