The algorithmic complexity and the approximate entropy of EEG were calculated and analyzed with different data points, different sample frequencies and different sample time duration. The results showed that under fixed sample frequency, the longer the data was, the more stable the complexity values were. With fixed sample time duration or fixed data point, lower sample frequency would be better both for EEG distinguishing and for computing time saving.