创新工场2014笔试算法题汇总

1. 堆排序

bool Find(int *matrixA, int m, int n, int element)  {      bool found = false;      if(matrixA != NULL & m & n)      {          int i,j;          i=0;j=n-1;          while(i<m;j>=0)          {              if(maxtrixA[i*n+j] == element)              {                  found = true;                  break;              }              else if(matrix[i*n+j]>element                  --j;              else                  ++i          }      }  } 

转载请注明原创链接：http://blog.csdn.net/wujunokay/article/details/12233289