#include <stdio.h>
#include <limits.h>
#include <stdlib.h>
#define SIZE 100
#define MAX 1000
//交换数据
void swap(int *a, int *b)
{
int temp;
temp = *a;
*a = *b;
*b = temp;
}
void quicksort(int data[], int low, int high)
{
int i, j, key;
if (low < high)
{
key = data[low];
i = low;
j = high;
while (i < j)
{
while((i < j) && (data[j] >= key))j--;
if(i < j)
data[i++] = data[j];
while((i < j) && (data[i] <= key))i++;
if(i < j)
data[j--] = data[i];
}
data[i] = key;
quicksort(data, low, i-1);
quicksort(data, i+1, high);
}
}
void bubblesort(int data[], int n)
{
int i, j, temp, tag;
for (i = 0, tag = 1; i < n-1 && tag==1; i++)
{
tag = 0;
for (j = 0; j < n-i-1; j++)
{
if(data[j] > data[j+1])
{
swap(&data[j], &data[j+1]);
tag = 1;
}
}
}
}
//选择排序
void selectionsort(int data[], int size)
{
int i, j, min;
//找出从a[i]到a[size-1]的最小元素的位置
for(i=0; i<size-1; i++)
{
min = i;
for(j=i+1; j<size; j++)
if(data[min] > data[j])
min = j;
//将a[i]与a[min]的数据交换
swap(&data[i], &data[min]);
}
}
//插入排序
void insertsort(int data[], int size)
{
int i,j,temp;
for(i=1; i< size; i++)
{
temp = data[i];
j = i-1;
while(j>=0 && temp < data[j])
data[j+1] = data[j--];
data[j+1]=temp;
}
}
struct node
{
int min;
int max;
};
void quicksort2(int data[], int min, int max)
{
int i, j, key, top;
struct node Stack[100];
top = -1;
if(min < max)
{
top = 0;
Stack[top].min = min;
Stack[top].max = max;
}
while(top>-1)
{
//min max记录当前处理的这个区间的左极限和有极限
i = min = Stack[top].min;
j = max = Stack[top].max;
top--;
key = data[min];
while(i<j)
{
while((i<j) && (key <= data[j]))j--;
if(i < j) data[i++] = data[j];
while((i<j) && (key >= data[i]))i++;
if(i < j) data[j--] = data[i];
}//处理一次 即将比绑定值小的全部放左边 比绑定值大的放右边
data[i] = key;
if(min < i-1)
{
top++;
Stack[top].min = min;
Stack[top].max = i-1;
}
if(max>i+1)
{
top++;
Stack[top].min = i+1;
Stack[top].max = max;
}
}
}
//希尔排序
void shellsort(int data[], int size)
{
int *delta, k, i, t, dk, j;
k = size;
delta=(int*)malloc(sizeof(int)*(size/2));
i=0;
do
{
k=k/2;
printf(" %d ",k);
delta[i++]=k;
}while(k>0);
i=0;
while((dk=delta[i])>0)
{
for(k=delta[i];k<size;k++)
{
if(data[k]<data[k-dk])
{
t=data[k];
for(j=k-dk;j>=0&&t<data[j];j-=dk)
{
data[j+dk]=data[j];
}
data[j+dk]=t;
}
}
i++;
}
}
//计数排序,排100以内数的最好方法
void countsort(int data[], int size)
{
int temp[MAX] = {0};
int i, j;
for(i=0;i<size;i++)
temp[data[i]]++;
j = 0;
for(i=0;i<MAX;i++)
{
while(0 != temp[i])
{
data[j] = i;
temp[i]--;
j++;
}
}
}
//归并排序
void Merge(int data[], int start, int mid, int end)
{
int temp1[SIZE], temp2[SIZE];
int n1, n2;
int i, j, k;
n1 = mid - start + 1;
n2 = end - mid;
//拷贝前半部分数组
for(i=0;i<n1;i++)
temp1[i] = data[start + i];
//拷贝后半部分数组
for(i=0;i<n2;i++)
temp2[i] = data[mid + i + 1];
//把后面的元素设置的很大
temp1[n1] = temp2[n2] = INT_MAX;
i = j = 0;
// 逐个扫描两部分数组然后放到相应的位置去
for(k=start;k<=end;k++)
{
if(temp1[i] <= temp2[j])
{
data[k] = temp1[i];
i++;
}
else
{
data[k] = temp2[j];
j++;
}
}
}
void mergesort(int data[], int start, int end)
{
int i;
if(start < end)
{
i = (start + end) / 2;
mergesort(data, start, i);
mergesort(data, i+1, end);
Merge(data, start, i, end);
}
}
//堆排序
void Heapify(int data[], int low, int high)
{
int t,j;
t = data[low];
for(j=2*low+1;j<high;j=j*2+1)
{
if(j<high && data[j]<data[j+1])
{
j++;
}
if(t>data[j])
{
break;
}
data[low]=data[j];
low=j;
}
data[low]=t;
}
void BuildHeap(int data[], int size)
{
int i;
for(i=size/2-1;i>=0;i--)
Heapify(data, i, size-1);
}
void heapsort(int data[], int size)
{
int i; //lastOfOrder
BuildHeap(data, size);
for(i=size-1;i>0;i--)
{
swap(&data[0], &data[i]);
Heapify(data, 0, i-1);
}
}
int main()
{
int i;
int a[7]={3,5,2,3,66,225,1};
//quicksort(a, 0, 6);
//bubblesort(a, 7);
//selectionsort(a, 7);
//insertsort(a, 7);
//quicksort2(a, 0, 6);
//shellsort(a, 7);
//countsort(a,7);
//heapsort(a, 7);
//mergesort(a, 0, 6);
for(i = 0; i < 7; i++)
printf("%d ", a[i]);
return 0;
}
#include <limits.h>
#include <stdlib.h>
#define SIZE 100
#define MAX 1000
//交换数据
void swap(int *a, int *b)
{
int temp;
temp = *a;
*a = *b;
*b = temp;
}
void quicksort(int data[], int low, int high)
{
int i, j, key;
if (low < high)
{
key = data[low];
i = low;
j = high;
while (i < j)
{
while((i < j) && (data[j] >= key))j--;
if(i < j)
data[i++] = data[j];
while((i < j) && (data[i] <= key))i++;
if(i < j)
data[j--] = data[i];
}
data[i] = key;
quicksort(data, low, i-1);
quicksort(data, i+1, high);
}
}
void bubblesort(int data[], int n)
{
int i, j, temp, tag;
for (i = 0, tag = 1; i < n-1 && tag==1; i++)
{
tag = 0;
for (j = 0; j < n-i-1; j++)
{
if(data[j] > data[j+1])
{
swap(&data[j], &data[j+1]);
tag = 1;
}
}
}
}
//选择排序
void selectionsort(int data[], int size)
{
int i, j, min;
//找出从a[i]到a[size-1]的最小元素的位置
for(i=0; i<size-1; i++)
{
min = i;
for(j=i+1; j<size; j++)
if(data[min] > data[j])
min = j;
//将a[i]与a[min]的数据交换
swap(&data[i], &data[min]);
}
}
//插入排序
void insertsort(int data[], int size)
{
int i,j,temp;
for(i=1; i< size; i++)
{
temp = data[i];
j = i-1;
while(j>=0 && temp < data[j])
data[j+1] = data[j--];
data[j+1]=temp;
}
}
struct node
{
int min;
int max;
};
void quicksort2(int data[], int min, int max)
{
int i, j, key, top;
struct node Stack[100];
top = -1;
if(min < max)
{
top = 0;
Stack[top].min = min;
Stack[top].max = max;
}
while(top>-1)
{
//min max记录当前处理的这个区间的左极限和有极限
i = min = Stack[top].min;
j = max = Stack[top].max;
top--;
key = data[min];
while(i<j)
{
while((i<j) && (key <= data[j]))j--;
if(i < j) data[i++] = data[j];
while((i<j) && (key >= data[i]))i++;
if(i < j) data[j--] = data[i];
}//处理一次 即将比绑定值小的全部放左边 比绑定值大的放右边
data[i] = key;
if(min < i-1)
{
top++;
Stack[top].min = min;
Stack[top].max = i-1;
}
if(max>i+1)
{
top++;
Stack[top].min = i+1;
Stack[top].max = max;
}
}
}
//希尔排序
void shellsort(int data[], int size)
{
int *delta, k, i, t, dk, j;
k = size;
delta=(int*)malloc(sizeof(int)*(size/2));
i=0;
do
{
k=k/2;
printf(" %d ",k);
delta[i++]=k;
}while(k>0);
i=0;
while((dk=delta[i])>0)
{
for(k=delta[i];k<size;k++)
{
if(data[k]<data[k-dk])
{
t=data[k];
for(j=k-dk;j>=0&&t<data[j];j-=dk)
{
data[j+dk]=data[j];
}
data[j+dk]=t;
}
}
i++;
}
}
//计数排序,排100以内数的最好方法
void countsort(int data[], int size)
{
int temp[MAX] = {0};
int i, j;
for(i=0;i<size;i++)
temp[data[i]]++;
j = 0;
for(i=0;i<MAX;i++)
{
while(0 != temp[i])
{
data[j] = i;
temp[i]--;
j++;
}
}
}
//归并排序
void Merge(int data[], int start, int mid, int end)
{
int temp1[SIZE], temp2[SIZE];
int n1, n2;
int i, j, k;
n1 = mid - start + 1;
n2 = end - mid;
//拷贝前半部分数组
for(i=0;i<n1;i++)
temp1[i] = data[start + i];
//拷贝后半部分数组
for(i=0;i<n2;i++)
temp2[i] = data[mid + i + 1];
//把后面的元素设置的很大
temp1[n1] = temp2[n2] = INT_MAX;
i = j = 0;
// 逐个扫描两部分数组然后放到相应的位置去
for(k=start;k<=end;k++)
{
if(temp1[i] <= temp2[j])
{
data[k] = temp1[i];
i++;
}
else
{
data[k] = temp2[j];
j++;
}
}
}
void mergesort(int data[], int start, int end)
{
int i;
if(start < end)
{
i = (start + end) / 2;
mergesort(data, start, i);
mergesort(data, i+1, end);
Merge(data, start, i, end);
}
}
//堆排序
void Heapify(int data[], int low, int high)
{
int t,j;
t = data[low];
for(j=2*low+1;j<high;j=j*2+1)
{
if(j<high && data[j]<data[j+1])
{
j++;
}
if(t>data[j])
{
break;
}
data[low]=data[j];
low=j;
}
data[low]=t;
}
void BuildHeap(int data[], int size)
{
int i;
for(i=size/2-1;i>=0;i--)
Heapify(data, i, size-1);
}
void heapsort(int data[], int size)
{
int i; //lastOfOrder
BuildHeap(data, size);
for(i=size-1;i>0;i--)
{
swap(&data[0], &data[i]);
Heapify(data, 0, i-1);
}
}
int main()
{
int i;
int a[7]={3,5,2,3,66,225,1};
//quicksort(a, 0, 6);
//bubblesort(a, 7);
//selectionsort(a, 7);
//insertsort(a, 7);
//quicksort2(a, 0, 6);
//shellsort(a, 7);
//countsort(a,7);
//heapsort(a, 7);
//mergesort(a, 0, 6);
for(i = 0; i < 7; i++)
printf("%d ", a[i]);
return 0;
}