vearne的代码世界

 void heap_adjust(int a[],int i,int size){ int temp; int j = i*2 +1; if(i<=size/2-1){ //保证其为非叶子节点----这里请注意 if(j+1<size&&a[j]<a[j+1]){ //找出子节点中值最大的 j++; } if(a...

#include <iostream>using namespace std;class Base{public: void f(){ cout<<"base"<<endl; }private: int a;};int main(){ Base* b = new Base; delete b; dele...

#include <iostream>using namespace std;class Base{public: void f(){ cout<<"base"<<endl; }};class Derived:public Base{public: void f(){ cout<<"derived...

 #include <iostream>using namespace std;class based{public: based(){ } ~based(){ cout<<"flag 1"<<endl; } virtual void f(){ cout<<"ok1"<<endl;

 #include <iostream>#include <stack>using namespace std;struct node{int data;struct node* lchild;struct node* rchild;};typedef struct node Node;void inOrderTraverse(Nod...

#include <iostream>using namespace std;int get_median(int a[],int begin1,int end1,int b[],int begin2,int end2,int k){ if(begin1>end1){ //在数组A中无法找到 return get_median(b,begin2,end2,...

 #include <iostream>using namespace std;class smart_count{private: int use_count;public: smart_count(int c=0):use_count(c){ } ~smart_count(){} int addref(){ return ++us...

#include <iostream>using namespace std;template<int m,int n>void print(int a[m][n]){ for(int i=0;i<m;i++){ for(int j=0;j<n;j++){ cout<<a[i][j]<<" "; ...

#include <iostream>#include <queue>#include <algorithm>#include <stack>using namespace std;int a[5][5]={{0,1,0,1,0},{1,0,1,0,1},{0,1,0,1,1},{1,0,1,0,0},{1,0,1,0,0}...

非常好的参考资料1.HTTP 协议资料http://www.w3.org/Protocols/rfc2616/rfc2616-sec14.html#sec14.22.使用telnet模拟浏览器访问网页http://pcwanli.blog.163.com/blog/static/4531561120091115105240732/  #include "apue.h"...