Created
November 17, 2015 06:42
-
-
Save thinkphp/7883a1a0c5ab81d72d0c to your computer and use it in GitHub Desktop.
merge sort with operator new and delete
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <fstream> | |
#include <iostream> | |
#define FIN "algsort.in" | |
#define FOUT "algsort.out" | |
using namespace std; | |
class Container { | |
public: | |
//constructor of the class | |
Container( int _n ): n( _n ){ | |
vec = new int[ n ]; | |
k = 0; | |
} | |
//destructor of the class | |
~Container() { delete [] vec; } | |
void added(int elem) { | |
*( vec + k++ ) = elem; | |
} | |
void sorted() { | |
_divide(0, n - 1); | |
} | |
void display() { | |
ofstream fout( FOUT ); | |
for(int i = 0; i < n; ++i) fout<<vec[ i ]<<" "; | |
} | |
private: | |
int *vec; | |
int n, k; | |
void _divide(int lo,int hi) { | |
if(lo == hi) return; | |
int m; | |
m = (lo + hi) >> 1; | |
_divide(lo, m); | |
_divide(m + 1, hi); | |
int i = lo, | |
j = m + 1, | |
k = lo, | |
*aux = new int[ hi - lo + 1 ]; | |
for(int it = lo; it <= hi; ++it) aux[ it - lo ] = vec[ it ]; | |
while(i <= m && j <= hi) { | |
if( aux[ i - lo ] <= aux[ j - lo ]) vec[ k++ ] = aux[ i++ - lo]; | |
else | |
vec[ k++ ] = aux[ j++ - lo]; | |
} | |
while(i <= m) vec[ k++ ] = aux[ i++ - lo]; | |
while(j <= hi) vec[ k++ ] = aux[ j++ - lo]; | |
delete [] aux; | |
} | |
}; | |
int main() { | |
int n, | |
elem; | |
ifstream fin( FIN ); | |
fin>>n; | |
Container container( n ); | |
for(int i = 0; i < n; ++i) fin>>elem, container.added( elem ); | |
container.sorted(); | |
container.display(); | |
return(0); | |
}; |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment