一组记录的关键字为(52,56,26,12,69,85,33,48,70),给出快速排序的过程.52,56,26,12,69,85,33,48,70第一趟排序 33,48,26,12,52,85,69,56,70第二趟排序 26,12,33,48,52,69,56,70,85第三趟排序 12,26,33,48,52,56,70,69,85第四趟排
来源:学生作业帮助网 编辑:作业帮 时间:2024/07/12 16:31:44
![一组记录的关键字为(52,56,26,12,69,85,33,48,70),给出快速排序的过程.52,56,26,12,69,85,33,48,70第一趟排序 33,48,26,12,52,85,69,56,70第二趟排序 26,12,33,48,52,69,56,70,85第三趟排序 12,26,33,48,52,56,70,69,85第四趟排](/uploads/image/z/1331786-2-6.jpg?t=%E4%B8%80%E7%BB%84%E8%AE%B0%E5%BD%95%E7%9A%84%E5%85%B3%E9%94%AE%E5%AD%97%E4%B8%BA%2852%2C56%2C26%2C12%2C69%2C85%2C33%2C48%2C70%29%2C%E7%BB%99%E5%87%BA%E5%BF%AB%E9%80%9F%E6%8E%92%E5%BA%8F%E7%9A%84%E8%BF%87%E7%A8%8B.52%2C56%2C26%2C12%2C69%2C85%2C33%2C48%2C70%E7%AC%AC%E4%B8%80%E8%B6%9F%E6%8E%92%E5%BA%8F+33%2C48%2C26%2C12%2C52%2C85%2C69%2C56%2C70%E7%AC%AC%E4%BA%8C%E8%B6%9F%E6%8E%92%E5%BA%8F+26%2C12%2C33%2C48%2C52%2C69%2C56%2C70%2C85%E7%AC%AC%E4%B8%89%E8%B6%9F%E6%8E%92%E5%BA%8F+12%2C26%2C33%2C48%2C52%2C56%2C70%2C69%2C85%E7%AC%AC%E5%9B%9B%E8%B6%9F%E6%8E%92)
一组记录的关键字为(52,56,26,12,69,85,33,48,70),给出快速排序的过程.52,56,26,12,69,85,33,48,70第一趟排序 33,48,26,12,52,85,69,56,70第二趟排序 26,12,33,48,52,69,56,70,85第三趟排序 12,26,33,48,52,56,70,69,85第四趟排
一组记录的关键字为(52,56,26,12,69,85,33,48,70),给出快速排序的过程.
52,56,26,12,69,85,33,48,70
第一趟排序 33,48,26,12,52,85,69,56,70
第二趟排序 26,12,33,48,52,69,56,70,85
第三趟排序 12,26,33,48,52,56,70,69,85
第四趟排序 12,26,33,48,52,56,70,69,85
第五趟排序 12,26,33,48,52,56,70,69,85
第一趟排序的结果为什么会是 33呢?是不是答案给错了,如果不是,能麻烦给个具体的过程么
一组记录的关键字为(52,56,26,12,69,85,33,48,70),给出快速排序的过程.52,56,26,12,69,85,33,48,70第一趟排序 33,48,26,12,52,85,69,56,70第二趟排序 26,12,33,48,52,69,56,70,85第三趟排序 12,26,33,48,52,56,70,69,85第四趟排
虽然快速算法普遍被接受和认可,但具体的算法,各种书籍、资料稍微有一些出入,或导致实际操作的步骤数等有些许差别.
这里,我用如下的代码:(C语言版)
#include<stdio.h>
int a[100];
void prt(int n)
{
int i;
for(i=1;i<=n;i++)
printf("%d ",a[i]);
}
void quicksort(int a[],int l,int h)
{
if (l>=h)return ;
int j ,i,key;
i=l;j=h;key=a[i];
while(i<j)
{
while(i<j&&a[j]>key)j--;
if (i<j) a[i++]=a[j];
while (i<j&&a[i]<key)i++;
if (i<j) a[j--]=a[i];
}
a[i]=key;
if (l<i-1)
quicksort(a,l,i-1);
if (i+1<h)
quicksort(a,i+1,h);
}
int main()
{
int i,n;
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
quicksort(a,1,n);
prt(n);
scanf("%d",&a[i]);
return 0;
}
我也仅仅举第一趟的结果为例,余下的相信你可以在启发之下完成,毕竟只是重要的是去掌握,而不是别人全部教~
第一趟步骤如下:
所以,第一趟的结果应该是:48,33, 26, 12, 52, 85, 69, 56, 70
48,33, 26, 12, 52, 85, 69, 56, 70