## 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 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. |

### What people are saying - Write a review

User Review - Flag as inappropriate

This book is full of errors.I am not sure if they are printing mistakes or the content itself is horribly wrong.

Example on Page 201:Wrong content:

public void Insert(Object newItem, Object after) {

Node current = new Node();

Node newNode = new Node(newItem);

current = Find(after);

newNode.Flink = current.Link;

newNode.Blink = current;

current.Flink = newNode;

}

After correction:

public void Insert(Object newItem, Object after) {

Node current = new Node();

Node newNode = new Node(newItem);

current = Find(after);

newNode.Flink = current.Flink;

newNode.Blink = current;

current.Flink.Blink=newNode;

current.Flink = newNode;

}

### Contents

Section 1 | 26 |

Section 2 | 42 |

Section 3 | 55 |

Section 4 | 68 |

Section 5 | 94 |

Section 6 | 100 |

Section 7 | 101 |

Section 8 | 119 |

Section 11 | 165 |

Section 12 | 176 |

Section 13 | 194 |

Section 14 | 218 |

Section 15 | 237 |

Section 16 | 249 |

Section 17 | 263 |

Section 18 | 283 |

Section 9 | 147 |

Section 10 | 154 |

Section 19 | 314 |

### Other editions - View all

### Common terms and phrases

array element ArrayList AVL trees binary number binary tree BitArray class bitwise operators Bubble sort called chapter characters class chapter7 code fragment Collection class Console.WriteLine Console.WriteLine("The CSet current node current.Link current.Right data set data structure data type deﬁne deﬁnition deleted dynamic programming efﬁcient example False ﬁeld ﬁle ﬁnd ﬁnding ﬁrst for(int foreach graph greedy algorithm hash function hash table header heap Here’s the code implementation insert Insertion sort instantiate integer left child linked list LinkedList look loop match matchSet method takes minimum spanning tree NET Framework newNode Node class Node current node’s null number of elements output perform position private Node problem public class public int public Node public void queue QuickSort recursive red–black tree regular expression remove skip list SortedList sorting algorithms speciﬁed stack static void Main stored String class String objects StringBuilder object subroutine substring vertex