Binary de bruijin sequences have been widely used and studied. In this paper: two new algorithms for producing binary de bruijing sequences are presented. The first algorithm is acquired by improving the original algorithm proposed by Yuejiang Fluang. It takes An bits of storage and 2n units of time to produce one bit of sequence, witere the space complexity is identical to that of Hnang's algorithm. and the time complexity is one half that of Huang's algorithm. The sceond algorithm cmploys a new method to produce binary de bruijin sequences. It takes An bits of storage and n units of time to produce one bit, where the time complexity is one quarter that of Huang's aigorithm, THE other advantages of the two new aigorithins are that they produce de bruijin sequences with better 01 harmoniousness and can start computing from any n-tuple.