2.cpp

调用方法,简单的使用栈实现进制间的转换。如十进制和八进制的转换/设计一个算法

#include <stdio.h>
quick(int first,int end,int a[])
{int left=first,right=end,key;
key=a[first];
while(left<right)
{while((left<right)&&(a[right]>=key))
right--;
if(left<right)
a[left++]=a[right];
while((left<right)&&(a[left]<=key))
left++;
if(left<right)
a[right]=a[left];}
a[left]=key;
return left;}
quick_sort(int a[],int first,int end)
{int split;
if(end>first)
   {split=quick(first,end,a);
   quick_sort(a,first,split-1);
   quick_sort(a,split+1,end);
   }}
main()
{int a[6],i;
printf("Please using Quick Sotrt make taxis："\n);  
printf("Please input 6 Number："\n);
 for(i=0;i<6;i++)scanf("%d",&a[i]);
quick_sort(a,0,5);
printf("After taxis' ordering:"\n);
for(i=0;i<6;i++)printf("  %d",a[i]);
printf("\n");}