作业帮简单选择排序和堆排序问题写了一个程序用WIN-TC编译老有错误,希望高手帮忙改下,在线等#include #include #include #define datatype int void SelectSort(datatype R[],int n) { int i,k,j; for(i=1;i
来源：学生作业帮助网 编辑：作业帮 时间：2024/11/29 12:26:06
![简单选择排序和堆排序问题写了一个程序用WIN-TC编译老有错误,希望高手帮忙改下,在线等#include #include #include #define datatype int void SelectSort(datatype R[],int n) { int i,k,j; for(i=1;i](/uploads/image/z/468706-58-6.jpg?t=%E7%AE%80%E5%8D%95%E9%80%89%E6%8B%A9%E6%8E%92%E5%BA%8F%E5%92%8C%E5%A0%86%E6%8E%92%E5%BA%8F%E9%97%AE%E9%A2%98%E5%86%99%E4%BA%86%E4%B8%80%E4%B8%AA%E7%A8%8B%E5%BA%8F%E7%94%A8WIN-TC%E7%BC%96%E8%AF%91%E8%80%81%E6%9C%89%E9%94%99%E8%AF%AF%2C%E5%B8%8C%E6%9C%9B%E9%AB%98%E6%89%8B%E5%B8%AE%E5%BF%99%E6%94%B9%E4%B8%8B%2C%E5%9C%A8%E7%BA%BF%E7%AD%89%23include+%23include+%23include+%23define+datatype+int+void+SelectSort%28datatype+R%5B%5D%2Cint+n%29+%7B+int+i%2Ck%2Cj%3B+for%28i%3D1%3Bi)
简单选择排序和堆排序问题写了一个程序用WIN-TC编译老有错误,希望高手帮忙改下,在线等#include #include #include #define datatype int void SelectSort(datatype R[],int n) { int i,k,j; for(i=1;i
简单选择排序和堆排序问题
写了一个程序用WIN-TC编译老有错误,希望高手帮忙改下,在线等
#include
#include
#include
#define datatype int
void SelectSort(datatype R[],int n)
{
int i,k,j;
for(i=1;i
简单选择排序和堆排序问题写了一个程序用WIN-TC编译老有错误,希望高手帮忙改下,在线等#include #include #include #define datatype int void SelectSort(datatype R[],int n) { int i,k,j; for(i=1;i
你那个叫归并排序,我三个都写给你：
#include
#include
void swap(int* a,int* b)
{
int t;
t = *a; *a = *b; *b = t;
}
void show(char* s,int* a,int* b)
{
printf(s);
while(a != b)
printf("%d ",*a++);
putchar('\n');
}
void select_sort(int a[],int n)
{
int i,j,m;
for(i = 0; i < n; ++i) {
m = i;
for(j = i; j < n; ++j)
if(a[m] > a[j])
m = j;
swap(a+i,a+m);
}
}
void merge(int a[],int m,int n)
{
static int s[256];
int i,j,k;
for(i = k = 0,j = m; i < m && j < n;)
if(a[i] > a[j])
s[k++] = a[i++];
else
s[k++] = a[j++];
if(i == m)
i = j,j = n;
else
j = m;
while(i < j)
s[k++] = a[i++];
for(i = 0; i < n; ++i)
a[i] = s[i];
}
void merge_sort(int a[],int n)
{
int m;
if(n < 2)
return;
m = n/2;
merge_sort(a,m);
merge_sort(a+m,n-m);
merge(a,m,n);
}
void heapify(int a[],int i,int n)
{
int l,r,m;
while(1) {
r = (i + 1)*2;
l = r - 1;
m = l < n && a[l] > a[i] l :i;
m = r < n && a[r] > a[m] r :m;
if(m != i)
swap(a+i,a+m),i = m;
else break;
}
}
void heap_sort(int a[],int n)
{
int i;
for(i = (n-1)/2; i >= 0; --i)
heapify(a,i,n);
for(i = n-1; i > 0; --i) {
swap(a,a+i);
heapify(a,0,--n);
}
}
int main()
{
int a[] = {6,1,3,8,4,0,9,7,5,2};
select_sort(a,10);
show("选择排序:\t",a,a+10);
merge_sort(a,10);
show("归并排序:\t",a,a+10);
heap_sort(a,10);
show("堆排序:\t\t",a,a+10);
return 0;
}