asp教程.net c排序方法
namespace quicksort
{
class quicksort
{
public static void sort(int[] array)
{
dosort(array,0, array.length-1);
}
private static void dosort( int[] array, int start, int end)
{
if( start < end)
{
int temp = partition(array, start, end);
dosort(array, start, temp-1);
dosort(array, temp + 1, end);
}
}
private static int partition(int[] array,int start, int end)
{
int index = start - 1;
for( var i=start; i< end; i++)
{
if( array[i] < array[end])
{
index++;
swap(array, index, i);
}
}
swap(array, index +1, end);
return index + 1;
}
private static void swap(int[] array, int index1, int index2)
{
var temp = array[index1];
array[index1] = array[index2];
array[index2] = temp;
}
}
}
国外的一款c 排序方法
#include
#include#define num_items 100
void quicksort(int numbers[], int array_size);
void q_sort(int numbers[], int left, int right);int numbers[num_items];
int main()
{
int i;//seed random number generator
srand(getpid());//fill array with random integers
for (i = 0; i < num_items; i++)
numbers[i] = rand();//perform quick sort on array
quicksort(numbers, num_items);printf("done with sort.n");
for (i = 0; i < num_items; i++)
printf("%in", numbers[i]);
}
void quicksort(int numbers[], int array_size)
{
q_sort(numbers, 0, array_size - 1);
}
void q_sort(int numbers[], int left, int right)
{
int pivot, l_hold, r_hold;l_hold = left;
r_hold = right;
pivot = numbers[left];
while (left < right)
{
while ((numbers[right] >= pivot) && (left < right))
right--;
if (left != right)
{
numbers[left] = numbers[right];
left++;
}
while ((numbers[left] <= pivot) && (left < right))
left++;
if (left != right)
{
numbers[right] = numbers[left];
right--;
}
}
numbers[left] = pivot;
pivot = left;
left = l_hold;
right = r_hold;
if (left < pivot)
q_sort(numbers, left, pivot-1);
if (right > pivot)
q_sort(numbers, pivot+1, right);
}
模拟火车
模拟火车让你当回真正的火车司机,得先学会看信号灯、操作控制杆
可口的披萨美味的披萨
可口的披萨美味的披萨带您体验经营一家披萨店的乐趣。游戏画风温
定制虚拟偶像最新版
定制虚拟偶像最新版是一款超级经典有趣的日本模拟装扮类型的手游
病娇模拟器手机版正版(yandere simulator)
病娇模拟器最新版手游是一款萌妹二次元模拟游戏,玩家在游戏中可
停车场多人游戏最新版
停车场多人游戏对于喜欢停车手游的玩家是非常受欢迎的,游戏中你