Cacher is the code snippet organizer for pro developers

/*=============================================================================
#     FileName: mergeSort.cpp
#         Desc: Merge Sort
#       Author: KuoE0
#        Email: kuoe0.tw@gmail.com
#     HomePage: http://kuoe0.ch/
#      Version: 0.0.1
#   LastChange: 2013-03-05 02:55:56
#      History:
=============================================================================*/
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <vector>
using namespace std;

void mergeSort( vector< int > &num ) {
  // if sequence only contain one element, it is already a sorted sequence.
	if ( num.size() == 1 )
		return;
	// divide sequence
	vector< int > left( num.begin(), num.begin() + num.size() / 2 ), right( num.begin() + num.size() / 2, num.end() );
	// sort sub-sequence
	mergeSort( left );
	mergeSort( right );
	// merge
	// i point to origin, j point to left, k point to right
	for ( int i = 0, j = 0, k = 0; i < num.size(); ++i ) {
		// if left is less than right or right part is end.
		if ( ( j != left.size() && left[ j ] < right[ k ] ) || k == right.size() )
			num[ i ] = left[ j++ ];
		// if right is less than or equal to left or left part is end.
		else
			num[ i ] = right[ k++ ];
	}
}

int main() {
	int n;
	while ( ~scanf( "%d", &n ) ) {
		int x;
		vector< int > num;
		for ( int i = 0; i < n; ++i ) {
			scanf( "%d", &x );
			num.push_back( x );
		}

		mergeSort( num );
		for ( int i = 0; i < num.size(); ++i ) 
			printf( "%d ", num[ i ] );
		puts( "" );
	}
	return 0;
}

/*=============================================================================
#     FileName: mergeSort.cpp
#         Desc: Natural Merge Sort
#       Author: KuoE0
#        Email: kuoe0.tw@gmail.com
#     HomePage: http://kuoe0.ch/
#      Version: 0.0.1
#   LastChange: 2013-03-05 02:55:56
#      History:
=============================================================================*/
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <vector>
using namespace std;

void mergeSort( vector< int > &num ) {
	// divide sequence
	vector< int > sub[ 2 ];
	for ( int i = 0, cur = num[ 0 ], p = 0; i < num.size(); ++i ) {
		// if next element is decreasing, put to another part.
		if ( num[ i ] < cur )
			p = ++p % 2;
		sub[ p ].push_back( cur = num[ i ] );
	}
	if ( sub[ 1 ].empty() )
		return;
	// sort sub-sequence
	mergeSort( sub[ 0 ] );
	mergeSort( sub[ 1 ] );
	// merge
	// i point to origin, j point to left, k point to right
	for ( int i = 0, j = 0, k = 0; i < num.size(); ++i ) {
		// if left is less than right or right part is end.
		if ( ( j != sub[ 0 ].size() && sub[ 0 ][ j ] < sub[ 1 ][ k ] ) || k == sub[ 1 ].size() )
			num[ i ] = sub[ 0 ][ j++ ];
		// if right is less than or equal to left or left part is end.
		else
			num[ i ] = sub[ 1 ][ k++ ];
	}
}

int main() {
	int n;
	while ( ~scanf( "%d", &n ) ) {
		int x;
		vector< int > num;
		for ( int i = 0; i < n; ++i ) {
			scanf( "%d", &x );
			num.push_back( x );
		}

		mergeSort( num );
		for ( int i = 0; i < num.size(); ++i ) 
			printf( "%d ", num[ i ] );
		puts( "" );
	}
	return 0;
}