We have two SQL servers, one is the production server, and the other one is reporting server. Reporting server keepts pulling records from production server and deletes expired record from production server. There are over 10M records, and there
dd is a popular, generic command-line tool for copying files from 1 location to another. It is often used to copy entire disk images.Like many Linux command line tools, it operates silently unless something unexpected happens. Its lack of visual
Whether for backup or forensics, the cloning of an encrypted hard drive can be accomplished easily using the dd, or disk dump, tool that comes with all POSIX-based operating systems. As a raw disk writer, dd takes all of the information on the
Optimization is often counter-intuitiveAnybody who's done intensive optimization knows that optimization is often counter-intuitive. Things you think would be faster often aren't. Consider, for example, the exercise of obtaining the current
I helped a colleague on debugging the program she wrote. It's so weird that if we invoke the program directly by cmd.exe, it executes perfectly. However, if we invoke it from another program wrote by she, both programs just hung there. I went
/** * binary search algorithm, correct and high performance; * this implementation will always return the first elment that equal to v; * and will avoid overflow when calc the middle; * and can reduce comparence count; * return -1 if not found; *
8、修改分治演算法,使得遞迴的最壞效能為線性時間編程珠璣裡面提示說,需要記錄Last Set Index,於是我便記錄之,但是問題是,如此最壞是不能線性,最好是O(n),就是左右都是第一個節點的時候。int subquadratic_conquer(int arry[], int l, int r){ int lmax; int rmax; int sum; int sub_l = l; int sub_r = r; if (l > r) {
前幾天看到一個朋友,想要在main執行之前執行一段代碼,當時記得不太清,就不敢貿然回答,怕誤導別人。等弄清楚了,卻發現那個文章不見了,汗。 先看幾個小例子: 1. #include <stdio.h>int a = 3; int main(int argc, char* argv[]){ printf("The value of a is %d./n", a); getchar(); return 0;} 2. #include <iostream>