歸併排序和快速排序演算法實現

#include

<

iostream

>

#include

#include

<

ctime

>

using

namespace

std;

//// declaration

// merge sort

template

<

class t>

void mergesort(t ar,

int num)

;template

<

class t>

void mergesort_in(t ar[

], t ta,

int low,

int high)

;template

<

class t>

void

merge

(t ar[

], t ta,

int low,

int mid,

int high)

;// quick sort

template

<

class t>

void quicksort(t ar,

int num)

;template

<

class t>

void quicksort_in(t ar,

intleft

,int

right);

template

<

class t>

intpartition

(t ar,

intleft

,int

right);

// definition

// merge sort

template

<

class t>

void mergesort(t ar,

int num)

//mergesort

template

<

class t>

void mergesort_in(t ar[

], t ta,

int low,

int high)

}//mergesort_in

template

<

class t>

void

merge

(t ar[

], t ta,

int low,

int mid,

int high)

if(i>mid)

else

// copy array back

for(k=low; k<

=high;

++k)

ar[k]

=ta[k];}

// merge

// quick sort

template

<

class t>

void quicksort(t ar,

int num)

template

<

class t>

void quicksort_in(t ar,

intleft

,int

right)}

//quicksort

template

<

class t>

intpartition

(t ar,

intleft

,int

right

)ar[

left

]=ar[j]

;ar[j]

=key;

return j;

}//partition

/// main program

int main();

int test1[9]=;

cout<<"before sort:"<

int i, j;

const

int dim1=50;

const

int dim2=100000;

int(

*arr1)

[dim2]

=new

int[dim1]

[dim2]

;int

(*arr2)

[dim2]

=new

int[dim1]

[dim2]

;// make random numbers

srand((

unsigned

)time

(null))

;// set seed

for(i=0; i++i)

}// time merge sort

clock_t start=

clock()

;for

(i=0; i++i)

quicksort(arr1[i]

, dim2)

;cout

<

<

"quick sort(50*100000): "

<

<

(double)(

clock()

-start)

/clocks_per_sec

<

<

" seconds"

<

<

endl

;// time merge sort

start=

clock()

;for

(i=0; i++i)

mergesort(arr2[i]

, dim2)

;cout

<

<

"merge sort(50*100000): "

<

<

(double)(

clock()

-start)

/clocks_per_sec

<

<

" seconds"

<

<

endl

;return 0;