v2nero的专栏

2.1  插入排序#include #include #define TRACE_SUBSTEPS 1void func2_1() { int A[] = {5, 2, 4, 6, 1, 3, 10, 3, 5}; int key = 0; int j = 0, i = 0, k = 0; //============print sub title==========

一、五条性质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. 源代码ia_binarytree.h#ifndef __IA_BINARY_TREE_H__#define __IA_BINARY_TREE_H__#include typedef struct _binary_tree_node_t { int key; struct _binary_tree_node_t *p; struct _binary_tree_nod

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

#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

#include //PARTITIONint PARTITION(int *A, int p, int r){ int x = A[r]; int i = p - 1; int j = p; int tmp = 0; for (j = p; j < r; ++j) { if (A[j] <= x) { ++i; tmp = A[i]; A[i] = A

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)

先直接粘Code4_2.c#include #include #include "strassen.h"void print_mutrix(const int *A, int r, int c){ int i, j; printf("-----------------------------------\n"); for (i=0; i < r; ++i) { for

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

从一亿个数据中找出前100个最大值方法一：&gt; 新建一100个红黑树节点，将输入前100个保存进去，然后全部插入红黑树T&gt; 遍历剩下的所有输入，对每一个输入值，如果值大于红黑树中最小值，则删除最小值节点，然后修改被删除节点的值为当前输入，然后插入红黑树。复杂度为n*lg(m), n为输入数据条数，m为输出数据条数方法二：将红黑树替换成最小堆，每插入一条数据，只需要运行...