Đang chuẩn bị nút TẢI XUỐNG, xin hãy chờ
Tải xuống
This book discusses the development and implementation of data structures and algorithms using C#. The data structures we use in this book are found in the .NET Framework class library System.Collections. In this chapter, we develop the concept of a collection by first discussing the implementation of our own Collection class (using the array as the basis of our implementation) and then by covering the Collection classes in the .NET Framework. | MICHAEL McMillan Data Structures and Algorithms Using c e s Ị ỊỊỊIfy r Cambridge Data Structures and Algorithms Using C C 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 array and ArrayLists 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. Michael McMillan is Instructor of Computer Information Systems at Pulaski Technical College as well as an adjunct instructor at the University of Arkansas at Little Rock and the University of Central Arkansas. Mike s previous books include Object-Oriented Programming with Visual Basic.NET Data Structures and Algorithms Using Visual Basic.NET and Perl from the Ground Up. He is a co-author of Programming and Problem-Solving with Visual Basic.NET. Mike has written more than twenty-five trade journal articles on programming and has more than twenty years of experience programming for industry and .