000			02449cam a2200277 a 4500
008			080713s2007 enka b 001 0 eng
010			_a2006024382
020			_a0521876915
035			_a(Sirsi) u739
040			_aEG-CaNU _cEG-CaNU _dEG-CaNU
042			_ancode
082	0	0	_a005.133 _2 22
100	1		_aMcMillan, Michael, _d 1957 _9552
245	1	0	_aData structures and algorithms using C? / _c Michael McMillan.
260			_aCambridge ; _a New York : _b Cambridge University Press, _c 2007.
300			_ax, 355 p. : _b ill. ; _c 24 cm.
504			_aIncludes bibliographical references (p. 339) and index.
505	0		_a1. Collections -- 2. Arrays and arraylists -- 3. Basic sorting algorithms -- 4. Basic searching algorithms -- 5. Stacks and queues -- 6. The bitarray class -- 7. Strings, the string class and the stringbuilder class -- 8. Pattern matching and text processing -- 9. Building dictionaries - the dictionarybase class and the sortedlist class -- 10. Hashing and the hashtable class -- 11. Linked lists -- 12. Binary trees and binary search trees -- 13. Sets -- 14. Advanced sorting algorithms -- 15. Advanced data structures and algorithms for searching -- 16. Graphs and graph algorithms -- 17. Advanced algorithms.
520			_aC# programmers: no more translating data structures from C++ or Java to use in your programs! Mike McMillan provides a tutorial on how to use data structures and algorithms plus the first comprehensive reference for C# implementation of data structures and algorithms found in the .NET Framework library, as well as those developed by the programmer. The approach is very practical, using timing tests rather than Big O notation to analyze the efficiency of an approach. Coverage includes arrays and array lists, linked lists, hash tables, dictionaries, trees, graphs, and sorting and searching algorithms, as well as more advanced algorithms such as probabilistic algorithms and dynamic programming. This is the perfect resource for C# professionals and students alike.
630	0	0	_aCIT. _914
650		0	_aC# (Computer program language) _9101
596			_a1
999			_c6347 _d6347