v2nero的专栏

4.1 最大子数组问题#include //FIND-MAX-CROSSING-SUBARRAYstatic void find_max_crossing_subarray( __in const int *A, __in int low, __in int mid, __in int high, __out int *max_left_index, __out int

1. 源代码#include typedef struct _heap_t { int length; //array length int size; //heap size int *data;} heap_t;#define PARENT(i) ((i-1)/2)#define LEFT(i) (2*i + 1)#define RIGHT(i) (2*i + 2)

#include //COUNTING-SORT//k: 0-kvoid COUNTING_SORT( __in sortdata_i_t *A, __out sortdata_i_t *B, __in int k){ int *C = (int *)malloc(sizeof(int)*(k + 1)); int i = 0; int j = 0; for (i = 0

1 stack头文件#ifndef __IA_STACK_H__#define __IA_STACK_H__#include typedef struct _iastack_t { int top; int size; int *data;} iastack_t;//return 0 for success// -1 for errorint iasta

一、五条性质1. Every node is either red or black.2. The root is black.3. Every leaf (NIL ) is black.4. If a node is red, then both its children are black.5. For each node, all simple paths from th

为了避免项目布署麻烦，需要将执行文件尽量静态链接1. boost库全部静态链接2. c++库静态链接1,2点的改变如下，强制链静态库的方法为参数下为-l:libXXXX.a; 对于boost log, 需要将宏-DBOOST_LOG_DYN_LINK去掉LOCAL_STATICLIBS := boost_log boost_log_setup boost_system boost...