GengLSh的博客

#include using namespace std; void quicksort(int* tem, int left, int right) { if(left >= right) { return ; } else { int init_left = left, init_right = right; int pivot = tem[left]; while

#include #include using namespace std; void merge_sort(int* init_array,int* tem, int left, int right) { if(left >= right) return ; else { int start = left; int mid = (left + right) / 2;

#include #include #include #include using namespace std; struct node { int value; node* left; node* right; node(int v) { value = v; left = NULL; right = NULL; } }; bool swap_value(node*