[Programming Pearl's Reading Notes] Chapter 1 code implementation

It is very convenient to use the bitset of C ++:

/************* Bitmap Sorting Algorithm **************/# include <iostream> # include <bitset> # include <fstream> using namespace STD; int main () {// view bitset implementation we can see that bitset stores bits indirectly by bit operations on unsigned long. // If a 32-bit bitset is saved, four unsigned long long Integer bitset <1000000> B; b. reset (); ifstream in ("before_sort.txt"); ofstream out ("after_sort.txt"); int I; while (! In. EOF () {In> I; B. set (I) ;}for (I = 0; I <1000000; ++ I) {If (B [I] = 1) {out <I <Endl ;}} return 0 ;}

Bitset member functions:

Http://msdn.microsoft.com/zh-cn/library/a727bt1b (V = vs.90)

For the bitset operation example, see:

Http://blog.csdn.net/lalor/article/details/7285296