7,774
社区成员




#include<stdio.h>
int a[5]={8,9,5,7,6};
quicksort(int a[],int l,int r)
{
int i=l,j=r;
int tmp=a[(l+r)/2],tt;
do
{
while(a[j]>tmp) j--;
while(a[i]<tmp) i++;
if(i<=j)
{
tt=a[i];a[i]=a[j];a[j]=tt;
i++;j--;
}
}
while(i<=j);
if(i<r)quicksort(a,i,r);
if(j>l)quicksort(a,l,j);
}
int main()
{
int i,j;
quicksort(a,0,4);
for(i=0;i<5;i++)
printf("%d ",a[i]);
printf("\n");
return 0;
}
private static void SortNum()
{
Int32[] array = new Int32[] { 1, 14, 8, 17, 3, 6 };
Console.WriteLine("冒泡排序前:");
for (int i = 0; i < array.Length; i++)
{
if (i == array.Length - 1)
Console.Write(array[i]);
else
Console.Write(array[i] + ",");
}
int temp = 0;
for (int i = 0; i < array.Length - 1; i++)
{
for (int j = 0; j < array.Length - 1 - i; j++)
{
if (array[j] > array[j + 1])
{
temp = array[j];
array[j] = array[j + 1];
array[j + 1] = temp;
}
}
}
Console.WriteLine("\n"+"冒泡排序后:");
for (int i = 0; i < array.Length; i++)
{
if (i == array.Length - 1)
Console.Write(array[i]);
else
Console.Write(array[i] + ",");
}
}
void BubbleSort(int[] values)
{
for (int i = 1; i < values.Length; i++)
{
for (int j = values.Length - 1; j >= i; j--)
{
if (values[j - 1] > values[j])
{
int temp = values[j - 1];
values[j - 1] = values[j];
values[j] = temp;
}
}
}
}