Data structures and algorithms (C # implementation) series-Preface

Data structures and algorithms (C # implementation) series ----- Preface

Heavenkiller (original)

Computer programmers should be clear that language is just a tool, and algorithms are the soul. There are many development languages, such as C ++, VB, Perl, Java, C #, and scripting languages such as JS and vbs, many people do not know which one to choose. In fact, no matter which language, since he exists, he must have his value and specific purpose, which is often incomparable to other languages. For example, C ++ is suitable for the underlying programming of the system. Java is generally used for scenarios with high stability and compatibility requirements. For example, I usually use C ++ to write programs related to the operating system at the network base layer, and use C # To write ASP. net and other programs, supplemented by modeling tools such as Rose and rational xde when necessary. However, no matter which language you choose, algorithms are fundamental. When you master the algorithms, you master the fundamentals of all languages, so as to remain unchanged.

Microsoft's C # is a brand new language that allows you to deploy programs quickly and efficiently. Now we have a lot of information about C #, which can be found in all aspects. However, there seems to be nothing to do with C #'s data structure, I have only found three or four articles on csdn, And I just talked about simple data structures such as linked lists. So I used free time to write some data structures and algorithms in C #, hoping to help you learn the data structure. In addition, due to the rush of time, there may inevitably be some leaks. I hope you will not give me any further corrections. My email is Heavenkiller2002@yahoo.com.cn You are welcome to join me in exchange and study.

This series includes tree, N-tree, generalized tree, binary tree, BST Binary Search Tree, aVL Balance Tree, heap, binary heap, and graph. There are also some examples, such as hash tables, hashes, left-wing trees, two-item trees, and Haffman encoding trees. Due to the time relationship, they will not be available for the moment. Please try again later.

 

First, we will show you a class model graph generated using Rational xde for. net, so that you can have a rough understanding of all classes.