BUAA_数据结构_6TH_3.整数排序(排序-基本题)
第六次作业链接
易错点
建议完全参考题目中出现的代码
完整参考代码
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define maxn 1010
int num[maxn];
int merge_temp[maxn];
int cmp_times;
/*
20 1
38 356 98 -102 126 46 65 -9 100 0 21 2 90 8 18 12 78 16 189 23
*/
void selectSort(int k[],int n);
void bubbleSort(int k[],int n);
void adjust(int arr[],int low,int high);
void heapSort(int arr[],int n);
void Merge(int a[],int s,int m,int e,int b[]);
void MergeSort(int a[],int s,int e,int b[]);
void quickSort(int v[],int left,int right);
void swap(int v[],int i,int j);
int main()
{
int n,sort_way;
scanf("%d %d",&n,&sort_way);
for(int i=0;i<n;i++){
scanf("%d",&num[i]);
}
cmp_times=0;
switch(sort_way){
case 1:
selectSort(num,n);
break;
case 2:
bubbleSort(num,n);
break;
case 3:
heapSort(num,n);
break;
case 4:
MergeSort(num,0,n-1,merge_temp);
break;
case 5:
quickSort(num,0,n-1);
break;
}
for(int i=0;i<n;i++){
printf("%d ",num[i]);
}
printf("\n%d\n",cmp_times);
return 0;
}
void selectSort(int k[],int n)
{
int i,j,d;
int temp;
for(i=0;i<n-1;i++){
d=i;
for(j=i+1;j<n;j++){
if(k[j]<k[d]){
d=j;
}
cmp_times++;
}
if(d!=i){
temp=k[d] ;
k[d]=k[i];
k[i]=temp;
}
}
}
void bubbleSort(int k[],int n)
{
int i,j,flag=1;
int temp;
for(i=n-1; i>0 && flag==1; i--){
flag=0;
for(j=0;j<i;j++){
if(k[j]>k[j+1]){
temp=k[j];
k[j]=k[j+1];
k[j+1]=temp;
flag=1;
}
cmp_times++;
}
}
}
void adjust(int arr[],int low,int high)
{
int i,j,temp;
i=low;
temp=arr[i];
j=2*i+1;
while(j<high){
if(j<high-1&&arr[j]<arr[j+1]){
j++;
}
cmp_times++;
if(temp>=arr[j]){
break;
}
arr[(j-1)/2]=arr[j];
j=2*j+1;
}
arr[(j-1)/2]=temp;
}
void heapSort(int arr[],int n)
{
int i;
int temp;
for(i=n/2-1;i>=0;--i)
adjust(arr,i,n);
for(i=n-1;i>=1;--i){
temp=arr[i];
arr[i]=arr[0];
arr[0]=temp;
adjust(arr,0,i);
}
}
void Merge(int a[],int s,int m,int e,int b[])
{
int pb=s;
int p1=s,p2=m+1;
while(p1 <= m && p2 <= e){
cmp_times++;
if(a[p1]>a[p2]){
b[pb]=a[p2];
pb++;
p2++;
}
else{
b[pb]=a[p1];
pb++;
p1++;
}
}
while(p1 <= m){
b[pb]=a[p1];
pb++;
p1++;
}
while(p2 <= e){
b[pb]=a[p2];
pb++;
p2++;
}
for(int t=s;t<=e;t++)
a[t] = b[t];
}
void MergeSort(int a[],int s,int e,int b[])
{
if(s<e){
int m=s+(e-s)/2;
MergeSort(a,s,m,b);
MergeSort(a,m+1,e,b);
Merge(a,s,m,e,b);
}
}
void quickSort(int v[],int left,int right)
{
int i,last;
if(left>=right)
return;
last=left;
for(i=left+1;i<=right;i++){
cmp_times++;
if(v[i]<v[left])
swap(v,++last,i);
}
swap(v,left,last);
quickSort(v,left,last-1);
quickSort(v,last+1,right);
}
void swap(int v[],int i,int j)
{
int tmp;
tmp=v[i];
v[i]=v[j];
v[j]=tmp;
}
有问题
或bug欢迎私戳/评论