sunnyyouknow的专栏

/*//implement recursivelyint mgSort( const void *data, int size, int esize, int i, int k, int (*comp) (const void *a, const void *b) );//merge 2 sequential partstatic int merge( const void *da

// binTreeMN.cpp : Defines the entry point for the console application.//#include "stdafx.h"#include #include using namespace std;struct Node{ int val; Node *lChild; Node *rChild

// qkSort.cpp : Defines the entry point for the console application.//#include "stdafx.h"#include #include #include #include using namespace std;static compare_int(const void *key1

// RadixSort.cpp : Defines the entry point for the console application.//#include "stdafx.h"#include #include #include #include #include using namespace std;int rxSort(int *data,

/** binary search using */// sqrt.cpp : Defines the entry point for the console application.//#include "stdafx.h"#include #include #include using namespace std;double mySqrt(d

/*Reference:Texture synthesis by non-parametric sampling.pdfhttp://en.wikipedia.org/wiki/Texture_synthesisPotential applications: A successful texture synthesis algorithm's application is abroad