sortari.cpp

来自「STRUCTURI DE DATE SI ALGORITMI」· C++ 代码 · 共 54 行

#include "sortari.h"
#include<dos.h>


int compara(int x, int y)
{
	delay(50);
	return (x<y)? -1: (x==y?0:1);
}


void insertionsort(int* v, int n)
{
    int k,i,temp;
    for(k=1;k<n;k++){
	temp=v[k];
	i=k-1;
	while(i>=1 && v[i]>temp){
		v[i+1]=v[i];
		i--;
		}
	v[i+1]=temp;
	}
}

void merge(int* v, int l, int m, int h)
{
    int b[4000];
    int i=l,j=m+1,k=l;
    while(i<=m && j<=h)
	if(v[i]<v[j])
		 b[k++]=v[i++];
	else
		 b[k++]=v[j++];
    while(i<=m)
	b[k++]=v[i++];
    while(j<=h)
	b[k++]=v[j++];
    for(k=l;k<=h;k++)
	v[k]=b[k];
}

void mergesort(int* v, int l, int h)
{
    int m;
    if(h>l){
	m=(l+h)/2;
	mergesort(v,l,m);
	mergesort(v,m+1,h);
	merge(v,l,m,h);
	}

}